./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.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-array-ptr.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 35a6f2b8aa1bde24253adbc16eaa9578928a8dcab5fd3b4f862fc1062ff15832 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:10:52,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:10:52,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:10:52,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:10:52,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:10:52,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:10:52,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:10:52,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:10:52,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:10:52,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:10:52,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:10:52,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:10:52,670 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:10:52,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:10:52,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:10:52,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:10:52,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:10:52,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:10:52,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:52,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:52,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:52,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:10:52,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:10:52,673 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 -> 35a6f2b8aa1bde24253adbc16eaa9578928a8dcab5fd3b4f862fc1062ff15832 [2025-04-29 11:10:52,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:10:52,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:10:52,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:10:52,920 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:10:52,921 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:10:52,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.c [2025-04-29 11:10:54,276 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52aef1894/e59b8cab82234de285db064e8ff3c854/FLAGa2acfbd78 [2025-04-29 11:10:54,452 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:10:54,453 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.c [2025-04-29 11:10:54,454 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:54,457 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:54,465 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52aef1894/e59b8cab82234de285db064e8ff3c854/FLAGa2acfbd78 [2025-04-29 11:10:55,278 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52aef1894/e59b8cab82234de285db064e8ff3c854 [2025-04-29 11:10:55,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:10:55,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:10:55,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:55,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:10:55,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:10:55,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8162cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55, skipping insertion in model container [2025-04-29 11:10:55,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:10:55,455 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:55,463 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:10:55,494 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:55,508 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:10:55,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55 WrapperNode [2025-04-29 11:10:55,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:55,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:55,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:10:55,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:10:55,515 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:10:55" (1/1) ... [2025-04-29 11:10:55,521 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:10:55" (1/1) ... [2025-04-29 11:10:55,535 INFO L138 Inliner]: procedures = 11, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-04-29 11:10:55,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:55,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:10:55,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:10:55,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:10:55,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:10:55,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:10:55,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:10:55,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:10:55,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:55,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:55,578 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:10:55,580 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:10:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:10:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:10:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:10:55,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:10:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:10:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:10:55,596 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:10:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:10:55,597 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:10:55,652 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:10:55,653 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:10:55,802 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:10:55,802 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:10:55,809 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:10:55,809 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:10:55,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:55 BoogieIcfgContainer [2025-04-29 11:10:55,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:10:55,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:10:55,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:10:55,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:10:55,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:10:55" (1/3) ... [2025-04-29 11:10:55,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4484aab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:55, skipping insertion in model container [2025-04-29 11:10:55,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55" (2/3) ... [2025-04-29 11:10:55,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4484aab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:55, skipping insertion in model container [2025-04-29 11:10:55,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:55" (3/3) ... [2025-04-29 11:10:55,816 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.c [2025-04-29 11:10:55,827 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:10:55,828 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-ptr.c that has 2 procedures, 80 locations, 81 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-29 11:10:55,829 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:10:55,878 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:10:55,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 171 flow [2025-04-29 11:10:55,954 INFO L116 PetriNetUnfolderBase]: 2/112 cut-off events. [2025-04-29 11:10:55,960 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:10:55,962 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 189 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:10:55,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 171 flow [2025-04-29 11:10:55,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 171 flow [2025-04-29 11:10:55,977 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:55,989 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;@2b5c3612, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:55,989 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-29 11:10:56,000 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:56,001 INFO L116 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-04-29 11:10:56,001 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:56,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:56,002 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:10:56,002 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:10:56,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:56,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1835999317, now seen corresponding path program 1 times [2025-04-29 11:10:56,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:56,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344957399] [2025-04-29 11:10:56,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:56,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:56,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:10:56,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:10:56,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:56,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:56,289 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:10:56,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:56,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344957399] [2025-04-29 11:10:56,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344957399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:56,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:56,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:56,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848478390] [2025-04-29 11:10:56,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:56,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:56,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:56,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:56,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:56,410 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 82 [2025-04-29 11:10:56,413 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:10:56,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:56,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 82 [2025-04-29 11:10:56,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:56,473 INFO L116 PetriNetUnfolderBase]: 1/118 cut-off events. [2025-04-29 11:10:56,474 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:10:56,474 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:10:56,475 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 11 selfloop transitions, 2 changer transitions 6/86 dead transitions. [2025-04-29 11:10:56,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 86 transitions, 215 flow [2025-04-29 11:10:56,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 428 transitions. [2025-04-29 11:10:56,489 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8699186991869918 [2025-04-29 11:10:56,490 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:10:56,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 86 transitions, 215 flow [2025-04-29 11:10:56,496 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:10:56,502 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 185 flow [2025-04-29 11:10:56,503 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:10:56,506 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2025-04-29 11:10:56,507 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 185 flow [2025-04-29 11:10:56,507 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:10:56,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:56,507 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:10:56,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:10:56,508 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:10:56,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:56,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1136377682, now seen corresponding path program 1 times [2025-04-29 11:10:56,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:56,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233280499] [2025-04-29 11:10:56,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:56,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:56,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:10:56,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:10:56,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:56,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:56,928 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:10:56,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:56,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233280499] [2025-04-29 11:10:56,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233280499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:56,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:56,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:56,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629082445] [2025-04-29 11:10:56,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:56,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:56,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:56,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:56,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:57,031 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 82 [2025-04-29 11:10:57,032 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:10:57,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:57,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 82 [2025-04-29 11:10:57,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:57,159 INFO L116 PetriNetUnfolderBase]: 70/349 cut-off events. [2025-04-29 11:10:57,160 INFO L117 PetriNetUnfolderBase]: For 22/25 co-relation queries the response was YES. [2025-04-29 11:10:57,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 349 events. 70/349 cut-off events. For 22/25 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1691 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:10:57,163 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 23 selfloop transitions, 22 changer transitions 0/101 dead transitions. [2025-04-29 11:10:57,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 101 transitions, 317 flow [2025-04-29 11:10:57,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 388 transitions. [2025-04-29 11:10:57,167 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7886178861788617 [2025-04-29 11:10:57,168 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:10:57,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 101 transitions, 317 flow [2025-04-29 11:10:57,169 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:10:57,172 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 321 flow [2025-04-29 11:10:57,173 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:10:57,173 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2025-04-29 11:10:57,173 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 321 flow [2025-04-29 11:10:57,174 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:10:57,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:57,174 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:10:57,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:10:57,174 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:10:57,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:57,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2139523619, now seen corresponding path program 1 times [2025-04-29 11:10:57,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:57,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835614806] [2025-04-29 11:10:57,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:57,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:57,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:10:57,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:10:57,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:57,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:57,469 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:10:57,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:57,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835614806] [2025-04-29 11:10:57,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835614806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:57,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:57,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:57,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851691315] [2025-04-29 11:10:57,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:57,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:57,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:57,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:57,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:57,524 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 82 [2025-04-29 11:10:57,525 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:10:57,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:57,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 82 [2025-04-29 11:10:57,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:57,652 INFO L116 PetriNetUnfolderBase]: 130/477 cut-off events. [2025-04-29 11:10:57,652 INFO L117 PetriNetUnfolderBase]: For 138/150 co-relation queries the response was YES. [2025-04-29 11:10:57,653 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 2451 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:10:57,655 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 33 selfloop transitions, 48 changer transitions 8/144 dead transitions. [2025-04-29 11:10:57,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 144 transitions, 639 flow [2025-04-29 11:10:57,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2025-04-29 11:10:57,658 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8719512195121951 [2025-04-29 11:10:57,658 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:10:57,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 144 transitions, 639 flow [2025-04-29 11:10:57,662 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:10:57,663 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 693 flow [2025-04-29 11:10:57,664 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:10:57,664 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2025-04-29 11:10:57,664 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 693 flow [2025-04-29 11:10:57,664 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:10:57,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:57,665 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:10:57,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:10:57,665 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:10:57,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash -750906392, now seen corresponding path program 1 times [2025-04-29 11:10:57,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:57,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318960743] [2025-04-29 11:10:57,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:57,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:57,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:10:57,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:10:57,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:57,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:57,894 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:10:57,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:57,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318960743] [2025-04-29 11:10:57,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318960743] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:57,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:57,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:57,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344239804] [2025-04-29 11:10:57,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:57,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:57,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:57,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:57,986 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 82 [2025-04-29 11:10:57,987 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:10:57,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:57,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 82 [2025-04-29 11:10:57,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:58,108 INFO L116 PetriNetUnfolderBase]: 142/505 cut-off events. [2025-04-29 11:10:58,109 INFO L117 PetriNetUnfolderBase]: For 464/492 co-relation queries the response was YES. [2025-04-29 11:10:58,113 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 2796 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:10:58,116 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 73 selfloop transitions, 25 changer transitions 13/164 dead transitions. [2025-04-29 11:10:58,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1076 flow [2025-04-29 11:10:58,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2025-04-29 11:10:58,118 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.806910569105691 [2025-04-29 11:10:58,118 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:10:58,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1076 flow [2025-04-29 11:10:58,127 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:10:58,130 INFO L231 Difference]: Finished difference. Result has 105 places, 151 transitions, 910 flow [2025-04-29 11:10:58,130 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:10:58,130 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2025-04-29 11:10:58,130 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 151 transitions, 910 flow [2025-04-29 11:10:58,131 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:10:58,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:58,131 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:10:58,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:10:58,131 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:10:58,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:58,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1589827244, now seen corresponding path program 1 times [2025-04-29 11:10:58,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:58,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783817996] [2025-04-29 11:10:58,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:58,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:58,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:10:58,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:10:58,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:58,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:10:58,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:10:58,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:10:58,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:58,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:10:58,177 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:10:58,177 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-29 11:10:58,178 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-29 11:10:58,179 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-29 11:10:58,179 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-29 11:10:58,179 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-29 11:10:58,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:10:58,179 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-29 11:10:58,181 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:10:58,181 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:10:58,199 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:10:58,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 100 transitions, 216 flow [2025-04-29 11:10:58,218 INFO L116 PetriNetUnfolderBase]: 4/192 cut-off events. [2025-04-29 11:10:58,218 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:10:58,219 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 7. Compared 413 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:10:58,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 100 transitions, 216 flow [2025-04-29 11:10:58,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 100 transitions, 216 flow [2025-04-29 11:10:58,221 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:58,222 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;@2b5c3612, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:58,222 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:10:58,224 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:58,226 INFO L116 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-04-29 11:10:58,227 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:58,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:58,227 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:10:58,228 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:10:58,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:58,228 INFO L85 PathProgramCache]: Analyzing trace with hash 53589135, now seen corresponding path program 1 times [2025-04-29 11:10:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:58,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531043953] [2025-04-29 11:10:58,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:58,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:58,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:10:58,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:10:58,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:58,291 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:10:58,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:58,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531043953] [2025-04-29 11:10:58,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531043953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:58,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:58,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:58,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704865656] [2025-04-29 11:10:58,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:58,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:58,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:58,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:58,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:58,354 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 100 [2025-04-29 11:10:58,355 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:10:58,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:58,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 100 [2025-04-29 11:10:58,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:58,385 INFO L116 PetriNetUnfolderBase]: 3/198 cut-off events. [2025-04-29 11:10:58,385 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-29 11:10:58,385 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:10:58,386 INFO L140 encePairwiseOnDemand]: 91/100 looper letters, 14 selfloop transitions, 2 changer transitions 6/105 dead transitions. [2025-04-29 11:10:58,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 268 flow [2025-04-29 11:10:58,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2025-04-29 11:10:58,387 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2025-04-29 11:10:58,387 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:10:58,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 268 flow [2025-04-29 11:10:58,388 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:10:58,389 INFO L231 Difference]: Finished difference. Result has 111 places, 99 transitions, 234 flow [2025-04-29 11:10:58,389 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:10:58,390 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 9 predicate places. [2025-04-29 11:10:58,390 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 99 transitions, 234 flow [2025-04-29 11:10:58,390 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:10:58,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:58,390 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:10:58,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:10:58,390 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:10:58,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash 753210770, now seen corresponding path program 1 times [2025-04-29 11:10:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:58,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016243931] [2025-04-29 11:10:58,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:58,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:58,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:10:58,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:10:58,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:58,581 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:10:58,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:58,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016243931] [2025-04-29 11:10:58,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016243931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:58,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:58,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:58,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863900469] [2025-04-29 11:10:58,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:58,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:58,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:58,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:58,719 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 100 [2025-04-29 11:10:58,720 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:10:58,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:58,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 100 [2025-04-29 11:10:58,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:59,079 INFO L116 PetriNetUnfolderBase]: 902/2602 cut-off events. [2025-04-29 11:10:59,079 INFO L117 PetriNetUnfolderBase]: For 186/192 co-relation queries the response was YES. [2025-04-29 11:10:59,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4377 conditions, 2602 events. 902/2602 cut-off events. For 186/192 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 19745 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:10:59,097 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 31 selfloop transitions, 38 changer transitions 0/137 dead transitions. [2025-04-29 11:10:59,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 453 flow [2025-04-29 11:10:59,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 483 transitions. [2025-04-29 11:10:59,100 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.805 [2025-04-29 11:10:59,100 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:10:59,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 453 flow [2025-04-29 11:10:59,103 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:10:59,104 INFO L231 Difference]: Finished difference. Result has 113 places, 136 transitions, 476 flow [2025-04-29 11:10:59,104 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:10:59,105 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 11 predicate places. [2025-04-29 11:10:59,105 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 136 transitions, 476 flow [2025-04-29 11:10:59,105 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:10:59,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:59,106 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:10:59,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:10:59,106 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:10:59,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:59,106 INFO L85 PathProgramCache]: Analyzing trace with hash -642455049, now seen corresponding path program 1 times [2025-04-29 11:10:59,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:59,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460676094] [2025-04-29 11:10:59,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:59,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:59,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:10:59,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:10:59,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:59,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:59,288 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:10:59,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:59,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460676094] [2025-04-29 11:10:59,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460676094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:59,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:59,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:59,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36035794] [2025-04-29 11:10:59,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:59,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:59,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:59,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:59,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:59,355 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 100 [2025-04-29 11:10:59,355 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:10:59,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:59,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 100 [2025-04-29 11:10:59,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:59,801 INFO L116 PetriNetUnfolderBase]: 1866/4575 cut-off events. [2025-04-29 11:10:59,802 INFO L117 PetriNetUnfolderBase]: For 1548/1645 co-relation queries the response was YES. [2025-04-29 11:10:59,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10731 conditions, 4575 events. 1866/4575 cut-off events. For 1548/1645 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 35865 event pairs, 435 based on Foata normal form. 0/4276 useless extension candidates. Maximal degree in co-relation 8527. Up to 2581 conditions per place. [2025-04-29 11:10:59,826 INFO L140 encePairwiseOnDemand]: 81/100 looper letters, 63 selfloop transitions, 92 changer transitions 0/231 dead transitions. [2025-04-29 11:10:59,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 231 transitions, 1222 flow [2025-04-29 11:10:59,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:59,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-04-29 11:10:59,828 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-04-29 11:10:59,828 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:10:59,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 231 transitions, 1222 flow [2025-04-29 11:10:59,833 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:10:59,836 INFO L231 Difference]: Finished difference. Result has 123 places, 223 transitions, 1312 flow [2025-04-29 11:10:59,836 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:10:59,837 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2025-04-29 11:10:59,837 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 223 transitions, 1312 flow [2025-04-29 11:10:59,837 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:10:59,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:59,837 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:10:59,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:10:59,838 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:10:59,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:59,838 INFO L85 PathProgramCache]: Analyzing trace with hash 833003512, now seen corresponding path program 1 times [2025-04-29 11:10:59,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:59,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710288145] [2025-04-29 11:10:59,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:59,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:10:59,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:10:59,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:59,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:59,998 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:10:59,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:59,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710288145] [2025-04-29 11:10:59,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710288145] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:59,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:59,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:59,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294131749] [2025-04-29 11:10:59,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:59,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:59,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:59,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:59,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:00,100 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 100 [2025-04-29 11:11:00,101 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:00,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:00,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 100 [2025-04-29 11:11:00,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:00,647 INFO L116 PetriNetUnfolderBase]: 2323/5522 cut-off events. [2025-04-29 11:11:00,648 INFO L117 PetriNetUnfolderBase]: For 5280/5440 co-relation queries the response was YES. [2025-04-29 11:11:00,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17444 conditions, 5522 events. 2323/5522 cut-off events. For 5280/5440 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 44293 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:00,687 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 145 selfloop transitions, 76 changer transitions 0/296 dead transitions. [2025-04-29 11:11:00,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 296 transitions, 2246 flow [2025-04-29 11:11:00,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-04-29 11:11:00,689 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8233333333333334 [2025-04-29 11:11:00,689 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:00,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 296 transitions, 2246 flow [2025-04-29 11:11:00,717 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:00,722 INFO L231 Difference]: Finished difference. Result has 133 places, 294 transitions, 2152 flow [2025-04-29 11:11:00,723 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:00,723 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2025-04-29 11:11:00,723 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2152 flow [2025-04-29 11:11:00,723 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:00,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:00,723 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:00,724 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:11:00,724 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:00,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1756921956, now seen corresponding path program 1 times [2025-04-29 11:11:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:00,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244959778] [2025-04-29 11:11:00,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:00,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:00,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:00,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:00,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:01,107 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:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:01,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244959778] [2025-04-29 11:11:01,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244959778] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:01,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:01,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886841099] [2025-04-29 11:11:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:01,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:01,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:01,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:01,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:01,565 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-04-29 11:11:01,567 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:01,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:01,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-04-29 11:11:01,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:02,827 INFO L116 PetriNetUnfolderBase]: 3600/8403 cut-off events. [2025-04-29 11:11:02,828 INFO L117 PetriNetUnfolderBase]: For 13758/13973 co-relation queries the response was YES. [2025-04-29 11:11:02,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29838 conditions, 8403 events. 3600/8403 cut-off events. For 13758/13973 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 70961 event pairs, 310 based on Foata normal form. 86/8202 useless extension candidates. Maximal degree in co-relation 25705. Up to 3368 conditions per place. [2025-04-29 11:11:02,884 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 397 selfloop transitions, 188 changer transitions 0/648 dead transitions. [2025-04-29 11:11:02,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 648 transitions, 6238 flow [2025-04-29 11:11:02,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:11:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:11:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1429 transitions. [2025-04-29 11:11:02,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6804761904761905 [2025-04-29 11:11:02,888 INFO L175 Difference]: Start difference. First operand has 133 places, 294 transitions, 2152 flow. Second operand 21 states and 1429 transitions. [2025-04-29 11:11:02,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 648 transitions, 6238 flow [2025-04-29 11:11:02,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 648 transitions, 6030 flow, removed 104 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:02,940 INFO L231 Difference]: Finished difference. Result has 160 places, 469 transitions, 4417 flow [2025-04-29 11:11:02,941 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=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4417, PETRI_PLACES=160, PETRI_TRANSITIONS=469} [2025-04-29 11:11:02,941 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 58 predicate places. [2025-04-29 11:11:02,942 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 469 transitions, 4417 flow [2025-04-29 11:11:02,942 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:02,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:02,943 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:02,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:11:02,943 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:02,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:02,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1670823212, now seen corresponding path program 1 times [2025-04-29 11:11:02,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:02,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965970342] [2025-04-29 11:11:02,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:02,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:02,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:02,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:02,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:02,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:03,234 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:03,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:03,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965970342] [2025-04-29 11:11:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965970342] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:03,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:03,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:03,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217821918] [2025-04-29 11:11:03,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:03,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:03,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:03,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:03,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:03,739 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 100 [2025-04-29 11:11:03,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 469 transitions, 4417 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:03,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:03,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 100 [2025-04-29 11:11:03,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:05,143 INFO L116 PetriNetUnfolderBase]: 4380/9567 cut-off events. [2025-04-29 11:11:05,143 INFO L117 PetriNetUnfolderBase]: For 32863/33496 co-relation queries the response was YES. [2025-04-29 11:11:05,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41888 conditions, 9567 events. 4380/9567 cut-off events. For 32863/33496 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 79864 event pairs, 214 based on Foata normal form. 279/9630 useless extension candidates. Maximal degree in co-relation 37194. Up to 3532 conditions per place. [2025-04-29 11:11:05,264 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 420 selfloop transitions, 454 changer transitions 1/952 dead transitions. [2025-04-29 11:11:05,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 952 transitions, 10899 flow [2025-04-29 11:11:05,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:11:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-29 11:11:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1662 transitions. [2025-04-29 11:11:05,268 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7226086956521739 [2025-04-29 11:11:05,268 INFO L175 Difference]: Start difference. First operand has 160 places, 469 transitions, 4417 flow. Second operand 23 states and 1662 transitions. [2025-04-29 11:11:05,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 952 transitions, 10899 flow [2025-04-29 11:11:05,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 952 transitions, 10871 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-04-29 11:11:05,352 INFO L231 Difference]: Finished difference. Result has 188 places, 775 transitions, 9573 flow [2025-04-29 11:11:05,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=4389, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=9573, PETRI_PLACES=188, PETRI_TRANSITIONS=775} [2025-04-29 11:11:05,354 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 86 predicate places. [2025-04-29 11:11:05,354 INFO L485 AbstractCegarLoop]: Abstraction has has 188 places, 775 transitions, 9573 flow [2025-04-29 11:11:05,355 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:05,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:05,355 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:05,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:11:05,355 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:05,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:05,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1488314370, now seen corresponding path program 2 times [2025-04-29 11:11:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:05,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400922586] [2025-04-29 11:11:05,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:11:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:05,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:05,372 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:05,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:11:05,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:05,687 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,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:05,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400922586] [2025-04-29 11:11:05,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400922586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:05,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:05,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71187872] [2025-04-29 11:11:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:05,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:05,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:05,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:06,082 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-04-29 11:11:06,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 775 transitions, 9573 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:06,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:06,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-04-29 11:11:06,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:08,100 INFO L116 PetriNetUnfolderBase]: 4593/10416 cut-off events. [2025-04-29 11:11:08,101 INFO L117 PetriNetUnfolderBase]: For 74655/75455 co-relation queries the response was YES. [2025-04-29 11:11:08,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55801 conditions, 10416 events. 4593/10416 cut-off events. For 74655/75455 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 89064 event pairs, 320 based on Foata normal form. 253/10339 useless extension candidates. Maximal degree in co-relation 54667. Up to 5269 conditions per place. [2025-04-29 11:11:08,176 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 590 selfloop transitions, 281 changer transitions 0/943 dead transitions. [2025-04-29 11:11:08,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 943 transitions, 13592 flow [2025-04-29 11:11:08,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:11:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-29 11:11:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1292 transitions. [2025-04-29 11:11:08,179 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-04-29 11:11:08,179 INFO L175 Difference]: Start difference. First operand has 188 places, 775 transitions, 9573 flow. Second operand 19 states and 1292 transitions. [2025-04-29 11:11:08,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 943 transitions, 13592 flow [2025-04-29 11:11:08,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 943 transitions, 13358 flow, removed 102 selfloop flow, removed 9 redundant places. [2025-04-29 11:11:08,407 INFO L231 Difference]: Finished difference. Result has 203 places, 872 transitions, 12016 flow [2025-04-29 11:11:08,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=9339, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=12016, PETRI_PLACES=203, PETRI_TRANSITIONS=872} [2025-04-29 11:11:08,408 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 101 predicate places. [2025-04-29 11:11:08,408 INFO L485 AbstractCegarLoop]: Abstraction has has 203 places, 872 transitions, 12016 flow [2025-04-29 11:11:08,408 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:08,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:08,408 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:08,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:11:08,408 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:08,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:08,409 INFO L85 PathProgramCache]: Analyzing trace with hash -337565192, now seen corresponding path program 3 times [2025-04-29 11:11:08,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:08,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843721439] [2025-04-29 11:11:08,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:11:08,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:08,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:11:08,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:08,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:11:08,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:08,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:08,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843721439] [2025-04-29 11:11:08,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843721439] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:08,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56955236] [2025-04-29 11:11:08,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:11:08,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:08,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:08,913 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:08,981 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:09,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:11:09,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:09,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:11:09,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:09,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-29 11:11:09,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:09,119 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:09,176 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:11:09,177 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:09,431 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:09,500 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:09,544 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:09,589 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:09,701 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:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:09,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:11,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56955236] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:11:11,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:11:11,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 47 [2025-04-29 11:11:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58527019] [2025-04-29 11:11:11,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:11:11,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-29 11:11:11,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:11,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-29 11:11:11,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2036, Unknown=0, NotChecked=0, Total=2256 [2025-04-29 11:11:17,164 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:21,387 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:28,525 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:28,887 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 100 [2025-04-29 11:11:28,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 872 transitions, 12016 flow. Second operand has 48 states, 48 states have (on average 48.083333333333336) internal successors, (2308), 48 states have internal predecessors, (2308), 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,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:28,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 100 [2025-04-29 11:11:28,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:36,324 INFO L116 PetriNetUnfolderBase]: 13083/28152 cut-off events. [2025-04-29 11:11:36,325 INFO L117 PetriNetUnfolderBase]: For 227348/230330 co-relation queries the response was YES. [2025-04-29 11:11:36,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153378 conditions, 28152 events. 13083/28152 cut-off events. For 227348/230330 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 279287 event pairs, 1603 based on Foata normal form. 1275/27937 useless extension candidates. Maximal degree in co-relation 151142. Up to 8950 conditions per place. [2025-04-29 11:11:36,594 INFO L140 encePairwiseOnDemand]: 65/100 looper letters, 1035 selfloop transitions, 1123 changer transitions 0/2217 dead transitions. [2025-04-29 11:11:36,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 2217 transitions, 38616 flow [2025-04-29 11:11:36,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-29 11:11:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-29 11:11:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2140 transitions. [2025-04-29 11:11:36,597 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5487179487179488 [2025-04-29 11:11:36,597 INFO L175 Difference]: Start difference. First operand has 203 places, 872 transitions, 12016 flow. Second operand 39 states and 2140 transitions. [2025-04-29 11:11:36,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 2217 transitions, 38616 flow [2025-04-29 11:11:37,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 2217 transitions, 38364 flow, removed 96 selfloop flow, removed 12 redundant places. [2025-04-29 11:11:37,371 INFO L231 Difference]: Finished difference. Result has 244 places, 1801 transitions, 33259 flow [2025-04-29 11:11:37,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=11880, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=33259, PETRI_PLACES=244, PETRI_TRANSITIONS=1801} [2025-04-29 11:11:37,373 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 142 predicate places. [2025-04-29 11:11:37,373 INFO L485 AbstractCegarLoop]: Abstraction has has 244 places, 1801 transitions, 33259 flow [2025-04-29 11:11:37,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 48.083333333333336) internal successors, (2308), 48 states have internal predecessors, (2308), 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:37,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:37,374 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:37,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:11:37,574 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:37,574 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:37,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:37,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1620681380, now seen corresponding path program 4 times [2025-04-29 11:11:37,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:37,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726335795] [2025-04-29 11:11:37,575 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:11:37,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:37,582 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:11:37,590 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:37,591 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:11:37,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:37,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:37,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726335795] [2025-04-29 11:11:37,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726335795] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:37,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483397087] [2025-04-29 11:11:37,853 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:11:37,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:37,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:37,855 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:37,857 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:37,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:11:37,928 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:37,929 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:11:37,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:37,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:11:37,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:38,070 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:11:38,100 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:38,132 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:38,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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:38,307 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:38,307 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 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:38,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:38,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:38,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:38,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:38,386 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:38,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 60 [2025-04-29 11:11:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:38,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:48,816 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:12:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:12:01,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483397087] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:12:01,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:12:01,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2025-04-29 11:12:01,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73674463] [2025-04-29 11:12:01,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:12:01,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 11:12:01,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:01,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 11:12:01,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1477, Unknown=4, NotChecked=0, Total=1640 Killed by 15