./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f 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/bench-exp3x3-opt.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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:35:43,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:35:43,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:35:43,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:35:43,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:35:43,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:35:43,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:35:43,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:35:43,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:35:43,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:35:43,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:35:43,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:35:43,706 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:35:43,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:35:43,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:35:43,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:35:43,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:35:43,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:35:43,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:35:43,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:35:43,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:35:43,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:35:43,714 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:35:43,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:35:43,714 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:35:43,714 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:35:43,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:35:43,715 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:35:43,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:35:43,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:35:43,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:35:43,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:35:43,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:35:43,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:35:43,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:35:43,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:35:43,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:35:43,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:35:43,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:35:43,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:35:43,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:35:43,719 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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2024-11-10 14:35:43,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:35:43,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:35:44,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:35:44,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:35:44,002 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:35:44,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2024-11-10 14:35:45,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:35:45,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:35:45,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2024-11-10 14:35:45,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cac32d04/16841cd4ad5b43e693b7e7b22c5595a8/FLAG613b9acfc [2024-11-10 14:35:45,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cac32d04/16841cd4ad5b43e693b7e7b22c5595a8 [2024-11-10 14:35:45,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:35:45,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:35:45,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:35:45,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:35:45,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:35:45,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:35:45" (1/1) ... [2024-11-10 14:35:45,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642e974e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:45, skipping insertion in model container [2024-11-10 14:35:45,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:35:45" (1/1) ... [2024-11-10 14:35:45,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:35:45,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:35:46,001 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:35:46,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:35:46,067 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:35:46,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46 WrapperNode [2024-11-10 14:35:46,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:35:46,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:35:46,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:35:46,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:35:46,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (1/1) ... [2024-11-10 14:35:46,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (1/1) ... [2024-11-10 14:35:46,105 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 213 [2024-11-10 14:35:46,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:35:46,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:35:46,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:35:46,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:35:46,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (1/1) ... [2024-11-10 14:35:46,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (1/1) ... [2024-11-10 14:35:46,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (1/1) ... [2024-11-10 14:35:46,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (1/1) ... [2024-11-10 14:35:46,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (1/1) ... [2024-11-10 14:35:46,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (1/1) ... [2024-11-10 14:35:46,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (1/1) ... [2024-11-10 14:35:46,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (1/1) ... [2024-11-10 14:35:46,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:35:46,157 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:35:46,160 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:35:46,160 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:35:46,160 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (1/1) ... [2024-11-10 14:35:46,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:35:46,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:35:46,194 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-10 14:35:46,197 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-10 14:35:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:35:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:35:46,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:35:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:35:46,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:35:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:35:46,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:35:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-10 14:35:46,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-10 14:35:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:35:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-10 14:35:46,241 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-10 14:35:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-10 14:35:46,241 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-10 14:35:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:35:46,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:35:46,243 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:35:46,358 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:35:46,360 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:35:46,836 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:35:46,836 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:35:46,874 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:35:46,876 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:35:46,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:35:46 BoogieIcfgContainer [2024-11-10 14:35:46,877 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:35:46,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:35:46,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:35:46,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:35:46,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:35:45" (1/3) ... [2024-11-10 14:35:46,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a571022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:35:46, skipping insertion in model container [2024-11-10 14:35:46,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:46" (2/3) ... [2024-11-10 14:35:46,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a571022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:35:46, skipping insertion in model container [2024-11-10 14:35:46,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:35:46" (3/3) ... [2024-11-10 14:35:46,887 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2024-11-10 14:35:46,907 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:35:46,907 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2024-11-10 14:35:46,907 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:35:47,070 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-11-10 14:35:47,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 415 transitions, 872 flow [2024-11-10 14:35:47,279 INFO L124 PetriNetUnfolderBase]: 24/409 cut-off events. [2024-11-10 14:35:47,281 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:35:47,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 409 events. 24/409 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 853 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2024-11-10 14:35:47,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 415 transitions, 872 flow [2024-11-10 14:35:47,302 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 379 places, 382 transitions, 800 flow [2024-11-10 14:35:47,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:35:47,318 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;@2a53111d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:35:47,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 97 error locations. [2024-11-10 14:35:47,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:35:47,323 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-10 14:35:47,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:35:47,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:47,324 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] [2024-11-10 14:35:47,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:47,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1227476329, now seen corresponding path program 1 times [2024-11-10 14:35:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:47,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614145421] [2024-11-10 14:35:47,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:47,527 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-10 14:35:47,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:47,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614145421] [2024-11-10 14:35:47,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614145421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:47,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:47,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139843343] [2024-11-10 14:35:47,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:47,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:47,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:47,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:47,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-10 14:35:47,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:47,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:47,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-10 14:35:47,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:47,800 INFO L124 PetriNetUnfolderBase]: 40/509 cut-off events. [2024-11-10 14:35:47,801 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-10 14:35:47,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 509 events. 40/509 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1834 event pairs, 20 based on Foata normal form. 91/490 useless extension candidates. Maximal degree in co-relation 460. Up to 68 conditions per place. [2024-11-10 14:35:47,811 INFO L140 encePairwiseOnDemand]: 405/415 looper letters, 22 selfloop transitions, 2 changer transitions 1/374 dead transitions. [2024-11-10 14:35:47,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 374 transitions, 832 flow [2024-11-10 14:35:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-10 14:35:47,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-10 14:35:47,839 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 800 flow. Second operand 3 states and 1172 transitions. [2024-11-10 14:35:47,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 374 transitions, 832 flow [2024-11-10 14:35:47,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 808 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-10 14:35:47,855 INFO L231 Difference]: Finished difference. Result has 368 places, 373 transitions, 762 flow [2024-11-10 14:35:47,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=368, PETRI_TRANSITIONS=373} [2024-11-10 14:35:47,864 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -11 predicate places. [2024-11-10 14:35:47,864 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 373 transitions, 762 flow [2024-11-10 14:35:47,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:47,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:47,865 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] [2024-11-10 14:35:47,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:35:47,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:47,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:47,868 INFO L85 PathProgramCache]: Analyzing trace with hash 877420725, now seen corresponding path program 1 times [2024-11-10 14:35:47,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:47,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104635376] [2024-11-10 14:35:47,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:47,943 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-10 14:35:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104635376] [2024-11-10 14:35:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104635376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:47,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:47,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203336117] [2024-11-10 14:35:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:47,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:47,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:48,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-10 14:35:48,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 373 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:48,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:48,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-10 14:35:48,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:48,124 INFO L124 PetriNetUnfolderBase]: 40/507 cut-off events. [2024-11-10 14:35:48,124 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:35:48,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 507 events. 40/507 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1761 event pairs, 20 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 569. Up to 68 conditions per place. [2024-11-10 14:35:48,137 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-11-10 14:35:48,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 808 flow [2024-11-10 14:35:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-10 14:35:48,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-10 14:35:48,141 INFO L175 Difference]: Start difference. First operand has 368 places, 373 transitions, 762 flow. Second operand 3 states and 1165 transitions. [2024-11-10 14:35:48,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 808 flow [2024-11-10 14:35:48,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:48,152 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 760 flow [2024-11-10 14:35:48,152 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2024-11-10 14:35:48,153 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -13 predicate places. [2024-11-10 14:35:48,153 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 760 flow [2024-11-10 14:35:48,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:48,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:48,155 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:48,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:35:48,155 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:48,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash -271801097, now seen corresponding path program 1 times [2024-11-10 14:35:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:48,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10937728] [2024-11-10 14:35:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:48,230 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-10 14:35:48,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:48,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10937728] [2024-11-10 14:35:48,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10937728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:48,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:48,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:48,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928076443] [2024-11-10 14:35:48,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:48,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:48,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:48,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:48,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-10 14:35:48,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:48,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:48,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-10 14:35:48,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:48,391 INFO L124 PetriNetUnfolderBase]: 40/488 cut-off events. [2024-11-10 14:35:48,392 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-10 14:35:48,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 488 events. 40/488 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1600 event pairs, 20 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 539. Up to 68 conditions per place. [2024-11-10 14:35:48,399 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-11-10 14:35:48,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 371 transitions, 806 flow [2024-11-10 14:35:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-10 14:35:48,402 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-10 14:35:48,402 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 760 flow. Second operand 3 states and 1165 transitions. [2024-11-10 14:35:48,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 371 transitions, 806 flow [2024-11-10 14:35:48,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 371 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:48,409 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 758 flow [2024-11-10 14:35:48,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2024-11-10 14:35:48,411 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -14 predicate places. [2024-11-10 14:35:48,411 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 758 flow [2024-11-10 14:35:48,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:48,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:48,412 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] [2024-11-10 14:35:48,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:35:48,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:48,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash 411765510, now seen corresponding path program 1 times [2024-11-10 14:35:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:48,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241819628] [2024-11-10 14:35:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:48,468 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-10 14:35:48,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241819628] [2024-11-10 14:35:48,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241819628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:48,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:48,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:48,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702812483] [2024-11-10 14:35:48,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:48,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:48,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:48,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:48,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-10 14:35:48,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:48,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:48,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-10 14:35:48,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:48,614 INFO L124 PetriNetUnfolderBase]: 40/469 cut-off events. [2024-11-10 14:35:48,615 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-10 14:35:48,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 469 events. 40/469 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1407 event pairs, 20 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 509. Up to 68 conditions per place. [2024-11-10 14:35:48,622 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2024-11-10 14:35:48,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 370 transitions, 804 flow [2024-11-10 14:35:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-10 14:35:48,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-10 14:35:48,625 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 758 flow. Second operand 3 states and 1165 transitions. [2024-11-10 14:35:48,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 370 transitions, 804 flow [2024-11-10 14:35:48,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 370 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:48,631 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 756 flow [2024-11-10 14:35:48,632 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=364, PETRI_TRANSITIONS=370} [2024-11-10 14:35:48,634 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -15 predicate places. [2024-11-10 14:35:48,635 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 756 flow [2024-11-10 14:35:48,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:48,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:48,636 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:48,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:35:48,636 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:48,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash -367368549, now seen corresponding path program 1 times [2024-11-10 14:35:48,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:48,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923637475] [2024-11-10 14:35:48,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:48,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:48,697 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-10 14:35:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:48,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923637475] [2024-11-10 14:35:48,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923637475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:48,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:48,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258640842] [2024-11-10 14:35:48,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:48,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:48,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:48,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:48,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:48,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-10 14:35:48,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 370 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:48,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:48,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-10 14:35:48,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:48,822 INFO L124 PetriNetUnfolderBase]: 40/450 cut-off events. [2024-11-10 14:35:48,822 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-10 14:35:48,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 450 events. 40/450 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1235 event pairs, 20 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 479. Up to 68 conditions per place. [2024-11-10 14:35:48,840 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2024-11-10 14:35:48,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 369 transitions, 802 flow [2024-11-10 14:35:48,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-10 14:35:48,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-10 14:35:48,844 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 756 flow. Second operand 3 states and 1165 transitions. [2024-11-10 14:35:48,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 369 transitions, 802 flow [2024-11-10 14:35:48,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 369 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:48,851 INFO L231 Difference]: Finished difference. Result has 363 places, 369 transitions, 754 flow [2024-11-10 14:35:48,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=363, PETRI_TRANSITIONS=369} [2024-11-10 14:35:48,854 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -16 predicate places. [2024-11-10 14:35:48,855 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 369 transitions, 754 flow [2024-11-10 14:35:48,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:48,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:48,856 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:48,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:35:48,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:48,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1274514280, now seen corresponding path program 1 times [2024-11-10 14:35:48,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:48,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430721092] [2024-11-10 14:35:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:48,906 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-10 14:35:48,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:48,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430721092] [2024-11-10 14:35:48,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430721092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:48,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:48,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602300071] [2024-11-10 14:35:48,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:48,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:48,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:48,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:48,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:48,956 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2024-11-10 14:35:48,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 369 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:48,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:48,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2024-11-10 14:35:48,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:49,051 INFO L124 PetriNetUnfolderBase]: 40/431 cut-off events. [2024-11-10 14:35:49,051 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-10 14:35:49,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 431 events. 40/431 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1073 event pairs, 20 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 449. Up to 68 conditions per place. [2024-11-10 14:35:49,058 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2024-11-10 14:35:49,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 368 transitions, 800 flow [2024-11-10 14:35:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-10 14:35:49,061 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-10 14:35:49,061 INFO L175 Difference]: Start difference. First operand has 363 places, 369 transitions, 754 flow. Second operand 3 states and 1165 transitions. [2024-11-10 14:35:49,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 368 transitions, 800 flow [2024-11-10 14:35:49,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 368 transitions, 796 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:49,067 INFO L231 Difference]: Finished difference. Result has 362 places, 368 transitions, 752 flow [2024-11-10 14:35:49,068 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=362, PETRI_TRANSITIONS=368} [2024-11-10 14:35:49,069 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -17 predicate places. [2024-11-10 14:35:49,070 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 368 transitions, 752 flow [2024-11-10 14:35:49,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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-10 14:35:49,071 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:49,071 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] [2024-11-10 14:35:49,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:35:49,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:49,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:49,072 INFO L85 PathProgramCache]: Analyzing trace with hash 516074989, now seen corresponding path program 1 times [2024-11-10 14:35:49,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:49,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413890441] [2024-11-10 14:35:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:49,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:49,109 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-10 14:35:49,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:49,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413890441] [2024-11-10 14:35:49,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413890441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:49,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:49,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:49,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626244080] [2024-11-10 14:35:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:49,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:49,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:49,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:49,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:49,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 415 [2024-11-10 14:35:49,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 368 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-10 14:35:49,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:49,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 415 [2024-11-10 14:35:49,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:49,832 INFO L124 PetriNetUnfolderBase]: 758/4767 cut-off events. [2024-11-10 14:35:49,832 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-10 14:35:49,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 4767 events. 758/4767 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 46204 event pairs, 387 based on Foata normal form. 0/3500 useless extension candidates. Maximal degree in co-relation 5709. Up to 942 conditions per place. [2024-11-10 14:35:49,950 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 27 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-11-10 14:35:49,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 367 transitions, 808 flow [2024-11-10 14:35:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2024-11-10 14:35:49,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.927710843373494 [2024-11-10 14:35:49,953 INFO L175 Difference]: Start difference. First operand has 362 places, 368 transitions, 752 flow. Second operand 3 states and 1155 transitions. [2024-11-10 14:35:49,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 367 transitions, 808 flow [2024-11-10 14:35:49,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 367 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:49,958 INFO L231 Difference]: Finished difference. Result has 361 places, 367 transitions, 750 flow [2024-11-10 14:35:49,959 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=361, PETRI_TRANSITIONS=367} [2024-11-10 14:35:49,960 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -18 predicate places. [2024-11-10 14:35:49,960 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 367 transitions, 750 flow [2024-11-10 14:35:49,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-10 14:35:49,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:49,961 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:49,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:35:49,961 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:49,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:49,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2114354253, now seen corresponding path program 1 times [2024-11-10 14:35:49,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:49,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929333814] [2024-11-10 14:35:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:49,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:49,990 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-10 14:35:49,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:49,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929333814] [2024-11-10 14:35:49,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929333814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:49,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:49,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:49,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042650677] [2024-11-10 14:35:49,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:49,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:49,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:50,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-10 14:35:50,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 367 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:50,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:50,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-10 14:35:50,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:50,102 INFO L124 PetriNetUnfolderBase]: 55/497 cut-off events. [2024-11-10 14:35:50,102 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:35:50,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 497 events. 55/497 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1879 event pairs, 30 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 569. Up to 90 conditions per place. [2024-11-10 14:35:50,108 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/367 dead transitions. [2024-11-10 14:35:50,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 819 flow [2024-11-10 14:35:50,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2024-11-10 14:35:50,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2024-11-10 14:35:50,112 INFO L175 Difference]: Start difference. First operand has 361 places, 367 transitions, 750 flow. Second operand 3 states and 1160 transitions. [2024-11-10 14:35:50,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 819 flow [2024-11-10 14:35:50,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:50,119 INFO L231 Difference]: Finished difference. Result has 356 places, 362 transitions, 747 flow [2024-11-10 14:35:50,120 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=356, PETRI_TRANSITIONS=362} [2024-11-10 14:35:50,121 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -23 predicate places. [2024-11-10 14:35:50,121 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 362 transitions, 747 flow [2024-11-10 14:35:50,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:50,123 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:50,123 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:50,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:35:50,123 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:50,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash -374881882, now seen corresponding path program 1 times [2024-11-10 14:35:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:50,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984320254] [2024-11-10 14:35:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:50,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:50,152 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-10 14:35:50,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984320254] [2024-11-10 14:35:50,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984320254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:50,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:50,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:50,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162438190] [2024-11-10 14:35:50,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:50,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:50,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:50,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:50,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:50,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-10 14:35:50,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 362 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:50,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:50,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-10 14:35:50,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:50,302 INFO L124 PetriNetUnfolderBase]: 55/492 cut-off events. [2024-11-10 14:35:50,303 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-10 14:35:50,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 492 events. 55/492 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1798 event pairs, 30 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 552. Up to 90 conditions per place. [2024-11-10 14:35:50,308 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/362 dead transitions. [2024-11-10 14:35:50,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 362 transitions, 816 flow [2024-11-10 14:35:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2024-11-10 14:35:50,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2024-11-10 14:35:50,312 INFO L175 Difference]: Start difference. First operand has 356 places, 362 transitions, 747 flow. Second operand 3 states and 1160 transitions. [2024-11-10 14:35:50,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 362 transitions, 816 flow [2024-11-10 14:35:50,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 362 transitions, 813 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:35:50,320 INFO L231 Difference]: Finished difference. Result has 352 places, 357 transitions, 745 flow [2024-11-10 14:35:50,320 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=352, PETRI_TRANSITIONS=357} [2024-11-10 14:35:50,321 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -27 predicate places. [2024-11-10 14:35:50,321 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 357 transitions, 745 flow [2024-11-10 14:35:50,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:50,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:50,322 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] [2024-11-10 14:35:50,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:35:50,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1749392409, now seen corresponding path program 1 times [2024-11-10 14:35:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:50,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000833957] [2024-11-10 14:35:50,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:50,366 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-10 14:35:50,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:50,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000833957] [2024-11-10 14:35:50,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000833957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:50,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:50,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:50,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711873007] [2024-11-10 14:35:50,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:50,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:50,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:50,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:50,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-10 14:35:50,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 357 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:50,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:50,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-10 14:35:50,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:50,542 INFO L124 PetriNetUnfolderBase]: 66/657 cut-off events. [2024-11-10 14:35:50,543 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 14:35:50,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 657 events. 66/657 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2904 event pairs, 5 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 729. Up to 95 conditions per place. [2024-11-10 14:35:50,553 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 32 selfloop transitions, 3 changer transitions 0/360 dead transitions. [2024-11-10 14:35:50,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 360 transitions, 829 flow [2024-11-10 14:35:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-11-10 14:35:50,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.934136546184739 [2024-11-10 14:35:50,557 INFO L175 Difference]: Start difference. First operand has 352 places, 357 transitions, 745 flow. Second operand 3 states and 1163 transitions. [2024-11-10 14:35:50,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 360 transitions, 829 flow [2024-11-10 14:35:50,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 360 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:35:50,564 INFO L231 Difference]: Finished difference. Result has 348 places, 352 transitions, 743 flow [2024-11-10 14:35:50,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=348, PETRI_TRANSITIONS=352} [2024-11-10 14:35:50,566 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -31 predicate places. [2024-11-10 14:35:50,566 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 352 transitions, 743 flow [2024-11-10 14:35:50,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:50,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:50,567 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] [2024-11-10 14:35:50,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:35:50,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:50,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:50,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1835860015, now seen corresponding path program 1 times [2024-11-10 14:35:50,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:50,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647244085] [2024-11-10 14:35:50,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:50,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:50,633 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-10 14:35:50,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:50,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647244085] [2024-11-10 14:35:50,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647244085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:50,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:50,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486643096] [2024-11-10 14:35:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:50,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:50,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:50,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:50,667 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-10 14:35:50,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 352 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:50,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:50,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-10 14:35:50,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:50,886 INFO L124 PetriNetUnfolderBase]: 105/1026 cut-off events. [2024-11-10 14:35:50,887 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-10 14:35:50,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1026 events. 105/1026 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5776 event pairs, 40 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 896. Up to 154 conditions per place. [2024-11-10 14:35:50,897 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 34 selfloop transitions, 3 changer transitions 0/357 dead transitions. [2024-11-10 14:35:50,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 357 transitions, 837 flow [2024-11-10 14:35:50,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-10 14:35:50,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-10 14:35:50,901 INFO L175 Difference]: Start difference. First operand has 348 places, 352 transitions, 743 flow. Second operand 3 states and 1165 transitions. [2024-11-10 14:35:50,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 357 transitions, 837 flow [2024-11-10 14:35:50,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 357 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:35:50,907 INFO L231 Difference]: Finished difference. Result has 344 places, 347 transitions, 741 flow [2024-11-10 14:35:50,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=741, PETRI_PLACES=344, PETRI_TRANSITIONS=347} [2024-11-10 14:35:50,909 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -35 predicate places. [2024-11-10 14:35:50,909 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 347 transitions, 741 flow [2024-11-10 14:35:50,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:50,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:50,910 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] [2024-11-10 14:35:50,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:35:50,913 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:50,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1833908814, now seen corresponding path program 1 times [2024-11-10 14:35:50,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:50,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405082703] [2024-11-10 14:35:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:50,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:50,957 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-10 14:35:50,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:50,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405082703] [2024-11-10 14:35:50,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405082703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:50,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:50,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:50,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296947998] [2024-11-10 14:35:50,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:50,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:50,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:50,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:50,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:50,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-10 14:35:50,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 347 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:50,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:50,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-10 14:35:50,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:51,228 INFO L124 PetriNetUnfolderBase]: 199/1421 cut-off events. [2024-11-10 14:35:51,228 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-10 14:35:51,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 1421 events. 199/1421 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9642 event pairs, 98 based on Foata normal form. 0/1239 useless extension candidates. Maximal degree in co-relation 1436. Up to 302 conditions per place. [2024-11-10 14:35:51,253 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 0/351 dead transitions. [2024-11-10 14:35:51,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 351 transitions, 830 flow [2024-11-10 14:35:51,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions. [2024-11-10 14:35:51,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9349397590361446 [2024-11-10 14:35:51,256 INFO L175 Difference]: Start difference. First operand has 344 places, 347 transitions, 741 flow. Second operand 3 states and 1164 transitions. [2024-11-10 14:35:51,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 351 transitions, 830 flow [2024-11-10 14:35:51,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 351 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:35:51,262 INFO L231 Difference]: Finished difference. Result has 340 places, 342 transitions, 739 flow [2024-11-10 14:35:51,263 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=340, PETRI_TRANSITIONS=342} [2024-11-10 14:35:51,263 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -39 predicate places. [2024-11-10 14:35:51,264 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 342 transitions, 739 flow [2024-11-10 14:35:51,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:51,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:51,265 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] [2024-11-10 14:35:51,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:35:51,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:51,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:51,265 INFO L85 PathProgramCache]: Analyzing trace with hash -970071643, now seen corresponding path program 1 times [2024-11-10 14:35:51,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:51,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223189267] [2024-11-10 14:35:51,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:51,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:51,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-10 14:35:51,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:51,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223189267] [2024-11-10 14:35:51,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223189267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:51,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:51,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:51,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003592553] [2024-11-10 14:35:51,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:51,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:51,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:51,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:51,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:51,329 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2024-11-10 14:35:51,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 342 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:51,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:51,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2024-11-10 14:35:51,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:51,518 INFO L124 PetriNetUnfolderBase]: 175/1141 cut-off events. [2024-11-10 14:35:51,518 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-10 14:35:51,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 1141 events. 175/1141 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6503 event pairs, 82 based on Foata normal form. 1/1044 useless extension candidates. Maximal degree in co-relation 912. Up to 269 conditions per place. [2024-11-10 14:35:51,535 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 8/348 dead transitions. [2024-11-10 14:35:51,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 348 transitions, 836 flow [2024-11-10 14:35:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-10 14:35:51,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2024-11-10 14:35:51,538 INFO L175 Difference]: Start difference. First operand has 340 places, 342 transitions, 739 flow. Second operand 3 states and 1165 transitions. [2024-11-10 14:35:51,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 348 transitions, 836 flow [2024-11-10 14:35:51,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 348 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:35:51,545 INFO L231 Difference]: Finished difference. Result has 336 places, 329 transitions, 721 flow [2024-11-10 14:35:51,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=336, PETRI_TRANSITIONS=329} [2024-11-10 14:35:51,547 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -43 predicate places. [2024-11-10 14:35:51,547 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 329 transitions, 721 flow [2024-11-10 14:35:51,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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-10 14:35:51,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:51,548 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] [2024-11-10 14:35:51,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:35:51,548 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:35:51,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:51,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1271432388, now seen corresponding path program 1 times [2024-11-10 14:35:51,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:51,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758381764] [2024-11-10 14:35:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:51,589 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-10 14:35:51,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758381764] [2024-11-10 14:35:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758381764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:51,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:51,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042005331] [2024-11-10 14:35:51,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:51,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:51,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:51,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:51,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 415 [2024-11-10 14:35:51,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 329 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-10 14:35:51,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:51,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 415 [2024-11-10 14:35:51,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:59,836 INFO L124 PetriNetUnfolderBase]: 17906/60994 cut-off events. [2024-11-10 14:35:59,837 INFO L125 PetriNetUnfolderBase]: For 1608/1608 co-relation queries the response was YES. [2024-11-10 14:36:00,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89458 conditions, 60994 events. 17906/60994 cut-off events. For 1608/1608 co-relation queries the response was YES. Maximal size of possible extension queue 2231. Compared 865582 event pairs, 8762 based on Foata normal form. 1/52726 useless extension candidates. Maximal degree in co-relation 34103. Up to 21614 conditions per place. [2024-11-10 14:36:00,660 INFO L140 encePairwiseOnDemand]: 397/415 looper letters, 29 selfloop transitions, 6 changer transitions 58/328 dead transitions. [2024-11-10 14:36:00,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 328 transitions, 818 flow [2024-11-10 14:36:00,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2024-11-10 14:36:00,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9076305220883534 [2024-11-10 14:36:00,664 INFO L175 Difference]: Start difference. First operand has 336 places, 329 transitions, 721 flow. Second operand 3 states and 1130 transitions. [2024-11-10 14:36:00,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 328 transitions, 818 flow [2024-11-10 14:36:00,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 328 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:00,830 INFO L231 Difference]: Finished difference. Result has 319 places, 265 transitions, 619 flow [2024-11-10 14:36:00,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=319, PETRI_TRANSITIONS=265} [2024-11-10 14:36:00,831 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -60 predicate places. [2024-11-10 14:36:00,832 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 265 transitions, 619 flow [2024-11-10 14:36:00,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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-10 14:36:00,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:00,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] [2024-11-10 14:36:00,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:36:00,833 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:36:00,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash -63450112, now seen corresponding path program 1 times [2024-11-10 14:36:00,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:00,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19750284] [2024-11-10 14:36:00,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:00,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:00,871 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-10 14:36:00,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:00,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19750284] [2024-11-10 14:36:00,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19750284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:00,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:00,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874820559] [2024-11-10 14:36:00,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:00,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:00,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:00,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:00,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:00,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-10 14:36:00,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 265 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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-10 14:36:00,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:00,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-10 14:36:00,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:02,094 INFO L124 PetriNetUnfolderBase]: 1604/7454 cut-off events. [2024-11-10 14:36:02,094 INFO L125 PetriNetUnfolderBase]: For 33/49 co-relation queries the response was YES. [2024-11-10 14:36:02,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10493 conditions, 7454 events. 1604/7454 cut-off events. For 33/49 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 81510 event pairs, 362 based on Foata normal form. 0/6272 useless extension candidates. Maximal degree in co-relation 5435. Up to 1748 conditions per place. [2024-11-10 14:36:02,185 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-11-10 14:36:02,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 269 transitions, 684 flow [2024-11-10 14:36:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-10 14:36:02,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-10 14:36:02,192 INFO L175 Difference]: Start difference. First operand has 319 places, 265 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2024-11-10 14:36:02,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 269 transitions, 684 flow [2024-11-10 14:36:02,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 269 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:36:02,203 INFO L231 Difference]: Finished difference. Result has 268 places, 264 transitions, 621 flow [2024-11-10 14:36:02,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=268, PETRI_TRANSITIONS=264} [2024-11-10 14:36:02,204 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -111 predicate places. [2024-11-10 14:36:02,204 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 264 transitions, 621 flow [2024-11-10 14:36:02,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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-10 14:36:02,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:02,206 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] [2024-11-10 14:36:02,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:36:02,207 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:36:02,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1420121591, now seen corresponding path program 1 times [2024-11-10 14:36:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:02,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372938011] [2024-11-10 14:36:02,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:02,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:02,255 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-10 14:36:02,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:02,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372938011] [2024-11-10 14:36:02,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372938011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:02,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:02,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:02,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284562616] [2024-11-10 14:36:02,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:02,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:02,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:02,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:02,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:02,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-10 14:36:02,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 264 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-10 14:36:02,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:02,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-10 14:36:02,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:04,137 INFO L124 PetriNetUnfolderBase]: 3074/12904 cut-off events. [2024-11-10 14:36:04,138 INFO L125 PetriNetUnfolderBase]: For 257/273 co-relation queries the response was YES. [2024-11-10 14:36:04,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19339 conditions, 12904 events. 3074/12904 cut-off events. For 257/273 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 155150 event pairs, 939 based on Foata normal form. 0/11311 useless extension candidates. Maximal degree in co-relation 18739. Up to 2739 conditions per place. [2024-11-10 14:36:04,565 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-11-10 14:36:04,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 268 transitions, 686 flow [2024-11-10 14:36:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-10 14:36:04,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-10 14:36:04,568 INFO L175 Difference]: Start difference. First operand has 268 places, 264 transitions, 621 flow. Second operand 3 states and 1172 transitions. [2024-11-10 14:36:04,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 268 transitions, 686 flow [2024-11-10 14:36:04,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 268 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:04,579 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 619 flow [2024-11-10 14:36:04,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2024-11-10 14:36:04,580 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -112 predicate places. [2024-11-10 14:36:04,581 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 619 flow [2024-11-10 14:36:04,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-10 14:36:04,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:04,582 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:04,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:36:04,582 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:36:04,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:04,582 INFO L85 PathProgramCache]: Analyzing trace with hash 302567694, now seen corresponding path program 1 times [2024-11-10 14:36:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:04,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252249260] [2024-11-10 14:36:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:04,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:04,631 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-10 14:36:04,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:04,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252249260] [2024-11-10 14:36:04,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252249260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:04,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:04,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:04,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928275544] [2024-11-10 14:36:04,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:04,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:04,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:04,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:04,664 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-10 14:36:04,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-10 14:36:04,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:04,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-10 14:36:04,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:05,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, 286#L107-1true, 465#true, 454#true, 87#thread5ENTRYtrue, Black: 458#true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 446#true]) [2024-11-10 14:36:05,177 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-11-10 14:36:05,177 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-10 14:36:05,177 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-10 14:36:05,178 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:36:05,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, 286#L107-1true, 465#true, 454#true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2024-11-10 14:36:05,178 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-10 14:36:05,178 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-10 14:36:05,178 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:36:05,178 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:36:05,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 145#L57-2true, 286#L107-1true, 465#true, 454#true, 348#thread1ENTRYtrue, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true, 446#true]) [2024-11-10 14:36:05,187 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-11-10 14:36:05,187 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-10 14:36:05,187 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-10 14:36:05,187 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:36:05,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 145#L57-2true, 286#L107-1true, 465#true, 454#true, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true, 446#true]) [2024-11-10 14:36:05,371 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-10 14:36:05,372 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:36:05,372 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:36:05,372 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-10 14:36:05,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 286#L107-1true, 465#true, 454#true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:05,372 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-11-10 14:36:05,372 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:36:05,372 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-10 14:36:05,372 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-10 14:36:05,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, 286#L107-1true, Black: 454#true, 465#true, 87#thread5ENTRYtrue, Black: 458#true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2024-11-10 14:36:05,404 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-11-10 14:36:05,404 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-10 14:36:05,404 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:36:05,404 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:36:05,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 286#L107-1true, 465#true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2024-11-10 14:36:05,404 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-11-10 14:36:05,404 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-10 14:36:05,404 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-10 14:36:05,404 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:36:05,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 286#L107-1true, 465#true, 348#thread1ENTRYtrue, 87#thread5ENTRYtrue, Black: 458#true, 460#(= |#race~n~0| 0), Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:05,409 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-11-10 14:36:05,409 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:36:05,409 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:36:05,409 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-10 14:36:05,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, 465#true, 454#true, Black: 458#true, 87#thread5ENTRYtrue, 363#L108-1true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 446#true]) [2024-11-10 14:36:05,672 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-11-10 14:36:05,672 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-10 14:36:05,672 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-10 14:36:05,672 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:36:05,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, 465#true, 454#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2024-11-10 14:36:05,672 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:36:05,672 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:36:05,672 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-10 14:36:05,672 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:36:05,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, 173#L81-2true, Black: 458#true, 87#thread5ENTRYtrue, 363#L108-1true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 446#true]) [2024-11-10 14:36:05,673 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:36:05,673 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-10 14:36:05,673 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:36:05,673 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:36:05,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 465#true, 454#true, 348#thread1ENTRYtrue, 363#L108-1true, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true, 446#true]) [2024-11-10 14:36:05,678 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-11-10 14:36:05,678 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-10 14:36:05,678 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:36:05,678 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-10 14:36:05,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 286#L107-1true, 465#true, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:05,765 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-11-10 14:36:05,765 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-10 14:36:05,765 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:36:05,765 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-10 14:36:05,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 286#L107-1true, 465#true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:05,766 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-11-10 14:36:05,766 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:36:05,766 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-10 14:36:05,766 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:36:05,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, 173#L81-2true, 348#thread1ENTRYtrue, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2024-11-10 14:36:05,787 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:36:05,787 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:36:05,787 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:36:05,787 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-10 14:36:05,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 465#true, 454#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:05,819 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-10 14:36:05,819 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:36:05,819 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-10 14:36:05,819 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:36:05,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 465#true, 454#true, 363#L108-1true, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true, 446#true]) [2024-11-10 14:36:05,819 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:36:05,819 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:36:05,819 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-10 14:36:05,819 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:36:05,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, 173#L81-2true, 87#thread5ENTRYtrue, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true, 446#true]) [2024-11-10 14:36:05,820 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-10 14:36:05,820 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-10 14:36:05,820 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:36:05,820 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:36:05,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2024-11-10 14:36:05,851 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-10 14:36:05,851 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-10 14:36:05,851 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-10 14:36:05,851 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-10 14:36:05,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, Black: 458#true, 87#thread5ENTRYtrue, 363#L108-1true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2024-11-10 14:36:05,851 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-10 14:36:05,851 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-10 14:36:05,851 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-10 14:36:05,852 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:36:05,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, 173#L81-2true, 363#L108-1true, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true]) [2024-11-10 14:36:05,852 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-10 14:36:05,852 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-10 14:36:05,852 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-10 14:36:05,852 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-10 14:36:05,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, 44#thread6ENTRYtrue, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, 348#thread1ENTRYtrue, Black: 458#true, 363#L108-1true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:05,855 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-10 14:36:05,855 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-10 14:36:05,855 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:36:05,855 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-10 14:36:05,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, 173#L81-2true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2024-11-10 14:36:05,925 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-10 14:36:05,925 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:36:05,925 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-10 14:36:05,925 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:36:05,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, 173#L81-2true, 348#thread1ENTRYtrue, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:05,928 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-10 14:36:05,928 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-10 14:36:05,928 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:36:05,928 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:36:05,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, 44#thread6ENTRYtrue, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, Black: 458#true, 87#thread5ENTRYtrue, 363#L108-1true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:05,971 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-10 14:36:05,971 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-10 14:36:05,971 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-10 14:36:05,971 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-10 14:36:05,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, 44#thread6ENTRYtrue, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:05,971 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-10 14:36:05,972 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-10 14:36:05,972 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:36:05,972 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:36:05,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, 173#L81-2true, 363#L108-1true, 87#thread5ENTRYtrue, Black: 458#true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:05,972 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-10 14:36:05,972 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:36:05,972 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:36:05,972 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-10 14:36:06,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-3-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, 173#L81-2true, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:06,026 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-11-10 14:36:06,026 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:36:06,026 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-10 14:36:06,026 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-10 14:36:06,163 INFO L124 PetriNetUnfolderBase]: 2742/11065 cut-off events. [2024-11-10 14:36:06,164 INFO L125 PetriNetUnfolderBase]: For 467/483 co-relation queries the response was YES. [2024-11-10 14:36:06,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16991 conditions, 11065 events. 2742/11065 cut-off events. For 467/483 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 129804 event pairs, 823 based on Foata normal form. 0/9761 useless extension candidates. Maximal degree in co-relation 15815. Up to 2363 conditions per place. [2024-11-10 14:36:06,295 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2024-11-10 14:36:06,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 267 transitions, 684 flow [2024-11-10 14:36:06,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-10 14:36:06,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-10 14:36:06,299 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2024-11-10 14:36:06,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 267 transitions, 684 flow [2024-11-10 14:36:06,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 267 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:06,310 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 617 flow [2024-11-10 14:36:06,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2024-11-10 14:36:06,311 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -113 predicate places. [2024-11-10 14:36:06,312 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 617 flow [2024-11-10 14:36:06,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-10 14:36:06,313 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:06,313 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] [2024-11-10 14:36:06,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:36:06,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:36:06,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:06,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1194621447, now seen corresponding path program 1 times [2024-11-10 14:36:06,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:06,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438663914] [2024-11-10 14:36:06,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:06,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:06,356 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-10 14:36:06,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:06,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438663914] [2024-11-10 14:36:06,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438663914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:06,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:06,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:06,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696155677] [2024-11-10 14:36:06,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:06,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:06,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:06,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:06,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:06,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-10 14:36:06,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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-10 14:36:06,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:06,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-10 14:36:06,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:07,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-3-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, 454#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2024-11-10 14:36:07,591 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:36:07,591 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-10 14:36:07,592 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:36:07,592 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:36:07,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-3-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 173#L81-2true, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true]) [2024-11-10 14:36:07,592 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-10 14:36:07,592 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-10 14:36:07,592 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:36:07,592 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:36:07,731 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-3-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, 44#thread6ENTRYtrue, Black: 450#true, 145#L57-2true, 454#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:07,731 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-10 14:36:07,731 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:36:07,731 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:36:07,732 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-10 14:36:07,732 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-3-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 173#L81-2true, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:07,732 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-11-10 14:36:07,732 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:36:07,732 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-10 14:36:07,732 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-10 14:36:07,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-3-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true]) [2024-11-10 14:36:07,771 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-10 14:36:07,771 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-10 14:36:07,771 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-10 14:36:07,771 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-10 14:36:07,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-3-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, Black: 454#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2024-11-10 14:36:07,863 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-10 14:36:07,863 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:36:07,863 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:36:07,863 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-10 14:36:07,958 INFO L124 PetriNetUnfolderBase]: 2274/8999 cut-off events. [2024-11-10 14:36:07,958 INFO L125 PetriNetUnfolderBase]: For 515/537 co-relation queries the response was YES. [2024-11-10 14:36:08,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13701 conditions, 8999 events. 2274/8999 cut-off events. For 515/537 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 100431 event pairs, 686 based on Foata normal form. 2/7866 useless extension candidates. Maximal degree in co-relation 12799. Up to 1997 conditions per place. [2024-11-10 14:36:08,091 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2024-11-10 14:36:08,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 266 transitions, 682 flow [2024-11-10 14:36:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-10 14:36:08,094 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-10 14:36:08,094 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 617 flow. Second operand 3 states and 1172 transitions. [2024-11-10 14:36:08,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 266 transitions, 682 flow [2024-11-10 14:36:08,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:08,103 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 615 flow [2024-11-10 14:36:08,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2024-11-10 14:36:08,104 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -114 predicate places. [2024-11-10 14:36:08,104 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 615 flow [2024-11-10 14:36:08,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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-10 14:36:08,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:08,105 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] [2024-11-10 14:36:08,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:36:08,105 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:36:08,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:08,106 INFO L85 PathProgramCache]: Analyzing trace with hash -777496344, now seen corresponding path program 1 times [2024-11-10 14:36:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:08,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992328877] [2024-11-10 14:36:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:08,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:08,148 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-10 14:36:08,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:08,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992328877] [2024-11-10 14:36:08,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992328877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:08,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178329912] [2024-11-10 14:36:08,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:08,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:08,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:08,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:08,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-10 14:36:08,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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-10 14:36:08,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:08,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-10 14:36:08,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:09,079 INFO L124 PetriNetUnfolderBase]: 1885/7637 cut-off events. [2024-11-10 14:36:09,080 INFO L125 PetriNetUnfolderBase]: For 416/459 co-relation queries the response was YES. [2024-11-10 14:36:09,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11549 conditions, 7637 events. 1885/7637 cut-off events. For 416/459 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 82060 event pairs, 568 based on Foata normal form. 5/6733 useless extension candidates. Maximal degree in co-relation 10750. Up to 1778 conditions per place. [2024-11-10 14:36:09,190 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-11-10 14:36:09,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 680 flow [2024-11-10 14:36:09,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-10 14:36:09,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-10 14:36:09,193 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 615 flow. Second operand 3 states and 1172 transitions. [2024-11-10 14:36:09,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 680 flow [2024-11-10 14:36:09,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 265 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:09,203 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 613 flow [2024-11-10 14:36:09,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2024-11-10 14:36:09,204 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -115 predicate places. [2024-11-10 14:36:09,204 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 613 flow [2024-11-10 14:36:09,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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-10 14:36:09,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:09,205 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] [2024-11-10 14:36:09,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:36:09,205 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread6Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2024-11-10 14:36:09,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1075608409, now seen corresponding path program 1 times [2024-11-10 14:36:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:09,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366961583] [2024-11-10 14:36:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:09,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:09,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366961583] [2024-11-10 14:36:09,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366961583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:09,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:09,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:09,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244431945] [2024-11-10 14:36:09,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:09,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:09,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:09,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:09,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:09,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2024-11-10 14:36:09,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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-10 14:36:09,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:09,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2024-11-10 14:36:09,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:10,204 INFO L124 PetriNetUnfolderBase]: 1313/5788 cut-off events. [2024-11-10 14:36:10,205 INFO L125 PetriNetUnfolderBase]: For 224/252 co-relation queries the response was YES. [2024-11-10 14:36:10,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8341 conditions, 5788 events. 1313/5788 cut-off events. For 224/252 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 58497 event pairs, 333 based on Foata normal form. 4/5075 useless extension candidates. Maximal degree in co-relation 7649. Up to 1400 conditions per place. [2024-11-10 14:36:10,259 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 0 selfloop transitions, 0 changer transitions 264/264 dead transitions. [2024-11-10 14:36:10,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 678 flow [2024-11-10 14:36:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2024-11-10 14:36:10,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2024-11-10 14:36:10,263 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 613 flow. Second operand 3 states and 1172 transitions. [2024-11-10 14:36:10,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 678 flow [2024-11-10 14:36:10,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:10,272 INFO L231 Difference]: Finished difference. Result has 263 places, 0 transitions, 0 flow [2024-11-10 14:36:10,272 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=263, PETRI_TRANSITIONS=0} [2024-11-10 14:36:10,273 INFO L277 CegarLoopForPetriNet]: 379 programPoint places, -116 predicate places. [2024-11-10 14:36:10,273 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 0 transitions, 0 flow [2024-11-10 14:36:10,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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-10 14:36:10,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (96 of 97 remaining) [2024-11-10 14:36:10,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (95 of 97 remaining) [2024-11-10 14:36:10,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (94 of 97 remaining) [2024-11-10 14:36:10,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (93 of 97 remaining) [2024-11-10 14:36:10,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (92 of 97 remaining) [2024-11-10 14:36:10,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (91 of 97 remaining) [2024-11-10 14:36:10,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (90 of 97 remaining) [2024-11-10 14:36:10,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (89 of 97 remaining) [2024-11-10 14:36:10,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (88 of 97 remaining) [2024-11-10 14:36:10,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (87 of 97 remaining) [2024-11-10 14:36:10,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (86 of 97 remaining) [2024-11-10 14:36:10,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (85 of 97 remaining) [2024-11-10 14:36:10,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (84 of 97 remaining) [2024-11-10 14:36:10,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (83 of 97 remaining) [2024-11-10 14:36:10,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (82 of 97 remaining) [2024-11-10 14:36:10,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (81 of 97 remaining) [2024-11-10 14:36:10,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (80 of 97 remaining) [2024-11-10 14:36:10,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (79 of 97 remaining) [2024-11-10 14:36:10,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (78 of 97 remaining) [2024-11-10 14:36:10,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (77 of 97 remaining) [2024-11-10 14:36:10,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (76 of 97 remaining) [2024-11-10 14:36:10,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (75 of 97 remaining) [2024-11-10 14:36:10,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (74 of 97 remaining) [2024-11-10 14:36:10,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (73 of 97 remaining) [2024-11-10 14:36:10,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (72 of 97 remaining) [2024-11-10 14:36:10,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (71 of 97 remaining) [2024-11-10 14:36:10,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (70 of 97 remaining) [2024-11-10 14:36:10,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (69 of 97 remaining) [2024-11-10 14:36:10,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (68 of 97 remaining) [2024-11-10 14:36:10,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (67 of 97 remaining) [2024-11-10 14:36:10,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (66 of 97 remaining) [2024-11-10 14:36:10,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (65 of 97 remaining) [2024-11-10 14:36:10,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (64 of 97 remaining) [2024-11-10 14:36:10,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (63 of 97 remaining) [2024-11-10 14:36:10,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (62 of 97 remaining) [2024-11-10 14:36:10,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (61 of 97 remaining) [2024-11-10 14:36:10,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (60 of 97 remaining) [2024-11-10 14:36:10,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (59 of 97 remaining) [2024-11-10 14:36:10,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (58 of 97 remaining) [2024-11-10 14:36:10,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (57 of 97 remaining) [2024-11-10 14:36:10,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (56 of 97 remaining) [2024-11-10 14:36:10,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (55 of 97 remaining) [2024-11-10 14:36:10,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (54 of 97 remaining) [2024-11-10 14:36:10,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 97 remaining) [2024-11-10 14:36:10,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (52 of 97 remaining) [2024-11-10 14:36:10,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (51 of 97 remaining) [2024-11-10 14:36:10,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 97 remaining) [2024-11-10 14:36:10,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 97 remaining) [2024-11-10 14:36:10,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 97 remaining) [2024-11-10 14:36:10,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 97 remaining) [2024-11-10 14:36:10,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 97 remaining) [2024-11-10 14:36:10,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 97 remaining) [2024-11-10 14:36:10,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (44 of 97 remaining) [2024-11-10 14:36:10,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (43 of 97 remaining) [2024-11-10 14:36:10,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 97 remaining) [2024-11-10 14:36:10,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (41 of 97 remaining) [2024-11-10 14:36:10,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (40 of 97 remaining) [2024-11-10 14:36:10,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (39 of 97 remaining) [2024-11-10 14:36:10,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (38 of 97 remaining) [2024-11-10 14:36:10,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 97 remaining) [2024-11-10 14:36:10,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (36 of 97 remaining) [2024-11-10 14:36:10,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (35 of 97 remaining) [2024-11-10 14:36:10,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (34 of 97 remaining) [2024-11-10 14:36:10,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (33 of 97 remaining) [2024-11-10 14:36:10,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 97 remaining) [2024-11-10 14:36:10,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (31 of 97 remaining) [2024-11-10 14:36:10,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (30 of 97 remaining) [2024-11-10 14:36:10,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 97 remaining) [2024-11-10 14:36:10,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 97 remaining) [2024-11-10 14:36:10,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 97 remaining) [2024-11-10 14:36:10,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 97 remaining) [2024-11-10 14:36:10,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (25 of 97 remaining) [2024-11-10 14:36:10,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (24 of 97 remaining) [2024-11-10 14:36:10,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (23 of 97 remaining) [2024-11-10 14:36:10,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 97 remaining) [2024-11-10 14:36:10,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 97 remaining) [2024-11-10 14:36:10,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 97 remaining) [2024-11-10 14:36:10,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (19 of 97 remaining) [2024-11-10 14:36:10,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 97 remaining) [2024-11-10 14:36:10,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 97 remaining) [2024-11-10 14:36:10,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 97 remaining) [2024-11-10 14:36:10,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (15 of 97 remaining) [2024-11-10 14:36:10,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (14 of 97 remaining) [2024-11-10 14:36:10,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (13 of 97 remaining) [2024-11-10 14:36:10,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 97 remaining) [2024-11-10 14:36:10,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (11 of 97 remaining) [2024-11-10 14:36:10,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (10 of 97 remaining) [2024-11-10 14:36:10,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (9 of 97 remaining) [2024-11-10 14:36:10,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (8 of 97 remaining) [2024-11-10 14:36:10,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 97 remaining) [2024-11-10 14:36:10,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 97 remaining) [2024-11-10 14:36:10,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (5 of 97 remaining) [2024-11-10 14:36:10,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (4 of 97 remaining) [2024-11-10 14:36:10,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (3 of 97 remaining) [2024-11-10 14:36:10,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 97 remaining) [2024-11-10 14:36:10,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (1 of 97 remaining) [2024-11-10 14:36:10,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (0 of 97 remaining) [2024-11-10 14:36:10,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:36:10,293 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:10,300 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:36:10,300 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:36:10,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:36:10 BasicIcfg [2024-11-10 14:36:10,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:36:10,307 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:36:10,307 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:36:10,307 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:36:10,307 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:35:46" (3/4) ... [2024-11-10 14:36:10,309 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:36:10,313 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:36:10,313 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:36:10,313 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 14:36:10,314 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-10 14:36:10,314 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-10 14:36:10,314 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-10 14:36:10,322 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-11-10 14:36:10,322 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 14:36:10,323 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 14:36:10,323 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:36:10,427 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:36:10,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:36:10,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:36:10,428 INFO L158 Benchmark]: Toolchain (without parser) took 24719.11ms. Allocated memory was 151.0MB in the beginning and 12.7GB in the end (delta: 12.6GB). Free memory was 85.3MB in the beginning and 10.7GB in the end (delta: -10.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-10 14:36:10,428 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:36:10,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.60ms. Allocated memory is still 151.0MB. Free memory was 84.9MB in the beginning and 118.2MB in the end (delta: -33.4MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-10 14:36:10,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.86ms. Allocated memory is still 151.0MB. Free memory was 118.2MB in the beginning and 116.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:36:10,429 INFO L158 Benchmark]: Boogie Preprocessor took 50.12ms. Allocated memory is still 151.0MB. Free memory was 116.2MB in the beginning and 114.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:36:10,429 INFO L158 Benchmark]: IcfgBuilder took 719.60ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 84.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 14:36:10,430 INFO L158 Benchmark]: TraceAbstraction took 23427.52ms. Allocated memory was 151.0MB in the beginning and 12.7GB in the end (delta: 12.6GB). Free memory was 84.3MB in the beginning and 10.8GB in the end (delta: -10.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-10 14:36:10,430 INFO L158 Benchmark]: Witness Printer took 121.18ms. Allocated memory is still 12.7GB. Free memory was 10.8GB in the beginning and 10.7GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:36:10,432 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.17ms. Allocated memory is still 94.4MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.60ms. Allocated memory is still 151.0MB. Free memory was 84.9MB in the beginning and 118.2MB in the end (delta: -33.4MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.86ms. Allocated memory is still 151.0MB. Free memory was 118.2MB in the beginning and 116.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.12ms. Allocated memory is still 151.0MB. Free memory was 116.2MB in the beginning and 114.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 719.60ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 84.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23427.52ms. Allocated memory was 151.0MB in the beginning and 12.7GB in the end (delta: 12.6GB). Free memory was 84.3MB in the beginning and 10.8GB in the end (delta: -10.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 121.18ms. Allocated memory is still 12.7GB. Free memory was 10.8GB in the beginning and 10.7GB 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: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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 13 procedures, 536 locations, 97 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: 23.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 414 mSDsluCounter, 209 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 209 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=800occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1604 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 61 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:36:10,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE