./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:54:02,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:54:02,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:54:02,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:54:02,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:54:02,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:54:02,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:54:02,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:54:02,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:54:02,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:54:02,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:54:02,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:54:02,985 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:54:02,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:54:02,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:54:02,986 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:54:02,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:54:02,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:54:02,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:54:02,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:54:02,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:54:02,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:54:02,992 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:54:02,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:54:02,992 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:54:02,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:54:02,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:54:02,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:54:02,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:54:02,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:54:02,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:54:02,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:54:02,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:54:02,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:54:02,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:54:02,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:54:02,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:54:02,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:54:02,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:54:02,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:54:02,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:54:02,995 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 -> f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e [2024-11-19 05:54:03,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:54:03,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:54:03,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:54:03,309 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:54:03,310 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:54:03,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2024-11-19 05:54:04,740 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:54:04,974 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:54:04,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2024-11-19 05:54:04,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bd039db/7e92d90f40df477dbb09d53b07ce7e20/FLAG16871dc33 [2024-11-19 05:54:05,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bd039db/7e92d90f40df477dbb09d53b07ce7e20 [2024-11-19 05:54:05,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:54:05,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:54:05,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:54:05,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:54:05,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:54:05,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48430569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05, skipping insertion in model container [2024-11-19 05:54:05,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:54:05,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:54:05,696 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:54:05,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:54:05,856 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:54:05,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05 WrapperNode [2024-11-19 05:54:05,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:54:05,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:54:05,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:54:05,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:54:05,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,901 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2024-11-19 05:54:05,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:54:05,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:54:05,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:54:05,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:54:05,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:54:05,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:54:05,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:54:05,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:54:05,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (1/1) ... [2024-11-19 05:54:05,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:54:05,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:54:05,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:54:05,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:54:06,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:54:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:54:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 05:54:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:54:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:54:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 05:54:06,007 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 05:54:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:54:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:54:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 05:54:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:54:06,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:54:06,009 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:54:06,112 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:54:06,115 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:54:06,489 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:54:06,490 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:54:06,529 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:54:06,529 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-19 05:54:06,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:54:06 BoogieIcfgContainer [2024-11-19 05:54:06,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:54:06,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:54:06,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:54:06,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:54:06,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:54:05" (1/3) ... [2024-11-19 05:54:06,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175fa650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:54:06, skipping insertion in model container [2024-11-19 05:54:06,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:54:05" (2/3) ... [2024-11-19 05:54:06,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175fa650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:54:06, skipping insertion in model container [2024-11-19 05:54:06,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:54:06" (3/3) ... [2024-11-19 05:54:06,536 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_51-mutexptr_racefree.i [2024-11-19 05:54:06,561 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:54:06,562 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-19 05:54:06,562 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:54:06,628 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 05:54:06,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 250 transitions, 507 flow [2024-11-19 05:54:06,736 INFO L124 PetriNetUnfolderBase]: 19/324 cut-off events. [2024-11-19 05:54:06,736 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:54:06,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 324 events. 19/324 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 848 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 166. Up to 4 conditions per place. [2024-11-19 05:54:06,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 250 transitions, 507 flow [2024-11-19 05:54:06,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 240 places, 250 transitions, 507 flow [2024-11-19 05:54:06,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:54:06,769 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;@42da330c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:54:06,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-19 05:54:06,788 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:54:06,789 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2024-11-19 05:54:06,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:54:06,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:54:06,790 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] [2024-11-19 05:54:06,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2024-11-19 05:54:06,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:54:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1800102507, now seen corresponding path program 1 times [2024-11-19 05:54:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:54:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8676735] [2024-11-19 05:54:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:54:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:54:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:54:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:54:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:54:07,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8676735] [2024-11-19 05:54:07,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8676735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:54:07,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:54:07,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:54:07,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824200929] [2024-11-19 05:54:07,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:54:07,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:54:07,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:54:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:54:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:54:07,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 250 [2024-11-19 05:54:07,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 250 transitions, 507 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:07,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:54:07,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 250 [2024-11-19 05:54:07,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:54:07,468 INFO L124 PetriNetUnfolderBase]: 73/901 cut-off events. [2024-11-19 05:54:07,469 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:54:07,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 901 events. 73/901 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4416 event pairs, 72 based on Foata normal form. 84/897 useless extension candidates. Maximal degree in co-relation 899. Up to 175 conditions per place. [2024-11-19 05:54:07,482 INFO L140 encePairwiseOnDemand]: 235/250 looper letters, 22 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-11-19 05:54:07,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 235 transitions, 525 flow [2024-11-19 05:54:07,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:54:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:54:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2024-11-19 05:54:07,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8973333333333333 [2024-11-19 05:54:07,505 INFO L175 Difference]: Start difference. First operand has 240 places, 250 transitions, 507 flow. Second operand 3 states and 673 transitions. [2024-11-19 05:54:07,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 235 transitions, 525 flow [2024-11-19 05:54:07,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 235 transitions, 525 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:54:07,517 INFO L231 Difference]: Finished difference. Result has 239 places, 235 transitions, 481 flow [2024-11-19 05:54:07,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=239, PETRI_TRANSITIONS=235} [2024-11-19 05:54:07,523 INFO L277 CegarLoopForPetriNet]: 240 programPoint places, -1 predicate places. [2024-11-19 05:54:07,524 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 235 transitions, 481 flow [2024-11-19 05:54:07,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:07,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:54:07,526 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-19 05:54:07,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:54:07,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2024-11-19 05:54:07,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:54:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash 594032613, now seen corresponding path program 1 times [2024-11-19 05:54:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:54:07,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537903235] [2024-11-19 05:54:07,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:54:07,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:54:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:54:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:54:07,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:54:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537903235] [2024-11-19 05:54:07,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537903235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:54:07,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:54:07,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:54:07,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968269556] [2024-11-19 05:54:07,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:54:07,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:54:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:54:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:54:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:54:07,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 250 [2024-11-19 05:54:07,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 235 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:07,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:54:07,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 250 [2024-11-19 05:54:07,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:54:07,847 INFO L124 PetriNetUnfolderBase]: 48/724 cut-off events. [2024-11-19 05:54:07,848 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:54:07,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 724 events. 48/724 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3156 event pairs, 0 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 752. Up to 108 conditions per place. [2024-11-19 05:54:07,852 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 22 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2024-11-19 05:54:07,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 241 transitions, 541 flow [2024-11-19 05:54:07,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:54:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:54:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2024-11-19 05:54:07,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9093333333333333 [2024-11-19 05:54:07,856 INFO L175 Difference]: Start difference. First operand has 239 places, 235 transitions, 481 flow. Second operand 3 states and 682 transitions. [2024-11-19 05:54:07,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 241 transitions, 541 flow [2024-11-19 05:54:07,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 241 transitions, 537 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:54:07,861 INFO L231 Difference]: Finished difference. Result has 240 places, 235 transitions, 485 flow [2024-11-19 05:54:07,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=240, PETRI_TRANSITIONS=235} [2024-11-19 05:54:07,865 INFO L277 CegarLoopForPetriNet]: 240 programPoint places, 0 predicate places. [2024-11-19 05:54:07,865 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 235 transitions, 485 flow [2024-11-19 05:54:07,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:07,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:54:07,866 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] [2024-11-19 05:54:07,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:54:07,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2024-11-19 05:54:07,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:54:07,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1127339270, now seen corresponding path program 1 times [2024-11-19 05:54:07,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:54:07,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494725232] [2024-11-19 05:54:07,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:54:07,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:54:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:54:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:54:08,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:54:08,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494725232] [2024-11-19 05:54:08,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494725232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:54:08,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:54:08,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:54:08,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86579234] [2024-11-19 05:54:08,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:54:08,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:54:08,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:54:08,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:54:08,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:54:08,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 250 [2024-11-19 05:54:08,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 235 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:08,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:54:08,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 250 [2024-11-19 05:54:08,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:54:09,181 INFO L124 PetriNetUnfolderBase]: 578/2387 cut-off events. [2024-11-19 05:54:09,182 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-19 05:54:09,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 2387 events. 578/2387 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 16672 event pairs, 343 based on Foata normal form. 0/2171 useless extension candidates. Maximal degree in co-relation 3517. Up to 1071 conditions per place. [2024-11-19 05:54:09,192 INFO L140 encePairwiseOnDemand]: 227/250 looper letters, 73 selfloop transitions, 70 changer transitions 0/328 dead transitions. [2024-11-19 05:54:09,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 328 transitions, 960 flow [2024-11-19 05:54:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:54:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:54:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1266 transitions. [2024-11-19 05:54:09,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.844 [2024-11-19 05:54:09,195 INFO L175 Difference]: Start difference. First operand has 240 places, 235 transitions, 485 flow. Second operand 6 states and 1266 transitions. [2024-11-19 05:54:09,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 328 transitions, 960 flow [2024-11-19 05:54:09,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 328 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:54:09,200 INFO L231 Difference]: Finished difference. Result has 248 places, 304 transitions, 944 flow [2024-11-19 05:54:09,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=248, PETRI_TRANSITIONS=304} [2024-11-19 05:54:09,201 INFO L277 CegarLoopForPetriNet]: 240 programPoint places, 8 predicate places. [2024-11-19 05:54:09,202 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 304 transitions, 944 flow [2024-11-19 05:54:09,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:09,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:54:09,203 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] [2024-11-19 05:54:09,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:54:09,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2024-11-19 05:54:09,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:54:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1436381775, now seen corresponding path program 1 times [2024-11-19 05:54:09,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:54:09,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543505923] [2024-11-19 05:54:09,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:54:09,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:54:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:54:09,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:54:09,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:54:09,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543505923] [2024-11-19 05:54:09,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543505923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:54:09,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:54:09,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:54:09,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129517222] [2024-11-19 05:54:09,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:54:09,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:54:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:54:09,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:54:09,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:54:09,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 250 [2024-11-19 05:54:09,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 304 transitions, 944 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:09,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:54:09,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 250 [2024-11-19 05:54:09,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:54:09,456 INFO L124 PetriNetUnfolderBase]: 260/1623 cut-off events. [2024-11-19 05:54:09,456 INFO L125 PetriNetUnfolderBase]: For 90/101 co-relation queries the response was YES. [2024-11-19 05:54:09,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 1623 events. 260/1623 cut-off events. For 90/101 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10493 event pairs, 110 based on Foata normal form. 0/1520 useless extension candidates. Maximal degree in co-relation 2353. Up to 299 conditions per place. [2024-11-19 05:54:09,465 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 25 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2024-11-19 05:54:09,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 300 transitions, 990 flow [2024-11-19 05:54:09,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:54:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:54:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2024-11-19 05:54:09,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.868 [2024-11-19 05:54:09,467 INFO L175 Difference]: Start difference. First operand has 248 places, 304 transitions, 944 flow. Second operand 3 states and 651 transitions. [2024-11-19 05:54:09,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 300 transitions, 990 flow [2024-11-19 05:54:09,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 300 transitions, 990 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:54:09,476 INFO L231 Difference]: Finished difference. Result has 245 places, 300 transitions, 946 flow [2024-11-19 05:54:09,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=245, PETRI_TRANSITIONS=300} [2024-11-19 05:54:09,477 INFO L277 CegarLoopForPetriNet]: 240 programPoint places, 5 predicate places. [2024-11-19 05:54:09,477 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 300 transitions, 946 flow [2024-11-19 05:54:09,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:09,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:54:09,478 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:54:09,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:54:09,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2024-11-19 05:54:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:54:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2018360654, now seen corresponding path program 1 times [2024-11-19 05:54:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:54:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895875700] [2024-11-19 05:54:09,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:54:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:54:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:54:09,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:54:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:54:09,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:54:09,545 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:54:09,545 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2024-11-19 05:54:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2024-11-19 05:54:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2024-11-19 05:54:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2024-11-19 05:54:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2024-11-19 05:54:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2024-11-19 05:54:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2024-11-19 05:54:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2024-11-19 05:54:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2024-11-19 05:54:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2024-11-19 05:54:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2024-11-19 05:54:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2024-11-19 05:54:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2024-11-19 05:54:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2024-11-19 05:54:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2024-11-19 05:54:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2024-11-19 05:54:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2024-11-19 05:54:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2024-11-19 05:54:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2024-11-19 05:54:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2024-11-19 05:54:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2024-11-19 05:54:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2024-11-19 05:54:09,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:54:09,551 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 05:54:09,553 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:54:09,553 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 05:54:09,579 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:54:09,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 327 transitions, 670 flow [2024-11-19 05:54:09,624 INFO L124 PetriNetUnfolderBase]: 34/503 cut-off events. [2024-11-19 05:54:09,625 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:54:09,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 503 events. 34/503 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1777 event pairs, 0 based on Foata normal form. 0/431 useless extension candidates. Maximal degree in co-relation 326. Up to 8 conditions per place. [2024-11-19 05:54:09,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 327 transitions, 670 flow [2024-11-19 05:54:09,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 327 transitions, 670 flow [2024-11-19 05:54:09,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:54:09,634 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;@42da330c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:54:09,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-11-19 05:54:09,638 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:54:09,639 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2024-11-19 05:54:09,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:54:09,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:54:09,639 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] [2024-11-19 05:54:09,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-19 05:54:09,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:54:09,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1276136427, now seen corresponding path program 1 times [2024-11-19 05:54:09,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:54:09,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697572600] [2024-11-19 05:54:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:54:09,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:54:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:54:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:54:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:54:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697572600] [2024-11-19 05:54:09,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697572600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:54:09,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:54:09,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:54:09,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559317586] [2024-11-19 05:54:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:54:09,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:54:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:54:09,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:54:09,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:54:09,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 327 [2024-11-19 05:54:09,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 327 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:09,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:54:09,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 327 [2024-11-19 05:54:09,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:54:11,039 INFO L124 PetriNetUnfolderBase]: 1642/9394 cut-off events. [2024-11-19 05:54:11,039 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2024-11-19 05:54:11,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12127 conditions, 9394 events. 1642/9394 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 97562 event pairs, 1629 based on Foata normal form. 1315/9786 useless extension candidates. Maximal degree in co-relation 10772. Up to 2673 conditions per place. [2024-11-19 05:54:11,095 INFO L140 encePairwiseOnDemand]: 306/327 looper letters, 33 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2024-11-19 05:54:11,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 306 transitions, 698 flow [2024-11-19 05:54:11,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:54:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:54:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 870 transitions. [2024-11-19 05:54:11,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8868501529051988 [2024-11-19 05:54:11,098 INFO L175 Difference]: Start difference. First operand has 312 places, 327 transitions, 670 flow. Second operand 3 states and 870 transitions. [2024-11-19 05:54:11,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 306 transitions, 698 flow [2024-11-19 05:54:11,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 306 transitions, 698 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:54:11,103 INFO L231 Difference]: Finished difference. Result has 311 places, 306 transitions, 632 flow [2024-11-19 05:54:11,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=311, PETRI_TRANSITIONS=306} [2024-11-19 05:54:11,104 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -1 predicate places. [2024-11-19 05:54:11,104 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 306 transitions, 632 flow [2024-11-19 05:54:11,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:11,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:54:11,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] [2024-11-19 05:54:11,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:54:11,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-19 05:54:11,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:54:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1729178612, now seen corresponding path program 1 times [2024-11-19 05:54:11,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:54:11,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205947472] [2024-11-19 05:54:11,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:54:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:54:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:54:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:54:11,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:54:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205947472] [2024-11-19 05:54:11,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205947472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:54:11,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:54:11,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:54:11,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899747862] [2024-11-19 05:54:11,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:54:11,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:54:11,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:54:11,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:54:11,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:54:11,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 327 [2024-11-19 05:54:11,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 306 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:11,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:54:11,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 327 [2024-11-19 05:54:11,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:54:11,953 INFO L124 PetriNetUnfolderBase]: 788/5496 cut-off events. [2024-11-19 05:54:11,954 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-11-19 05:54:11,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6852 conditions, 5496 events. 788/5496 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 53175 event pairs, 348 based on Foata normal form. 1/4832 useless extension candidates. Maximal degree in co-relation 6755. Up to 1303 conditions per place. [2024-11-19 05:54:11,989 INFO L140 encePairwiseOnDemand]: 324/327 looper letters, 31 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2024-11-19 05:54:11,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 313 transitions, 712 flow [2024-11-19 05:54:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:54:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:54:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 880 transitions. [2024-11-19 05:54:11,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8970438328236493 [2024-11-19 05:54:11,991 INFO L175 Difference]: Start difference. First operand has 311 places, 306 transitions, 632 flow. Second operand 3 states and 880 transitions. [2024-11-19 05:54:11,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 313 transitions, 712 flow [2024-11-19 05:54:11,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 313 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:54:11,995 INFO L231 Difference]: Finished difference. Result has 312 places, 307 transitions, 640 flow [2024-11-19 05:54:11,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=312, PETRI_TRANSITIONS=307} [2024-11-19 05:54:11,996 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, 0 predicate places. [2024-11-19 05:54:11,997 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 307 transitions, 640 flow [2024-11-19 05:54:11,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:11,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:54:11,998 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] [2024-11-19 05:54:11,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:54:11,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-19 05:54:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:54:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 295510145, now seen corresponding path program 1 times [2024-11-19 05:54:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:54:11,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758232821] [2024-11-19 05:54:11,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:54:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:54:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:54:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:54:12,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:54:12,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758232821] [2024-11-19 05:54:12,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758232821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:54:12,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:54:12,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:54:12,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333336912] [2024-11-19 05:54:12,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:54:12,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:54:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:54:12,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:54:12,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:54:12,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 327 [2024-11-19 05:54:12,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 307 transitions, 640 flow. Second operand has 6 states, 6 states have (on average 235.5) internal successors, (1413), 6 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:12,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:54:12,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 327 [2024-11-19 05:54:12,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:54:21,349 INFO L124 PetriNetUnfolderBase]: 29144/72431 cut-off events. [2024-11-19 05:54:21,350 INFO L125 PetriNetUnfolderBase]: For 1348/1348 co-relation queries the response was YES. [2024-11-19 05:54:21,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118632 conditions, 72431 events. 29144/72431 cut-off events. For 1348/1348 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 843640 event pairs, 20506 based on Foata normal form. 0/66594 useless extension candidates. Maximal degree in co-relation 118337. Up to 40528 conditions per place. [2024-11-19 05:54:21,902 INFO L140 encePairwiseOnDemand]: 288/327 looper letters, 123 selfloop transitions, 135 changer transitions 0/490 dead transitions. [2024-11-19 05:54:21,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 490 transitions, 1532 flow [2024-11-19 05:54:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:54:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:54:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1661 transitions. [2024-11-19 05:54:21,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8465851172273191 [2024-11-19 05:54:21,907 INFO L175 Difference]: Start difference. First operand has 312 places, 307 transitions, 640 flow. Second operand 6 states and 1661 transitions. [2024-11-19 05:54:21,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 490 transitions, 1532 flow [2024-11-19 05:54:21,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 490 transitions, 1529 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:54:21,932 INFO L231 Difference]: Finished difference. Result has 321 places, 441 transitions, 1528 flow [2024-11-19 05:54:21,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1528, PETRI_PLACES=321, PETRI_TRANSITIONS=441} [2024-11-19 05:54:21,935 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, 9 predicate places. [2024-11-19 05:54:21,935 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 441 transitions, 1528 flow [2024-11-19 05:54:21,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.5) internal successors, (1413), 6 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:21,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:54:21,937 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] [2024-11-19 05:54:21,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:54:21,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-19 05:54:21,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:54:21,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1453012179, now seen corresponding path program 1 times [2024-11-19 05:54:21,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:54:21,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732884005] [2024-11-19 05:54:21,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:54:21,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:54:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:54:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:54:21,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:54:21,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732884005] [2024-11-19 05:54:21,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732884005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:54:21,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:54:21,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:54:21,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951827642] [2024-11-19 05:54:21,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:54:21,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:54:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:54:21,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:54:21,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:54:22,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 327 [2024-11-19 05:54:22,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 441 transitions, 1528 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:22,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:54:22,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 327 [2024-11-19 05:54:22,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:54:27,734 INFO L124 PetriNetUnfolderBase]: 14879/50521 cut-off events. [2024-11-19 05:54:27,735 INFO L125 PetriNetUnfolderBase]: For 5273/5866 co-relation queries the response was YES. [2024-11-19 05:54:27,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86710 conditions, 50521 events. 14879/50521 cut-off events. For 5273/5866 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 635845 event pairs, 9103 based on Foata normal form. 0/46824 useless extension candidates. Maximal degree in co-relation 75640. Up to 14377 conditions per place. [2024-11-19 05:54:28,081 INFO L140 encePairwiseOnDemand]: 315/327 looper letters, 40 selfloop transitions, 3 changer transitions 0/436 dead transitions. [2024-11-19 05:54:28,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 436 transitions, 1609 flow [2024-11-19 05:54:28,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:54:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:54:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 832 transitions. [2024-11-19 05:54:28,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8481141692150866 [2024-11-19 05:54:28,084 INFO L175 Difference]: Start difference. First operand has 321 places, 441 transitions, 1528 flow. Second operand 3 states and 832 transitions. [2024-11-19 05:54:28,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 436 transitions, 1609 flow [2024-11-19 05:54:28,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 436 transitions, 1609 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:54:28,177 INFO L231 Difference]: Finished difference. Result has 315 places, 435 transitions, 1531 flow [2024-11-19 05:54:28,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1531, PETRI_PLACES=315, PETRI_TRANSITIONS=435} [2024-11-19 05:54:28,179 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, 3 predicate places. [2024-11-19 05:54:28,180 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 435 transitions, 1531 flow [2024-11-19 05:54:28,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:28,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:54:28,180 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] [2024-11-19 05:54:28,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:54:28,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-11-19 05:54:28,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:54:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1388850367, now seen corresponding path program 1 times [2024-11-19 05:54:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:54:28,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857739867] [2024-11-19 05:54:28,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:54:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:54:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:54:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:54:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:54:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857739867] [2024-11-19 05:54:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857739867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:54:28,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:54:28,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:54:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256770790] [2024-11-19 05:54:28,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:54:28,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:54:28,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:54:28,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:54:28,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:54:28,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 327 [2024-11-19 05:54:28,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 435 transitions, 1531 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:54:28,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:54:28,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 327 [2024-11-19 05:54:28,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand