./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d7936e5b6ec9509cab6289f8b3da6dd07c923c681ccf9d629892aaea9fa54f9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:22:00,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:22:00,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:22:00,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:22:00,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:22:00,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:22:00,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:22:00,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:22:00,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:22:00,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:22:00,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:22:00,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:22:00,663 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:22:00,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:22:00,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:22:00,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:22:00,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:22:00,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:22:00,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:22:00,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:22:00,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:22:00,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:22:00,669 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:22:00,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:22:00,670 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:22:00,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:22:00,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:22:00,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:22:00,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:22:00,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:22:00,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:22:00,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:22:00,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:22:00,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:22:00,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:22:00,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:22:00,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:22:00,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:22:00,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:22:00,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:22:00,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:22:00,676 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 -> 9d7936e5b6ec9509cab6289f8b3da6dd07c923c681ccf9d629892aaea9fa54f9 [2024-10-24 15:22:00,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:22:00,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:22:00,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:22:00,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:22:00,944 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:22:00,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i [2024-10-24 15:22:02,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:22:02,616 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:22:02,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-2.i [2024-10-24 15:22:02,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e1a9cf4/9636e8f4d23e41b7a989bfa907491c35/FLAGdc1e6f830 [2024-10-24 15:22:02,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e1a9cf4/9636e8f4d23e41b7a989bfa907491c35 [2024-10-24 15:22:02,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:22:02,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:22:02,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:22:02,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:22:02,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:22:02,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:22:02" (1/1) ... [2024-10-24 15:22:02,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2421a94e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:02, skipping insertion in model container [2024-10-24 15:22:02,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:22:02" (1/1) ... [2024-10-24 15:22:02,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:22:03,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:22:03,255 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:22:03,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:22:03,393 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:22:03,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03 WrapperNode [2024-10-24 15:22:03,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:22:03,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:22:03,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:22:03,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:22:03,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (1/1) ... [2024-10-24 15:22:03,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (1/1) ... [2024-10-24 15:22:03,464 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2024-10-24 15:22:03,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:22:03,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:22:03,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:22:03,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:22:03,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (1/1) ... [2024-10-24 15:22:03,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (1/1) ... [2024-10-24 15:22:03,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (1/1) ... [2024-10-24 15:22:03,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (1/1) ... [2024-10-24 15:22:03,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (1/1) ... [2024-10-24 15:22:03,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (1/1) ... [2024-10-24 15:22:03,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (1/1) ... [2024-10-24 15:22:03,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (1/1) ... [2024-10-24 15:22:03,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:22:03,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:22:03,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:22:03,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:22:03,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (1/1) ... [2024-10-24 15:22:03,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:22:03,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:22:03,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 15:22:03,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 15:22:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-24 15:22:03,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-24 15:22:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-24 15:22:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-24 15:22:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:22:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:22:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:22:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:22:03,600 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:22:03,771 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:22:03,773 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:22:03,974 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:22:03,978 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:22:04,006 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:22:04,007 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 15:22:04,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:22:04 BoogieIcfgContainer [2024-10-24 15:22:04,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:22:04,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:22:04,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:22:04,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:22:04,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:22:02" (1/3) ... [2024-10-24 15:22:04,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ff9da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:22:04, skipping insertion in model container [2024-10-24 15:22:04,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:22:03" (2/3) ... [2024-10-24 15:22:04,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ff9da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:22:04, skipping insertion in model container [2024-10-24 15:22:04,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:22:04" (3/3) ... [2024-10-24 15:22:04,024 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-2.i [2024-10-24 15:22:04,046 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:22:04,046 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-10-24 15:22:04,047 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:22:04,127 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 15:22:04,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 111 transitions, 230 flow [2024-10-24 15:22:04,251 INFO L124 PetriNetUnfolderBase]: 6/124 cut-off events. [2024-10-24 15:22:04,256 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:22:04,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 124 events. 6/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 170 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. [2024-10-24 15:22:04,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 111 transitions, 230 flow [2024-10-24 15:22:04,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 110 transitions, 227 flow [2024-10-24 15:22:04,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:22:04,304 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;@11207f86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:22:04,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-24 15:22:04,313 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:22:04,319 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-10-24 15:22:04,319 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:22:04,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:22:04,320 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:22:04,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:22:04,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:22:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1524266874, now seen corresponding path program 1 times [2024-10-24 15:22:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:22:04,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139843549] [2024-10-24 15:22:04,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:22:04,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:22:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:22:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:22:04,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:22:04,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139843549] [2024-10-24 15:22:04,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139843549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:22:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:22:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:22:04,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370784331] [2024-10-24 15:22:04,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:22:04,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:22:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:22:04,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:22:04,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:22:04,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 111 [2024-10-24 15:22:04,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:04,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:22:04,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 111 [2024-10-24 15:22:04,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:22:04,908 INFO L124 PetriNetUnfolderBase]: 12/229 cut-off events. [2024-10-24 15:22:04,915 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 15:22:04,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 229 events. 12/229 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 770 event pairs, 11 based on Foata normal form. 18/205 useless extension candidates. Maximal degree in co-relation 209. Up to 31 conditions per place. [2024-10-24 15:22:04,918 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 9 selfloop transitions, 2 changer transitions 1/103 dead transitions. [2024-10-24 15:22:04,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 103 transitions, 235 flow [2024-10-24 15:22:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:22:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:22:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2024-10-24 15:22:04,945 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8948948948948949 [2024-10-24 15:22:04,947 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 227 flow. Second operand 3 states and 298 transitions. [2024-10-24 15:22:04,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 103 transitions, 235 flow [2024-10-24 15:22:04,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 103 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:22:04,960 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 214 flow [2024-10-24 15:22:04,965 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2024-10-24 15:22:04,972 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -2 predicate places. [2024-10-24 15:22:04,973 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 214 flow [2024-10-24 15:22:04,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:04,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:22:04,977 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] [2024-10-24 15:22:04,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:22:04,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:22:04,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:22:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash 850971737, now seen corresponding path program 1 times [2024-10-24 15:22:04,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:22:04,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335925366] [2024-10-24 15:22:04,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:22:04,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:22:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:22:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:22:05,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:22:05,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335925366] [2024-10-24 15:22:05,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335925366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:22:05,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:22:05,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:22:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694759529] [2024-10-24 15:22:05,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:22:05,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:22:05,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:22:05,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:22:05,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:22:05,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2024-10-24 15:22:05,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:05,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:22:05,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2024-10-24 15:22:05,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:22:05,221 INFO L124 PetriNetUnfolderBase]: 6/165 cut-off events. [2024-10-24 15:22:05,228 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 15:22:05,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 165 events. 6/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 433 event pairs, 5 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 174. Up to 23 conditions per place. [2024-10-24 15:22:05,229 INFO L140 encePairwiseOnDemand]: 108/111 looper letters, 10 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-10-24 15:22:05,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 101 transitions, 236 flow [2024-10-24 15:22:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:22:05,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:22:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-10-24 15:22:05,242 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8768768768768769 [2024-10-24 15:22:05,242 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 214 flow. Second operand 3 states and 292 transitions. [2024-10-24 15:22:05,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 101 transitions, 236 flow [2024-10-24 15:22:05,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:22:05,244 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 212 flow [2024-10-24 15:22:05,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2024-10-24 15:22:05,247 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2024-10-24 15:22:05,251 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 212 flow [2024-10-24 15:22:05,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:05,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:22:05,252 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:22:05,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:22:05,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:22:05,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:22:05,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1456105701, now seen corresponding path program 1 times [2024-10-24 15:22:05,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:22:05,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471945198] [2024-10-24 15:22:05,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:22:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:22:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:22:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:22:05,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:22:05,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471945198] [2024-10-24 15:22:05,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471945198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:22:05,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:22:05,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:22:05,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261815835] [2024-10-24 15:22:05,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:22:05,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:22:05,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:22:05,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:22:05,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:22:05,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2024-10-24 15:22:05,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:05,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:22:05,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2024-10-24 15:22:05,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:22:05,464 INFO L124 PetriNetUnfolderBase]: 11/217 cut-off events. [2024-10-24 15:22:05,466 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-24 15:22:05,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 217 events. 11/217 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 780 event pairs, 10 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 230. Up to 32 conditions per place. [2024-10-24 15:22:05,472 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 10 selfloop transitions, 1 changer transitions 0/97 dead transitions. [2024-10-24 15:22:05,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 97 transitions, 226 flow [2024-10-24 15:22:05,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:22:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:22:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2024-10-24 15:22:05,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8648648648648649 [2024-10-24 15:22:05,474 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 212 flow. Second operand 3 states and 288 transitions. [2024-10-24 15:22:05,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 97 transitions, 226 flow [2024-10-24 15:22:05,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 97 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:22:05,483 INFO L231 Difference]: Finished difference. Result has 103 places, 97 transitions, 202 flow [2024-10-24 15:22:05,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=103, PETRI_TRANSITIONS=97} [2024-10-24 15:22:05,483 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -8 predicate places. [2024-10-24 15:22:05,484 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 97 transitions, 202 flow [2024-10-24 15:22:05,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:05,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:22:05,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:22:05,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:22:05,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:22:05,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:22:05,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1667615661, now seen corresponding path program 1 times [2024-10-24 15:22:05,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:22:05,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999179515] [2024-10-24 15:22:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:22:05,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:22:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:22:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:22:05,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:22:05,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999179515] [2024-10-24 15:22:05,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999179515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:22:05,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:22:05,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:22:05,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074117736] [2024-10-24 15:22:05,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:22:05,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:22:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:22:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:22:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:22:05,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2024-10-24 15:22:05,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 97 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:05,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:22:05,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2024-10-24 15:22:05,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:22:05,692 INFO L124 PetriNetUnfolderBase]: 8/175 cut-off events. [2024-10-24 15:22:05,692 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 15:22:05,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 175 events. 8/175 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 487 event pairs, 2 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 180. Up to 19 conditions per place. [2024-10-24 15:22:05,694 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 9 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2024-10-24 15:22:05,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 100 transitions, 237 flow [2024-10-24 15:22:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:22:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:22:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2024-10-24 15:22:05,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-10-24 15:22:05,701 INFO L175 Difference]: Start difference. First operand has 103 places, 97 transitions, 202 flow. Second operand 3 states and 303 transitions. [2024-10-24 15:22:05,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 100 transitions, 237 flow [2024-10-24 15:22:05,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 100 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:22:05,705 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 229 flow [2024-10-24 15:22:05,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2024-10-24 15:22:05,710 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -6 predicate places. [2024-10-24 15:22:05,710 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 229 flow [2024-10-24 15:22:05,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:05,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:22:05,710 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:22:05,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:22:05,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:22:05,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:22:05,742 INFO L85 PathProgramCache]: Analyzing trace with hash -385399741, now seen corresponding path program 1 times [2024-10-24 15:22:05,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:22:05,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424545643] [2024-10-24 15:22:05,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:22:05,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:22:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:22:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:22:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:22:05,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424545643] [2024-10-24 15:22:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424545643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:22:05,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:22:05,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:22:05,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285442437] [2024-10-24 15:22:05,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:22:05,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:22:05,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:22:05,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:22:05,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:22:05,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2024-10-24 15:22:05,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:05,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:22:05,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2024-10-24 15:22:05,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:22:05,933 INFO L124 PetriNetUnfolderBase]: 7/210 cut-off events. [2024-10-24 15:22:05,938 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2024-10-24 15:22:05,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 210 events. 7/210 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 675 event pairs, 2 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 247. Up to 23 conditions per place. [2024-10-24 15:22:05,943 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 11 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2024-10-24 15:22:05,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 269 flow [2024-10-24 15:22:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:22:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:22:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2024-10-24 15:22:05,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2024-10-24 15:22:05,947 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 229 flow. Second operand 3 states and 302 transitions. [2024-10-24 15:22:05,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 269 flow [2024-10-24 15:22:05,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:22:05,949 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 253 flow [2024-10-24 15:22:05,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-10-24 15:22:05,955 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2024-10-24 15:22:05,955 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 253 flow [2024-10-24 15:22:05,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:05,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:22:05,955 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] [2024-10-24 15:22:05,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:22:05,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:22:05,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:22:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1187427640, now seen corresponding path program 1 times [2024-10-24 15:22:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:22:05,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136216464] [2024-10-24 15:22:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:22:05,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:22:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:22:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:22:06,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:22:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136216464] [2024-10-24 15:22:06,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136216464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:22:06,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:22:06,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:22:06,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825216660] [2024-10-24 15:22:06,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:22:06,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:22:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:22:06,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:22:06,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:22:06,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2024-10-24 15:22:06,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:06,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:22:06,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2024-10-24 15:22:06,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:22:06,201 INFO L124 PetriNetUnfolderBase]: 4/197 cut-off events. [2024-10-24 15:22:06,201 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-10-24 15:22:06,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 197 events. 4/197 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 577 event pairs, 1 based on Foata normal form. 1/186 useless extension candidates. Maximal degree in co-relation 236. Up to 16 conditions per place. [2024-10-24 15:22:06,203 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 14 selfloop transitions, 0 changer transitions 4/105 dead transitions. [2024-10-24 15:22:06,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 295 flow [2024-10-24 15:22:06,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:22:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 15:22:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2024-10-24 15:22:06,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8450450450450451 [2024-10-24 15:22:06,205 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 253 flow. Second operand 5 states and 469 transitions. [2024-10-24 15:22:06,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 295 flow [2024-10-24 15:22:06,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 105 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:22:06,208 INFO L231 Difference]: Finished difference. Result has 112 places, 101 transitions, 249 flow [2024-10-24 15:22:06,209 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=112, PETRI_TRANSITIONS=101} [2024-10-24 15:22:06,209 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2024-10-24 15:22:06,210 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 101 transitions, 249 flow [2024-10-24 15:22:06,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:22:06,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:22:06,210 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] [2024-10-24 15:22:06,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:22:06,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:22:06,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:22:06,211 INFO L85 PathProgramCache]: Analyzing trace with hash -103993823, now seen corresponding path program 1 times [2024-10-24 15:22:06,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:22:06,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106596031] [2024-10-24 15:22:06,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:22:06,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:22:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:22:06,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:22:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:22:06,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:22:06,268 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:22:06,269 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-10-24 15:22:06,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-10-24 15:22:06,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-10-24 15:22:06,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-10-24 15:22:06,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-10-24 15:22:06,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-10-24 15:22:06,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-10-24 15:22:06,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-10-24 15:22:06,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-10-24 15:22:06,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-10-24 15:22:06,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2024-10-24 15:22:06,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2024-10-24 15:22:06,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-10-24 15:22:06,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-10-24 15:22:06,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-10-24 15:22:06,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:22:06,275 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:22:06,333 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 15:22:06,333 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 15:22:06,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:22:06 BasicIcfg [2024-10-24 15:22:06,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 15:22:06,341 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 15:22:06,341 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 15:22:06,342 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 15:22:06,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:22:04" (3/4) ... [2024-10-24 15:22:06,343 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 15:22:06,344 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 15:22:06,345 INFO L158 Benchmark]: Toolchain (without parser) took 3675.26ms. Allocated memory is still 195.0MB. Free memory was 122.6MB in the beginning and 95.0MB in the end (delta: 27.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-10-24 15:22:06,345 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 195.0MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:22:06,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 725.18ms. Allocated memory is still 195.0MB. Free memory was 122.3MB in the beginning and 100.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 15:22:06,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.72ms. Allocated memory is still 195.0MB. Free memory was 100.8MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:22:06,346 INFO L158 Benchmark]: Boogie Preprocessor took 51.46ms. Allocated memory is still 195.0MB. Free memory was 98.6MB in the beginning and 97.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:22:06,346 INFO L158 Benchmark]: RCFGBuilder took 485.69ms. Allocated memory is still 195.0MB. Free memory was 97.4MB in the beginning and 154.5MB in the end (delta: -57.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 15:22:06,346 INFO L158 Benchmark]: TraceAbstraction took 2327.38ms. Allocated memory is still 195.0MB. Free memory was 153.3MB in the beginning and 95.0MB in the end (delta: 58.3MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-10-24 15:22:06,346 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 195.0MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:22:06,350 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 195.0MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 725.18ms. Allocated memory is still 195.0MB. Free memory was 122.3MB in the beginning and 100.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.72ms. Allocated memory is still 195.0MB. Free memory was 100.8MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.46ms. Allocated memory is still 195.0MB. Free memory was 98.6MB in the beginning and 97.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 485.69ms. Allocated memory is still 195.0MB. Free memory was 97.4MB in the beginning and 154.5MB in the end (delta: -57.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2327.38ms. Allocated memory is still 195.0MB. Free memory was 153.3MB in the beginning and 95.0MB in the end (delta: 58.3MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 195.0MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L701] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L702] 0 int i; VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L703] 0 x = 0 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L704] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] CALL 0 assume_abort_if_not(n >= 20 && n < 40) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, n=39, x=0] [L705] RET 0 assume_abort_if_not(n >= 20 && n < 40) [L706] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, t1=-1, x=0] [L707] 0 i = 0 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L707] 0 i < n VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L707] COND TRUE 0 i < n VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L708] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(arg)={0:0}, \old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, t2=0, x=0] [L696] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, n=39, x=0] [L693] 1 x <= n VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, n=39, x=0] [L697] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, n=39, t=0, x=0] [L698] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, n=39, t=0, x=1] [L693] 1 x <= n VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, n=39, t=0, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [698] and C: x <= n [693] - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 142 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 27 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 15:22:06,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE