./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-race.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-race.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e5599c2f74a5224fe20cd574644f2354125876bce5c79d3d91d322c2439aa86 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:11:01,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:11:01,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:11:01,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:11:01,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:11:01,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:11:01,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:11:01,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:11:01,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:11:01,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:11:01,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:11:01,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:11:01,630 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:11:01,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:11:01,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:11:01,630 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:11:01,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:11:01,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:11:01,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:11:01,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:11:01,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:11:01,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:11:01,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:01,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:01,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:11:01,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:11:01,633 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:11:01,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:11:01,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:11:01,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:11:01,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:11:01,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:11:01,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:11:01,633 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 1e5599c2f74a5224fe20cd574644f2354125876bce5c79d3d91d322c2439aa86 [2025-04-29 11:11:01,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:11:01,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:11:01,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:11:01,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:11:01,868 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:11:01,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-race.c [2025-04-29 11:11:03,165 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e327bf43/868b41604abe4f88b8c37bd4fa4a40f8/FLAG482392377 [2025-04-29 11:11:03,350 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:11:03,350 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-race.c [2025-04-29 11:11:03,351 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:11:03,352 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:11:03,357 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e327bf43/868b41604abe4f88b8c37bd4fa4a40f8/FLAG482392377 [2025-04-29 11:11:04,216 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e327bf43/868b41604abe4f88b8c37bd4fa4a40f8 [2025-04-29 11:11:04,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:11:04,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:11:04,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:04,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:11:04,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:11:04,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c6d1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04, skipping insertion in model container [2025-04-29 11:11:04,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:11:04,403 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:04,412 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:11:04,437 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:04,445 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:11:04,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04 WrapperNode [2025-04-29 11:11:04,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:04,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:04,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:11:04,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:11:04,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,470 INFO L138 Inliner]: procedures = 11, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-04-29 11:11:04,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:04,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:11:04,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:11:04,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:11:04,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,486 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:11:04,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:11:04,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:11:04,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:11:04,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (1/1) ... [2025-04-29 11:11:04,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:04,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:04,528 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) [2025-04-29 11:11:04,530 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 [2025-04-29 11:11:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:11:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:11:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:11:04,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:11:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:11:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:11:04,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:11:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:11:04,547 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:11:04,601 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:11:04,602 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:11:04,741 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:11:04,741 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:11:04,749 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:11:04,750 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:11:04,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:04 BoogieIcfgContainer [2025-04-29 11:11:04,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:11:04,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:11:04,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:11:04,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:11:04,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:11:04" (1/3) ... [2025-04-29 11:11:04,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f38df6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:04, skipping insertion in model container [2025-04-29 11:11:04,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:04" (2/3) ... [2025-04-29 11:11:04,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f38df6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:04, skipping insertion in model container [2025-04-29 11:11:04,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:04" (3/3) ... [2025-04-29 11:11:04,760 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.c [2025-04-29 11:11:04,771 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:11:04,774 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-race.c that has 2 procedures, 80 locations, 81 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-29 11:11:04,775 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:11:04,825 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:11:04,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 171 flow [2025-04-29 11:11:04,900 INFO L116 PetriNetUnfolderBase]: 2/112 cut-off events. [2025-04-29 11:11:04,903 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:11:04,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 112 events. 2/112 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 193 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-04-29 11:11:04,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 171 flow [2025-04-29 11:11:04,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 171 flow [2025-04-29 11:11:04,914 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:04,923 INFO L340 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;@13bc2b7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:04,924 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-29 11:11:04,937 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:04,937 INFO L116 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-04-29 11:11:04,937 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:04,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:04,939 INFO L206 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] [2025-04-29 11:11:04,939 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:11:04,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash 281933423, now seen corresponding path program 1 times [2025-04-29 11:11:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:04,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587656744] [2025-04-29 11:11:04,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:05,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:05,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:05,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:05,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:05,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:05,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587656744] [2025-04-29 11:11:05,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587656744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:05,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:05,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:05,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821889328] [2025-04-29 11:11:05,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:05,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:05,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:05,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:05,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:05,383 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 82 [2025-04-29 11:11:05,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 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) [2025-04-29 11:11:05,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:05,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 82 [2025-04-29 11:11:05,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:05,442 INFO L116 PetriNetUnfolderBase]: 1/118 cut-off events. [2025-04-29 11:11:05,442 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:11:05,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 118 events. 1/118 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 167 event pairs, 0 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 23. Up to 16 conditions per place. [2025-04-29 11:11:05,444 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 11 selfloop transitions, 2 changer transitions 6/86 dead transitions. [2025-04-29 11:11:05,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 86 transitions, 215 flow [2025-04-29 11:11:05,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 428 transitions. [2025-04-29 11:11:05,454 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8699186991869918 [2025-04-29 11:11:05,454 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 171 flow. Second operand 6 states and 428 transitions. [2025-04-29 11:11:05,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 86 transitions, 215 flow [2025-04-29 11:11:05,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:05,464 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 185 flow [2025-04-29 11:11:05,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2025-04-29 11:11:05,468 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2025-04-29 11:11:05,468 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 185 flow [2025-04-29 11:11:05,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 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) [2025-04-29 11:11:05,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:05,469 INFO L206 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] [2025-04-29 11:11:05,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:11:05,469 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:11:05,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:05,469 INFO L85 PathProgramCache]: Analyzing trace with hash 217789210, now seen corresponding path program 1 times [2025-04-29 11:11:05,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:05,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496580064] [2025-04-29 11:11:05,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:05,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:05,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:05,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:05,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:05,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:05,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:05,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496580064] [2025-04-29 11:11:05,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496580064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:05,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:05,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:05,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128152419] [2025-04-29 11:11:05,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:05,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:05,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:05,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:05,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:05,898 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 82 [2025-04-29 11:11:05,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 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) [2025-04-29 11:11:05,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:05,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 82 [2025-04-29 11:11:05,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:06,036 INFO L116 PetriNetUnfolderBase]: 70/349 cut-off events. [2025-04-29 11:11:06,036 INFO L117 PetriNetUnfolderBase]: For 25/28 co-relation queries the response was YES. [2025-04-29 11:11:06,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 349 events. 70/349 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1681 event pairs, 35 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 487. Up to 150 conditions per place. [2025-04-29 11:11:06,039 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 23 selfloop transitions, 22 changer transitions 0/101 dead transitions. [2025-04-29 11:11:06,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 101 transitions, 317 flow [2025-04-29 11:11:06,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 388 transitions. [2025-04-29 11:11:06,045 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7886178861788617 [2025-04-29 11:11:06,045 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 185 flow. Second operand 6 states and 388 transitions. [2025-04-29 11:11:06,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 101 transitions, 317 flow [2025-04-29 11:11:06,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 101 transitions, 303 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:06,048 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 321 flow [2025-04-29 11:11:06,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2025-04-29 11:11:06,050 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2025-04-29 11:11:06,050 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 321 flow [2025-04-29 11:11:06,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 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) [2025-04-29 11:11:06,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:06,050 INFO L206 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] [2025-04-29 11:11:06,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:11:06,050 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:11:06,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:06,051 INFO L85 PathProgramCache]: Analyzing trace with hash -358008177, now seen corresponding path program 1 times [2025-04-29 11:11:06,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:06,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535715580] [2025-04-29 11:11:06,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:06,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:06,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:11:06,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:11:06,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:06,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:06,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:06,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535715580] [2025-04-29 11:11:06,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535715580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:06,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:06,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:06,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076298728] [2025-04-29 11:11:06,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:06,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:06,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:06,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:06,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:06,360 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 82 [2025-04-29 11:11:06,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 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) [2025-04-29 11:11:06,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:06,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 82 [2025-04-29 11:11:06,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:06,487 INFO L116 PetriNetUnfolderBase]: 130/477 cut-off events. [2025-04-29 11:11:06,487 INFO L117 PetriNetUnfolderBase]: For 138/150 co-relation queries the response was YES. [2025-04-29 11:11:06,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 477 events. 130/477 cut-off events. For 138/150 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2465 event pairs, 23 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 976. Up to 238 conditions per place. [2025-04-29 11:11:06,490 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 33 selfloop transitions, 48 changer transitions 8/144 dead transitions. [2025-04-29 11:11:06,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 144 transitions, 639 flow [2025-04-29 11:11:06,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2025-04-29 11:11:06,492 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8719512195121951 [2025-04-29 11:11:06,492 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 321 flow. Second operand 6 states and 429 transitions. [2025-04-29 11:11:06,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 144 transitions, 639 flow [2025-04-29 11:11:06,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 639 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:06,498 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 693 flow [2025-04-29 11:11:06,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=103, PETRI_TRANSITIONS=136} [2025-04-29 11:11:06,499 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2025-04-29 11:11:06,499 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 693 flow [2025-04-29 11:11:06,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 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) [2025-04-29 11:11:06,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:06,500 INFO L206 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] [2025-04-29 11:11:06,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:11:06,500 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:11:06,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 313813177, now seen corresponding path program 1 times [2025-04-29 11:11:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:06,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892633928] [2025-04-29 11:11:06,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:06,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:06,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:06,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:06,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:06,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:06,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892633928] [2025-04-29 11:11:06,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892633928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:06,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:06,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:06,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707980901] [2025-04-29 11:11:06,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:06,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:06,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:06,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:06,840 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 82 [2025-04-29 11:11:06,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 136 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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) [2025-04-29 11:11:06,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:06,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 82 [2025-04-29 11:11:06,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:06,951 INFO L116 PetriNetUnfolderBase]: 142/505 cut-off events. [2025-04-29 11:11:06,952 INFO L117 PetriNetUnfolderBase]: For 464/492 co-relation queries the response was YES. [2025-04-29 11:11:06,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 505 events. 142/505 cut-off events. For 464/492 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2810 event pairs, 10 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 1464. Up to 241 conditions per place. [2025-04-29 11:11:06,955 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 73 selfloop transitions, 25 changer transitions 13/164 dead transitions. [2025-04-29 11:11:06,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1076 flow [2025-04-29 11:11:06,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2025-04-29 11:11:06,957 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.806910569105691 [2025-04-29 11:11:06,957 INFO L175 Difference]: Start difference. First operand has 103 places, 136 transitions, 693 flow. Second operand 6 states and 397 transitions. [2025-04-29 11:11:06,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1076 flow [2025-04-29 11:11:06,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 164 transitions, 1058 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:06,965 INFO L231 Difference]: Finished difference. Result has 105 places, 151 transitions, 910 flow [2025-04-29 11:11:06,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=105, PETRI_TRANSITIONS=151} [2025-04-29 11:11:06,965 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2025-04-29 11:11:06,966 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 151 transitions, 910 flow [2025-04-29 11:11:06,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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) [2025-04-29 11:11:06,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:06,966 INFO L206 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] [2025-04-29 11:11:06,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:11:06,966 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:11:06,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:06,967 INFO L85 PathProgramCache]: Analyzing trace with hash -850196485, now seen corresponding path program 1 times [2025-04-29 11:11:06,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:06,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662875216] [2025-04-29 11:11:06,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:06,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:06,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:11:06,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:11:06,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:06,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:06,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:06,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:11:06,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:11:06,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:06,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:07,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:07,008 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:07,008 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-29 11:11:07,009 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-29 11:11:07,010 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-29 11:11:07,010 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-29 11:11:07,010 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-29 11:11:07,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:11:07,010 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-29 11:11:07,012 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:07,012 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:11:07,027 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:11:07,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 100 transitions, 216 flow [2025-04-29 11:11:07,041 INFO L116 PetriNetUnfolderBase]: 4/192 cut-off events. [2025-04-29 11:11:07,042 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:11:07,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 192 events. 4/192 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 410 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 114. Up to 6 conditions per place. [2025-04-29 11:11:07,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 100 transitions, 216 flow [2025-04-29 11:11:07,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 100 transitions, 216 flow [2025-04-29 11:11:07,044 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:07,044 INFO L340 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;@13bc2b7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:07,044 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:11:07,047 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:07,047 INFO L116 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-04-29 11:11:07,047 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:07,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:07,047 INFO L206 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] [2025-04-29 11:11:07,047 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:07,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:07,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2123445421, now seen corresponding path program 1 times [2025-04-29 11:11:07,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:07,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339108384] [2025-04-29 11:11:07,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:07,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:07,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:07,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:07,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:07,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:07,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:07,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339108384] [2025-04-29 11:11:07,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339108384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:07,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:07,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:07,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209387719] [2025-04-29 11:11:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:07,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:07,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:07,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:07,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:07,167 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 100 [2025-04-29 11:11:07,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 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) [2025-04-29 11:11:07,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:07,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 100 [2025-04-29 11:11:07,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:07,205 INFO L116 PetriNetUnfolderBase]: 3/198 cut-off events. [2025-04-29 11:11:07,206 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-29 11:11:07,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 198 events. 3/198 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs, 0 based on Foata normal form. 2/190 useless extension candidates. Maximal degree in co-relation 141. Up to 32 conditions per place. [2025-04-29 11:11:07,207 INFO L140 encePairwiseOnDemand]: 91/100 looper letters, 14 selfloop transitions, 2 changer transitions 6/105 dead transitions. [2025-04-29 11:11:07,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 268 flow [2025-04-29 11:11:07,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2025-04-29 11:11:07,209 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2025-04-29 11:11:07,209 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 216 flow. Second operand 6 states and 527 transitions. [2025-04-29 11:11:07,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 268 flow [2025-04-29 11:11:07,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:07,212 INFO L231 Difference]: Finished difference. Result has 111 places, 99 transitions, 234 flow [2025-04-29 11:11:07,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=111, PETRI_TRANSITIONS=99} [2025-04-29 11:11:07,214 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 9 predicate places. [2025-04-29 11:11:07,214 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 99 transitions, 234 flow [2025-04-29 11:11:07,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 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) [2025-04-29 11:11:07,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:07,215 INFO L206 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] [2025-04-29 11:11:07,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:11:07,215 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:07,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:07,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2107377662, now seen corresponding path program 1 times [2025-04-29 11:11:07,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:07,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416340815] [2025-04-29 11:11:07,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:07,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:07,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:07,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:07,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:07,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:07,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:07,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416340815] [2025-04-29 11:11:07,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416340815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:07,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:07,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588159851] [2025-04-29 11:11:07,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:07,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:07,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:07,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:07,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:07,513 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 100 [2025-04-29 11:11:07,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 99 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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) [2025-04-29 11:11:07,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:07,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 100 [2025-04-29 11:11:07,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:07,835 INFO L116 PetriNetUnfolderBase]: 902/2602 cut-off events. [2025-04-29 11:11:07,835 INFO L117 PetriNetUnfolderBase]: For 180/186 co-relation queries the response was YES. [2025-04-29 11:11:07,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4377 conditions, 2602 events. 902/2602 cut-off events. For 180/186 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 19763 event pairs, 512 based on Foata normal form. 0/2364 useless extension candidates. Maximal degree in co-relation 3404. Up to 1384 conditions per place. [2025-04-29 11:11:07,846 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 31 selfloop transitions, 38 changer transitions 0/137 dead transitions. [2025-04-29 11:11:07,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 453 flow [2025-04-29 11:11:07,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 483 transitions. [2025-04-29 11:11:07,848 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.805 [2025-04-29 11:11:07,848 INFO L175 Difference]: Start difference. First operand has 111 places, 99 transitions, 234 flow. Second operand 6 states and 483 transitions. [2025-04-29 11:11:07,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 453 flow [2025-04-29 11:11:07,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 137 transitions, 441 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:07,851 INFO L231 Difference]: Finished difference. Result has 113 places, 136 transitions, 476 flow [2025-04-29 11:11:07,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=113, PETRI_TRANSITIONS=136} [2025-04-29 11:11:07,852 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 11 predicate places. [2025-04-29 11:11:07,852 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 136 transitions, 476 flow [2025-04-29 11:11:07,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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) [2025-04-29 11:11:07,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:07,853 INFO L206 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] [2025-04-29 11:11:07,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:11:07,853 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:07,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:07,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1154980451, now seen corresponding path program 1 times [2025-04-29 11:11:07,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:07,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63596396] [2025-04-29 11:11:07,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:07,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:07,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:11:07,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:11:07,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:07,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:08,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:08,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63596396] [2025-04-29 11:11:08,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63596396] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:08,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:08,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895536305] [2025-04-29 11:11:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:08,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:08,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:08,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:08,090 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 100 [2025-04-29 11:11:08,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 136 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 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) [2025-04-29 11:11:08,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:08,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 100 [2025-04-29 11:11:08,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:08,622 INFO L116 PetriNetUnfolderBase]: 1866/4588 cut-off events. [2025-04-29 11:11:08,623 INFO L117 PetriNetUnfolderBase]: For 1539/1624 co-relation queries the response was YES. [2025-04-29 11:11:08,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10753 conditions, 4588 events. 1866/4588 cut-off events. For 1539/1624 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 36024 event pairs, 434 based on Foata normal form. 0/4289 useless extension candidates. Maximal degree in co-relation 8549. Up to 2580 conditions per place. [2025-04-29 11:11:08,654 INFO L140 encePairwiseOnDemand]: 81/100 looper letters, 63 selfloop transitions, 92 changer transitions 0/231 dead transitions. [2025-04-29 11:11:08,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 231 transitions, 1222 flow [2025-04-29 11:11:08,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-04-29 11:11:08,656 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-04-29 11:11:08,656 INFO L175 Difference]: Start difference. First operand has 113 places, 136 transitions, 476 flow. Second operand 6 states and 531 transitions. [2025-04-29 11:11:08,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 231 transitions, 1222 flow [2025-04-29 11:11:08,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 1222 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:08,666 INFO L231 Difference]: Finished difference. Result has 123 places, 223 transitions, 1312 flow [2025-04-29 11:11:08,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=123, PETRI_TRANSITIONS=223} [2025-04-29 11:11:08,668 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2025-04-29 11:11:08,668 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 223 transitions, 1312 flow [2025-04-29 11:11:08,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 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) [2025-04-29 11:11:08,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:08,669 INFO L206 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] [2025-04-29 11:11:08,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:11:08,669 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:08,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1897723081, now seen corresponding path program 1 times [2025-04-29 11:11:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:08,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414324698] [2025-04-29 11:11:08,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:08,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:08,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:08,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:08,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:08,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:08,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:08,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414324698] [2025-04-29 11:11:08,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414324698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:08,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:08,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688154559] [2025-04-29 11:11:08,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:08,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:08,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:08,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:08,952 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 100 [2025-04-29 11:11:08,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 223 transitions, 1312 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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) [2025-04-29 11:11:08,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:08,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 100 [2025-04-29 11:11:08,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:09,485 INFO L116 PetriNetUnfolderBase]: 2323/5522 cut-off events. [2025-04-29 11:11:09,486 INFO L117 PetriNetUnfolderBase]: For 5284/5444 co-relation queries the response was YES. [2025-04-29 11:11:09,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17444 conditions, 5522 events. 2323/5522 cut-off events. For 5284/5444 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 44218 event pairs, 290 based on Foata normal form. 2/5293 useless extension candidates. Maximal degree in co-relation 13989. Up to 3131 conditions per place. [2025-04-29 11:11:09,521 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 145 selfloop transitions, 76 changer transitions 0/296 dead transitions. [2025-04-29 11:11:09,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 296 transitions, 2246 flow [2025-04-29 11:11:09,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-04-29 11:11:09,525 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8233333333333334 [2025-04-29 11:11:09,525 INFO L175 Difference]: Start difference. First operand has 123 places, 223 transitions, 1312 flow. Second operand 6 states and 494 transitions. [2025-04-29 11:11:09,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 296 transitions, 2246 flow [2025-04-29 11:11:09,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 296 transitions, 2228 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:09,559 INFO L231 Difference]: Finished difference. Result has 133 places, 294 transitions, 2152 flow [2025-04-29 11:11:09,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2152, PETRI_PLACES=133, PETRI_TRANSITIONS=294} [2025-04-29 11:11:09,560 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2025-04-29 11:11:09,561 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2152 flow [2025-04-29 11:11:09,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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) [2025-04-29 11:11:09,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:09,562 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:11:09,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:11:09,562 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:09,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:09,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1727947617, now seen corresponding path program 1 times [2025-04-29 11:11:09,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:09,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168044722] [2025-04-29 11:11:09,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:09,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:09,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:09,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:09,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:09,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:09,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:09,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168044722] [2025-04-29 11:11:09,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168044722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:09,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:09,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:09,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124057313] [2025-04-29 11:11:09,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:09,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:09,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:09,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:09,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:10,498 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-04-29 11:11:10,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 294 transitions, 2152 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 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) [2025-04-29 11:11:10,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:10,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-04-29 11:11:10,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:11,678 INFO L116 PetriNetUnfolderBase]: 3298/7928 cut-off events. [2025-04-29 11:11:11,678 INFO L117 PetriNetUnfolderBase]: For 12552/12787 co-relation queries the response was YES. [2025-04-29 11:11:11,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27646 conditions, 7928 events. 3298/7928 cut-off events. For 12552/12787 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 67486 event pairs, 353 based on Foata normal form. 65/7687 useless extension candidates. Maximal degree in co-relation 23504. Up to 3811 conditions per place. [2025-04-29 11:11:11,728 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 229 selfloop transitions, 135 changer transitions 0/427 dead transitions. [2025-04-29 11:11:11,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 427 transitions, 3993 flow [2025-04-29 11:11:11,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:11:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 11:11:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1151 transitions. [2025-04-29 11:11:11,731 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6770588235294117 [2025-04-29 11:11:11,731 INFO L175 Difference]: Start difference. First operand has 133 places, 294 transitions, 2152 flow. Second operand 17 states and 1151 transitions. [2025-04-29 11:11:11,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 427 transitions, 3993 flow [2025-04-29 11:11:11,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 427 transitions, 3849 flow, removed 72 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:11,772 INFO L231 Difference]: Finished difference. Result has 157 places, 353 transitions, 3118 flow [2025-04-29 11:11:11,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3118, PETRI_PLACES=157, PETRI_TRANSITIONS=353} [2025-04-29 11:11:11,773 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 55 predicate places. [2025-04-29 11:11:11,773 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 353 transitions, 3118 flow [2025-04-29 11:11:11,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 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) [2025-04-29 11:11:11,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:11,774 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:11:11,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:11:11,774 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:11,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash -597792845, now seen corresponding path program 1 times [2025-04-29 11:11:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:11,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945706657] [2025-04-29 11:11:11,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:11,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:11,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:11,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:11,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:12,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:12,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945706657] [2025-04-29 11:11:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945706657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:12,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:12,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:12,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110174690] [2025-04-29 11:11:12,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:12,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:12,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:12,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:12,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:12,450 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 100 [2025-04-29 11:11:12,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 353 transitions, 3118 flow. Second operand has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 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) [2025-04-29 11:11:12,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:12,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 100 [2025-04-29 11:11:12,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:13,736 INFO L116 PetriNetUnfolderBase]: 3977/8910 cut-off events. [2025-04-29 11:11:13,737 INFO L117 PetriNetUnfolderBase]: For 20521/21071 co-relation queries the response was YES. [2025-04-29 11:11:13,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36130 conditions, 8910 events. 3977/8910 cut-off events. For 20521/21071 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 74886 event pairs, 246 based on Foata normal form. 270/8945 useless extension candidates. Maximal degree in co-relation 31556. Up to 3183 conditions per place. [2025-04-29 11:11:13,799 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 366 selfloop transitions, 366 changer transitions 1/805 dead transitions. [2025-04-29 11:11:13,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 805 transitions, 8690 flow [2025-04-29 11:11:13,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:11:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-29 11:11:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1662 transitions. [2025-04-29 11:11:13,803 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7226086956521739 [2025-04-29 11:11:13,803 INFO L175 Difference]: Start difference. First operand has 157 places, 353 transitions, 3118 flow. Second operand 23 states and 1662 transitions. [2025-04-29 11:11:13,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 805 transitions, 8690 flow [2025-04-29 11:11:13,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 805 transitions, 8632 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-04-29 11:11:13,878 INFO L231 Difference]: Finished difference. Result has 183 places, 671 transitions, 7920 flow [2025-04-29 11:11:13,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=3078, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7920, PETRI_PLACES=183, PETRI_TRANSITIONS=671} [2025-04-29 11:11:13,879 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 81 predicate places. [2025-04-29 11:11:13,880 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 671 transitions, 7920 flow [2025-04-29 11:11:13,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 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) [2025-04-29 11:11:13,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:13,880 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:11:13,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:11:13,881 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:13,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1470577801, now seen corresponding path program 2 times [2025-04-29 11:11:13,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:13,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787090067] [2025-04-29 11:11:13,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:11:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:13,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:13,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:13,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:11:13,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:14,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:14,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787090067] [2025-04-29 11:11:14,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787090067] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:14,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:14,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:14,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792526752] [2025-04-29 11:11:14,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:14,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:14,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:14,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:14,675 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-04-29 11:11:14,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 671 transitions, 7920 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 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) [2025-04-29 11:11:14,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:14,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-04-29 11:11:14,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:16,279 INFO L116 PetriNetUnfolderBase]: 4544/10348 cut-off events. [2025-04-29 11:11:16,279 INFO L117 PetriNetUnfolderBase]: For 56563/57121 co-relation queries the response was YES. [2025-04-29 11:11:16,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52457 conditions, 10348 events. 4544/10348 cut-off events. For 56563/57121 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 88687 event pairs, 327 based on Foata normal form. 179/10197 useless extension candidates. Maximal degree in co-relation 51344. Up to 4300 conditions per place. [2025-04-29 11:11:16,437 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 557 selfloop transitions, 371 changer transitions 0/1000 dead transitions. [2025-04-29 11:11:16,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1000 transitions, 14068 flow [2025-04-29 11:11:16,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:11:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:11:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1429 transitions. [2025-04-29 11:11:16,439 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6804761904761905 [2025-04-29 11:11:16,439 INFO L175 Difference]: Start difference. First operand has 183 places, 671 transitions, 7920 flow. Second operand 21 states and 1429 transitions. [2025-04-29 11:11:16,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1000 transitions, 14068 flow [2025-04-29 11:11:16,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1000 transitions, 13844 flow, removed 106 selfloop flow, removed 6 redundant places. [2025-04-29 11:11:16,640 INFO L231 Difference]: Finished difference. Result has 204 places, 894 transitions, 12467 flow [2025-04-29 11:11:16,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=7696, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12467, PETRI_PLACES=204, PETRI_TRANSITIONS=894} [2025-04-29 11:11:16,642 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 102 predicate places. [2025-04-29 11:11:16,642 INFO L485 AbstractCegarLoop]: Abstraction has has 204 places, 894 transitions, 12467 flow [2025-04-29 11:11:16,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 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) [2025-04-29 11:11:16,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:16,642 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:11:16,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:11:16,643 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:16,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash -933869799, now seen corresponding path program 3 times [2025-04-29 11:11:16,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:16,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109985665] [2025-04-29 11:11:16,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:11:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:16,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 3 equivalence classes. [2025-04-29 11:11:16,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:16,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:11:16,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:17,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:17,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109985665] [2025-04-29 11:11:17,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109985665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:17,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143803803] [2025-04-29 11:11:17,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:11:17,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:17,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:17,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:11:17,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:11:17,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 3 equivalence classes. [2025-04-29 11:11:17,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:17,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:11:17,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:17,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-29 11:11:17,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:17,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:11:17,386 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:11:17,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:11:17,713 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:11:17,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:11:17,815 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-04-29 11:11:17,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-04-29 11:11:18,071 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2025-04-29 11:11:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:18,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:24,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143803803] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:11:24,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:11:24,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 49 [2025-04-29 11:11:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061386032] [2025-04-29 11:11:24,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:11:24,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-29 11:11:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:24,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-29 11:11:24,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2161, Unknown=0, NotChecked=0, Total=2450 [2025-04-29 11:11:28,350 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 100 [2025-04-29 11:11:28,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 894 transitions, 12467 flow. Second operand has 50 states, 50 states have (on average 51.0) internal successors, (2550), 50 states have internal predecessors, (2550), 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) [2025-04-29 11:11:28,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:28,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 100 [2025-04-29 11:11:28,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:34,273 INFO L116 PetriNetUnfolderBase]: 7983/17864 cut-off events. [2025-04-29 11:11:34,273 INFO L117 PetriNetUnfolderBase]: For 156723/158429 co-relation queries the response was YES. [2025-04-29 11:11:34,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105044 conditions, 17864 events. 7983/17864 cut-off events. For 156723/158429 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 167732 event pairs, 633 based on Foata normal form. 663/17936 useless extension candidates. Maximal degree in co-relation 103516. Up to 6361 conditions per place. [2025-04-29 11:11:34,617 INFO L140 encePairwiseOnDemand]: 64/100 looper letters, 957 selfloop transitions, 639 changer transitions 0/1658 dead transitions. [2025-04-29 11:11:34,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 1658 transitions, 28560 flow [2025-04-29 11:11:34,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-29 11:11:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-29 11:11:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2139 transitions. [2025-04-29 11:11:34,620 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5628947368421052 [2025-04-29 11:11:34,620 INFO L175 Difference]: Start difference. First operand has 204 places, 894 transitions, 12467 flow. Second operand 38 states and 2139 transitions. [2025-04-29 11:11:34,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 1658 transitions, 28560 flow [2025-04-29 11:11:35,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 1658 transitions, 28032 flow, removed 243 selfloop flow, removed 12 redundant places. [2025-04-29 11:11:35,051 INFO L231 Difference]: Finished difference. Result has 243 places, 1310 transitions, 22393 flow [2025-04-29 11:11:35,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=12177, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=22393, PETRI_PLACES=243, PETRI_TRANSITIONS=1310} [2025-04-29 11:11:35,052 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 141 predicate places. [2025-04-29 11:11:35,052 INFO L485 AbstractCegarLoop]: Abstraction has has 243 places, 1310 transitions, 22393 flow [2025-04-29 11:11:35,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 51.0) internal successors, (2550), 50 states have internal predecessors, (2550), 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) [2025-04-29 11:11:35,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:35,053 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:11:35,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:11:35,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 11:11:35,253 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:35,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1090258435, now seen corresponding path program 4 times [2025-04-29 11:11:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:35,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050541553] [2025-04-29 11:11:35,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:11:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:35,263 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:11:35,272 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:35,272 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:11:35,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:35,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:35,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050541553] [2025-04-29 11:11:35,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050541553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:35,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535552428] [2025-04-29 11:11:35,538 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:11:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:35,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:35,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:11:35,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:11:35,585 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:11:35,630 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:35,630 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:11:35,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:35,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-29 11:11:35,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:35,640 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:11:35,678 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:11:35,678 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:11:35,930 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:11:35,993 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:11:36,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-04-29 11:11:36,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-04-29 11:11:36,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2025-04-29 11:11:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:36,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535552428] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:11:37,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:11:37,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 42 [2025-04-29 11:11:37,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298326312] [2025-04-29 11:11:37,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:11:37,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-29 11:11:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:37,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-29 11:11:37,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1604, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:11:45,426 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:11:49,605 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:11:49,626 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 100 [2025-04-29 11:11:49,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 1310 transitions, 22393 flow. Second operand has 43 states, 43 states have (on average 58.02325581395349) internal successors, (2495), 43 states have internal predecessors, (2495), 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) [2025-04-29 11:11:49,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:49,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 100 [2025-04-29 11:11:49,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:56,982 INFO L116 PetriNetUnfolderBase]: 9722/21484 cut-off events. [2025-04-29 11:11:56,982 INFO L117 PetriNetUnfolderBase]: For 266411/269027 co-relation queries the response was YES. [2025-04-29 11:11:57,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141061 conditions, 21484 events. 9722/21484 cut-off events. For 266411/269027 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 205953 event pairs, 754 based on Foata normal form. 1081/21952 useless extension candidates. Maximal degree in co-relation 139456. Up to 8042 conditions per place. [2025-04-29 11:11:57,196 INFO L140 encePairwiseOnDemand]: 69/100 looper letters, 1060 selfloop transitions, 1178 changer transitions 0/2306 dead transitions. [2025-04-29 11:11:57,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 2306 transitions, 45181 flow [2025-04-29 11:11:57,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-29 11:11:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-29 11:11:57,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2259 transitions. [2025-04-29 11:11:57,199 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6454285714285715 [2025-04-29 11:11:57,199 INFO L175 Difference]: Start difference. First operand has 243 places, 1310 transitions, 22393 flow. Second operand 35 states and 2259 transitions. [2025-04-29 11:11:57,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 2306 transitions, 45181 flow [2025-04-29 11:11:58,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 2306 transitions, 44914 flow, removed 95 selfloop flow, removed 19 redundant places. [2025-04-29 11:11:58,041 INFO L231 Difference]: Finished difference. Result has 270 places, 1963 transitions, 39555 flow [2025-04-29 11:11:58,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=22126, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=641, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=39555, PETRI_PLACES=270, PETRI_TRANSITIONS=1963} [2025-04-29 11:11:58,042 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 168 predicate places. [2025-04-29 11:11:58,042 INFO L485 AbstractCegarLoop]: Abstraction has has 270 places, 1963 transitions, 39555 flow [2025-04-29 11:11:58,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 58.02325581395349) internal successors, (2495), 43 states have internal predecessors, (2495), 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) [2025-04-29 11:11:58,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:58,043 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:11:58,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:11:58,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:11:58,244 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:58,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1173512137, now seen corresponding path program 5 times [2025-04-29 11:11:58,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:58,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898436167] [2025-04-29 11:11:58,244 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:11:58,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:58,250 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 3 equivalence classes. [2025-04-29 11:11:58,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:58,257 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-29 11:11:58,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:58,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:58,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898436167] [2025-04-29 11:11:58,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898436167] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:58,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870479109] [2025-04-29 11:11:58,688 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:11:58,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:58,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:58,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:11:58,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:11:58,731 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 3 equivalence classes. [2025-04-29 11:11:58,746 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:58,746 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-29 11:11:58,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:58,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:11:58,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:58,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:11:58,783 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:11:58,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:11:58,814 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:11:58,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:11:58,830 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:58,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-04-29 11:11:58,850 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:58,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-04-29 11:11:58,899 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2025-04-29 11:11:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:58,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:58,924 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))))) is different from false [2025-04-29 11:11:58,968 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))))))) is different from false [2025-04-29 11:12:02,917 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 1)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4)))))))) is different from false [2025-04-29 11:12:02,928 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:12:02,928 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2025-04-29 11:12:02,935 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:12:02,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 31 [2025-04-29 11:12:02,943 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:12:02,944 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-04-29 11:12:02,948 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:12:02,948 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-04-29 11:12:02,954 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:12:02,954 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2025-04-29 11:12:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:12:02,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870479109] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:12:02,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:12:02,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-04-29 11:12:02,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699304508] [2025-04-29 11:12:02,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:12:02,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:12:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:02,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:12:02,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=238, Unknown=28, NotChecked=102, Total=420 [2025-04-29 11:12:03,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-04-29 11:12:03,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 1963 transitions, 39555 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 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) [2025-04-29 11:12:03,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:03,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-04-29 11:12:03,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15