./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.i --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/goblint-regression/06-symbeq_08-tricky_address3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:39,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:39,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:26:39,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:39,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:39,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:39,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:39,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:39,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:39,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:39,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:39,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:39,930 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:39,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:39,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:39,931 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:39,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:39,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:39,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:39,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:39,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:39,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:39,931 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:39,931 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:39,932 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:39,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:39,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:39,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:39,932 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:39,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:39,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:39,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:39,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:39,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:39,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:39,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:39,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:39,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:39,933 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:39,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:39,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:39,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:39,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:39,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:39,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:39,934 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 -> a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb [2025-04-30 10:26:40,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:40,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:40,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:40,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:40,167 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:40,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.i [2025-04-30 10:26:41,447 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07110f5a/6c7d04efd6e7443ab6cd4bd0803d7299/FLAG916bc644d [2025-04-30 10:26:41,701 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:41,701 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.i [2025-04-30 10:26:41,713 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07110f5a/6c7d04efd6e7443ab6cd4bd0803d7299/FLAG916bc644d [2025-04-30 10:26:42,499 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07110f5a/6c7d04efd6e7443ab6cd4bd0803d7299 [2025-04-30 10:26:42,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:42,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:42,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:42,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:42,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:42,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:42" (1/1) ... [2025-04-30 10:26:42,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76601024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:42, skipping insertion in model container [2025-04-30 10:26:42,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:42" (1/1) ... [2025-04-30 10:26:42,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:42,974 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:43,014 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:43,095 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:43,152 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:43,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43 WrapperNode [2025-04-30 10:26:43,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:43,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:43,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:43,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:43,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,211 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2025-04-30 10:26:43,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:43,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:43,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:43,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:43,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:43,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:43,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:43,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:43,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:43,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:43,292 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-30 10:26:43,295 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-30 10:26:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:26:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:43,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:43,317 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:26:43,425 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:43,426 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:43,664 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:43,664 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:43,688 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:43,689 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:43,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:43 BoogieIcfgContainer [2025-04-30 10:26:43,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:43,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:43,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:43,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:43,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:42" (1/3) ... [2025-04-30 10:26:43,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fc8e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:43, skipping insertion in model container [2025-04-30 10:26:43,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43" (2/3) ... [2025-04-30 10:26:43,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fc8e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:43, skipping insertion in model container [2025-04-30 10:26:43,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:43" (3/3) ... [2025-04-30 10:26:43,699 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_08-tricky_address3.i [2025-04-30 10:26:43,710 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:43,712 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_08-tricky_address3.i that has 2 procedures, 161 locations, 162 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-30 10:26:43,712 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:43,781 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:43,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 163 transitions, 330 flow [2025-04-30 10:26:43,855 INFO L116 PetriNetUnfolderBase]: 3/162 cut-off events. [2025-04-30 10:26:43,857 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:43,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 162 events. 3/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-04-30 10:26:43,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 163 transitions, 330 flow [2025-04-30 10:26:43,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 162 transitions, 327 flow [2025-04-30 10:26:43,869 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:43,880 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;@414102be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:43,881 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:26:43,908 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:43,908 INFO L116 PetriNetUnfolderBase]: 3/112 cut-off events. [2025-04-30 10:26:43,908 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:43,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:43,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:26:43,909 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:43,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:43,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1944549468, now seen corresponding path program 1 times [2025-04-30 10:26:43,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:43,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178629673] [2025-04-30 10:26:43,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:43,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:44,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-30 10:26:44,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-30 10:26:44,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:44,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:44,294 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-30 10:26:44,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:44,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178629673] [2025-04-30 10:26:44,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178629673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:44,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:44,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:26:44,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333254158] [2025-04-30 10:26:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:44,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:44,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:44,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:44,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:44,341 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 163 [2025-04-30 10:26:44,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 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-30 10:26:44,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:44,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 163 [2025-04-30 10:26:44,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:44,401 INFO L116 PetriNetUnfolderBase]: 7/224 cut-off events. [2025-04-30 10:26:44,402 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:44,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 224 events. 7/224 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 329 event pairs, 6 based on Foata normal form. 5/217 useless extension candidates. Maximal degree in co-relation 147. Up to 24 conditions per place. [2025-04-30 10:26:44,404 INFO L140 encePairwiseOnDemand]: 158/163 looper letters, 10 selfloop transitions, 2 changer transitions 1/161 dead transitions. [2025-04-30 10:26:44,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 349 flow [2025-04-30 10:26:44,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-04-30 10:26:44,417 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.950920245398773 [2025-04-30 10:26:44,419 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 327 flow. Second operand 3 states and 465 transitions. [2025-04-30 10:26:44,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 349 flow [2025-04-30 10:26:44,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:44,427 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 332 flow [2025-04-30 10:26:44,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2025-04-30 10:26:44,432 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 2 predicate places. [2025-04-30 10:26:44,432 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 332 flow [2025-04-30 10:26:44,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 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-30 10:26:44,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:44,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:26:44,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:44,433 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:44,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:44,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1977463037, now seen corresponding path program 1 times [2025-04-30 10:26:44,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:44,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182551222] [2025-04-30 10:26:44,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:44,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-30 10:26:44,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-30 10:26:44,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:44,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:44,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:44,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182551222] [2025-04-30 10:26:44,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182551222] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:44,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520285198] [2025-04-30 10:26:44,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:44,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:44,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:44,644 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-30 10:26:44,662 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-30 10:26:44,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-30 10:26:44,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-30 10:26:44,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:44,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:44,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:26:44,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:44,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:44,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520285198] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:44,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:44,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:26:44,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44786581] [2025-04-30 10:26:44,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:44,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:44,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:44,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:26:44,896 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-04-30 10:26:44,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 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-30 10:26:44,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:44,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-04-30 10:26:44,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:45,002 INFO L116 PetriNetUnfolderBase]: 7/230 cut-off events. [2025-04-30 10:26:45,002 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:45,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 230 events. 7/230 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 322 event pairs, 6 based on Foata normal form. 2/221 useless extension candidates. Maximal degree in co-relation 194. Up to 24 conditions per place. [2025-04-30 10:26:45,004 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 14 selfloop transitions, 9 changer transitions 0/168 dead transitions. [2025-04-30 10:26:45,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 396 flow [2025-04-30 10:26:45,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1348 transitions. [2025-04-30 10:26:45,010 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9188820722563054 [2025-04-30 10:26:45,010 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 332 flow. Second operand 9 states and 1348 transitions. [2025-04-30 10:26:45,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 396 flow [2025-04-30 10:26:45,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:45,015 INFO L231 Difference]: Finished difference. Result has 174 places, 166 transitions, 380 flow [2025-04-30 10:26:45,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=174, PETRI_TRANSITIONS=166} [2025-04-30 10:26:45,017 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 11 predicate places. [2025-04-30 10:26:45,017 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 166 transitions, 380 flow [2025-04-30 10:26:45,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 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-30 10:26:45,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:45,019 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:26:45,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:26:45,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:45,224 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:45,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:45,225 INFO L85 PathProgramCache]: Analyzing trace with hash 288053341, now seen corresponding path program 2 times [2025-04-30 10:26:45,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:45,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606758959] [2025-04-30 10:26:45,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:45,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-04-30 10:26:45,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 109 statements. [2025-04-30 10:26:45,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:45,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:26:45,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:45,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606758959] [2025-04-30 10:26:45,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606758959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:45,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:45,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:45,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439772295] [2025-04-30 10:26:45,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:45,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:45,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:45,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:45,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:46,250 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 163 [2025-04-30 10:26:46,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 166 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 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-30 10:26:46,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:46,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 163 [2025-04-30 10:26:46,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:46,411 INFO L116 PetriNetUnfolderBase]: 103/535 cut-off events. [2025-04-30 10:26:46,411 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:26:46,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 535 events. 103/535 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2282 event pairs, 40 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 688. Up to 184 conditions per place. [2025-04-30 10:26:46,414 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 31 selfloop transitions, 22 changer transitions 0/195 dead transitions. [2025-04-30 10:26:46,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 195 transitions, 544 flow [2025-04-30 10:26:46,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 876 transitions. [2025-04-30 10:26:46,417 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8957055214723927 [2025-04-30 10:26:46,417 INFO L175 Difference]: Start difference. First operand has 174 places, 166 transitions, 380 flow. Second operand 6 states and 876 transitions. [2025-04-30 10:26:46,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 195 transitions, 544 flow [2025-04-30 10:26:46,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 195 transitions, 538 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:46,422 INFO L231 Difference]: Finished difference. Result has 183 places, 187 transitions, 524 flow [2025-04-30 10:26:46,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=524, PETRI_PLACES=183, PETRI_TRANSITIONS=187} [2025-04-30 10:26:46,423 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 20 predicate places. [2025-04-30 10:26:46,423 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 187 transitions, 524 flow [2025-04-30 10:26:46,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 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-30 10:26:46,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:46,424 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:26:46,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:26:46,424 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:46,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash 614372559, now seen corresponding path program 1 times [2025-04-30 10:26:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:46,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138667129] [2025-04-30 10:26:46,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:46,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:46,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-30 10:26:46,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-30 10:26:46,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:46,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:46,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:46,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138667129] [2025-04-30 10:26:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138667129] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:46,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208115202] [2025-04-30 10:26:46,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:46,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:46,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:46,600 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-30 10:26:46,602 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-30 10:26:46,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-30 10:26:46,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-30 10:26:46,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:46,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:46,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:26:46,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:46,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:46,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208115202] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:46,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:46,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-30 10:26:46,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618980095] [2025-04-30 10:26:46,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:46,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:26:46,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:46,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:26:46,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:26:46,847 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-04-30 10:26:46,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 187 transitions, 524 flow. Second operand has 18 states, 18 states have (on average 149.0) internal successors, (2682), 18 states have internal predecessors, (2682), 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-30 10:26:46,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:46,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-04-30 10:26:46,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:47,036 INFO L116 PetriNetUnfolderBase]: 35/396 cut-off events. [2025-04-30 10:26:47,036 INFO L117 PetriNetUnfolderBase]: For 57/62 co-relation queries the response was YES. [2025-04-30 10:26:47,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 396 events. 35/396 cut-off events. For 57/62 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1162 event pairs, 11 based on Foata normal form. 4/384 useless extension candidates. Maximal degree in co-relation 479. Up to 51 conditions per place. [2025-04-30 10:26:47,039 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 18 selfloop transitions, 21 changer transitions 0/205 dead transitions. [2025-04-30 10:26:47,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 205 transitions, 690 flow [2025-04-30 10:26:47,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:26:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:26:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3130 transitions. [2025-04-30 10:26:47,044 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9144025708442887 [2025-04-30 10:26:47,044 INFO L175 Difference]: Start difference. First operand has 183 places, 187 transitions, 524 flow. Second operand 21 states and 3130 transitions. [2025-04-30 10:26:47,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 205 transitions, 690 flow [2025-04-30 10:26:47,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 205 transitions, 690 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:47,049 INFO L231 Difference]: Finished difference. Result has 208 places, 200 transitions, 654 flow [2025-04-30 10:26:47,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=654, PETRI_PLACES=208, PETRI_TRANSITIONS=200} [2025-04-30 10:26:47,050 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 45 predicate places. [2025-04-30 10:26:47,050 INFO L485 AbstractCegarLoop]: Abstraction has has 208 places, 200 transitions, 654 flow [2025-04-30 10:26:47,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 149.0) internal successors, (2682), 18 states have internal predecessors, (2682), 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-30 10:26:47,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:47,051 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:26:47,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:26:47,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-30 10:26:47,257 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:47,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash 505936783, now seen corresponding path program 2 times [2025-04-30 10:26:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:47,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114780786] [2025-04-30 10:26:47,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:47,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:47,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-04-30 10:26:47,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 137 statements. [2025-04-30 10:26:47,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:47,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-04-30 10:26:47,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:47,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114780786] [2025-04-30 10:26:47,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114780786] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:47,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:47,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975865757] [2025-04-30 10:26:47,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:47,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:47,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:47,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:47,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:48,056 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 163 [2025-04-30 10:26:48,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 200 transitions, 654 flow. Second operand has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 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-30 10:26:48,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:48,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 163 [2025-04-30 10:26:48,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:48,223 INFO L116 PetriNetUnfolderBase]: 223/897 cut-off events. [2025-04-30 10:26:48,223 INFO L117 PetriNetUnfolderBase]: For 187/193 co-relation queries the response was YES. [2025-04-30 10:26:48,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 897 events. 223/897 cut-off events. For 187/193 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4710 event pairs, 82 based on Foata normal form. 5/843 useless extension candidates. Maximal degree in co-relation 1571. Up to 407 conditions per place. [2025-04-30 10:26:48,230 INFO L140 encePairwiseOnDemand]: 148/163 looper letters, 53 selfloop transitions, 39 changer transitions 5/245 dead transitions. [2025-04-30 10:26:48,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 245 transitions, 968 flow [2025-04-30 10:26:48,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 862 transitions. [2025-04-30 10:26:48,234 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8813905930470347 [2025-04-30 10:26:48,234 INFO L175 Difference]: Start difference. First operand has 208 places, 200 transitions, 654 flow. Second operand 6 states and 862 transitions. [2025-04-30 10:26:48,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 245 transitions, 968 flow [2025-04-30 10:26:48,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 245 transitions, 944 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:26:48,242 INFO L231 Difference]: Finished difference. Result has 212 places, 236 transitions, 918 flow [2025-04-30 10:26:48,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=918, PETRI_PLACES=212, PETRI_TRANSITIONS=236} [2025-04-30 10:26:48,242 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 49 predicate places. [2025-04-30 10:26:48,243 INFO L485 AbstractCegarLoop]: Abstraction has has 212 places, 236 transitions, 918 flow [2025-04-30 10:26:48,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 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-30 10:26:48,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:48,244 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:26:48,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:26:48,245 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:48,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:48,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1719928748, now seen corresponding path program 1 times [2025-04-30 10:26:48,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:48,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092042560] [2025-04-30 10:26:48,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:48,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-30 10:26:48,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-30 10:26:48,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:48,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:48,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:48,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092042560] [2025-04-30 10:26:48,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092042560] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:48,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113758316] [2025-04-30 10:26:48,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:48,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:48,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:48,540 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:48,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:26:48,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-30 10:26:48,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-30 10:26:48,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:48,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:48,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:26:48,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:48,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113758316] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:48,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:48,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:26:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418008083] [2025-04-30 10:26:48,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:48,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:26:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:48,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:26:48,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:26:48,940 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-04-30 10:26:48,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 236 transitions, 918 flow. Second operand has 23 states, 23 states have (on average 149.08695652173913) internal successors, (3429), 23 states have internal predecessors, (3429), 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-30 10:26:48,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:48,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-04-30 10:26:48,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:49,289 INFO L116 PetriNetUnfolderBase]: 120/667 cut-off events. [2025-04-30 10:26:49,289 INFO L117 PetriNetUnfolderBase]: For 316/321 co-relation queries the response was YES. [2025-04-30 10:26:49,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 667 events. 120/667 cut-off events. For 316/321 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2923 event pairs, 15 based on Foata normal form. 3/642 useless extension candidates. Maximal degree in co-relation 1132. Up to 118 conditions per place. [2025-04-30 10:26:49,293 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 21 selfloop transitions, 30 changer transitions 0/253 dead transitions. [2025-04-30 10:26:49,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 253 transitions, 1142 flow [2025-04-30 10:26:49,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:26:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-30 10:26:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4464 transitions. [2025-04-30 10:26:49,301 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.912883435582822 [2025-04-30 10:26:49,301 INFO L175 Difference]: Start difference. First operand has 212 places, 236 transitions, 918 flow. Second operand 30 states and 4464 transitions. [2025-04-30 10:26:49,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 253 transitions, 1142 flow [2025-04-30 10:26:49,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 253 transitions, 1110 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:49,309 INFO L231 Difference]: Finished difference. Result has 244 places, 246 transitions, 1038 flow [2025-04-30 10:26:49,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1038, PETRI_PLACES=244, PETRI_TRANSITIONS=246} [2025-04-30 10:26:49,310 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 81 predicate places. [2025-04-30 10:26:49,310 INFO L485 AbstractCegarLoop]: Abstraction has has 244 places, 246 transitions, 1038 flow [2025-04-30 10:26:49,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.08695652173913) internal successors, (3429), 23 states have internal predecessors, (3429), 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-30 10:26:49,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:49,312 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:26:49,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:26:49,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:49,513 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:49,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:49,514 INFO L85 PathProgramCache]: Analyzing trace with hash -351702443, now seen corresponding path program 2 times [2025-04-30 10:26:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:49,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64524763] [2025-04-30 10:26:49,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:49,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:49,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-04-30 10:26:49,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 107 of 157 statements. [2025-04-30 10:26:49,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:49,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:49,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64524763] [2025-04-30 10:26:49,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64524763] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:49,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:49,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:49,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889777260] [2025-04-30 10:26:49,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:49,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:49,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:49,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:49,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:49,897 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 163 [2025-04-30 10:26:49,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 246 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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-30 10:26:49,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:49,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 163 [2025-04-30 10:26:49,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:50,110 INFO L116 PetriNetUnfolderBase]: 212/934 cut-off events. [2025-04-30 10:26:50,110 INFO L117 PetriNetUnfolderBase]: For 586/646 co-relation queries the response was YES. [2025-04-30 10:26:50,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 934 events. 212/934 cut-off events. For 586/646 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4921 event pairs, 40 based on Foata normal form. 3/919 useless extension candidates. Maximal degree in co-relation 1917. Up to 338 conditions per place. [2025-04-30 10:26:50,121 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 72 selfloop transitions, 40 changer transitions 0/285 dead transitions. [2025-04-30 10:26:50,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 285 transitions, 1446 flow [2025-04-30 10:26:50,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 891 transitions. [2025-04-30 10:26:50,124 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.911042944785276 [2025-04-30 10:26:50,124 INFO L175 Difference]: Start difference. First operand has 244 places, 246 transitions, 1038 flow. Second operand 6 states and 891 transitions. [2025-04-30 10:26:50,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 285 transitions, 1446 flow [2025-04-30 10:26:50,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 285 transitions, 1400 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-30 10:26:50,138 INFO L231 Difference]: Finished difference. Result has 236 places, 277 transitions, 1360 flow [2025-04-30 10:26:50,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1360, PETRI_PLACES=236, PETRI_TRANSITIONS=277} [2025-04-30 10:26:50,139 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 73 predicate places. [2025-04-30 10:26:50,140 INFO L485 AbstractCegarLoop]: Abstraction has has 236 places, 277 transitions, 1360 flow [2025-04-30 10:26:50,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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-30 10:26:50,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:50,140 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:26:50,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:26:50,140 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:50,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:50,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1459727782, now seen corresponding path program 1 times [2025-04-30 10:26:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:50,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701984232] [2025-04-30 10:26:50,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:50,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:26:50,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:26:50,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:50,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:50,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:50,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701984232] [2025-04-30 10:26:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701984232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:50,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:50,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225562785] [2025-04-30 10:26:50,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:50,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:50,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:50,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:50,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:50,651 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 163 [2025-04-30 10:26:50,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 277 transitions, 1360 flow. Second operand has 6 states, 6 states have (on average 136.33333333333334) internal successors, (818), 6 states have internal predecessors, (818), 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-30 10:26:50,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:50,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 163 [2025-04-30 10:26:50,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:50,956 INFO L116 PetriNetUnfolderBase]: 361/1334 cut-off events. [2025-04-30 10:26:50,956 INFO L117 PetriNetUnfolderBase]: For 1462/1515 co-relation queries the response was YES. [2025-04-30 10:26:50,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3673 conditions, 1334 events. 361/1334 cut-off events. For 1462/1515 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7923 event pairs, 87 based on Foata normal form. 2/1300 useless extension candidates. Maximal degree in co-relation 3413. Up to 610 conditions per place. [2025-04-30 10:26:50,964 INFO L140 encePairwiseOnDemand]: 148/163 looper letters, 100 selfloop transitions, 64 changer transitions 10/338 dead transitions. [2025-04-30 10:26:50,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 338 transitions, 2048 flow [2025-04-30 10:26:50,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 877 transitions. [2025-04-30 10:26:50,967 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8967280163599182 [2025-04-30 10:26:50,967 INFO L175 Difference]: Start difference. First operand has 236 places, 277 transitions, 1360 flow. Second operand 6 states and 877 transitions. [2025-04-30 10:26:50,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 338 transitions, 2048 flow [2025-04-30 10:26:50,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 338 transitions, 2030 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:50,983 INFO L231 Difference]: Finished difference. Result has 246 places, 324 transitions, 1928 flow [2025-04-30 10:26:50,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1928, PETRI_PLACES=246, PETRI_TRANSITIONS=324} [2025-04-30 10:26:50,984 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 83 predicate places. [2025-04-30 10:26:50,985 INFO L485 AbstractCegarLoop]: Abstraction has has 246 places, 324 transitions, 1928 flow [2025-04-30 10:26:50,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.33333333333334) internal successors, (818), 6 states have internal predecessors, (818), 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-30 10:26:50,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:50,985 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:26:50,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:26:50,986 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:50,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash -882247298, now seen corresponding path program 1 times [2025-04-30 10:26:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:50,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460163684] [2025-04-30 10:26:50,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:50,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:51,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-04-30 10:26:51,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:26:51,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:51,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:57,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:57,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460163684] [2025-04-30 10:26:57,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460163684] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:57,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:57,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-30 10:26:57,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690078381] [2025-04-30 10:26:57,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:57,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:26:57,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:57,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:26:57,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:26:59,866 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 163 [2025-04-30 10:26:59,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 324 transitions, 1928 flow. Second operand has 15 states, 15 states have (on average 124.73333333333333) internal successors, (1871), 15 states have internal predecessors, (1871), 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-30 10:26:59,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:59,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 163 [2025-04-30 10:26:59,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:01,016 INFO L116 PetriNetUnfolderBase]: 461/1620 cut-off events. [2025-04-30 10:27:01,016 INFO L117 PetriNetUnfolderBase]: For 3046/3165 co-relation queries the response was YES. [2025-04-30 10:27:01,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 1620 events. 461/1620 cut-off events. For 3046/3165 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10186 event pairs, 19 based on Foata normal form. 50/1654 useless extension candidates. Maximal degree in co-relation 4950. Up to 562 conditions per place. [2025-04-30 10:27:01,025 INFO L140 encePairwiseOnDemand]: 136/163 looper letters, 190 selfloop transitions, 84 changer transitions 47/474 dead transitions. [2025-04-30 10:27:01,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 474 transitions, 3660 flow [2025-04-30 10:27:01,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:27:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-30 10:27:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2352 transitions. [2025-04-30 10:27:01,033 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8016359918200409 [2025-04-30 10:27:01,033 INFO L175 Difference]: Start difference. First operand has 246 places, 324 transitions, 1928 flow. Second operand 18 states and 2352 transitions. [2025-04-30 10:27:01,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 474 transitions, 3660 flow [2025-04-30 10:27:01,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 474 transitions, 3574 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:01,052 INFO L231 Difference]: Finished difference. Result has 271 places, 361 transitions, 2488 flow [2025-04-30 10:27:01,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2488, PETRI_PLACES=271, PETRI_TRANSITIONS=361} [2025-04-30 10:27:01,053 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 108 predicate places. [2025-04-30 10:27:01,053 INFO L485 AbstractCegarLoop]: Abstraction has has 271 places, 361 transitions, 2488 flow [2025-04-30 10:27:01,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 124.73333333333333) internal successors, (1871), 15 states have internal predecessors, (1871), 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-30 10:27:01,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:01,054 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:01,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:27:01,055 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:01,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1306055632, now seen corresponding path program 2 times [2025-04-30 10:27:01,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:01,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771931580] [2025-04-30 10:27:01,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:01,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:01,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-04-30 10:27:01,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 121 of 171 statements. [2025-04-30 10:27:01,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:01,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:01,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:01,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771931580] [2025-04-30 10:27:01,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771931580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:01,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:01,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:01,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266595544] [2025-04-30 10:27:01,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:01,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:01,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:01,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:01,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:02,413 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 163 [2025-04-30 10:27:02,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 361 transitions, 2488 flow. Second operand has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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-30 10:27:02,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:02,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 163 [2025-04-30 10:27:02,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:02,931 INFO L116 PetriNetUnfolderBase]: 456/1589 cut-off events. [2025-04-30 10:27:02,931 INFO L117 PetriNetUnfolderBase]: For 4521/4696 co-relation queries the response was YES. [2025-04-30 10:27:02,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5992 conditions, 1589 events. 456/1589 cut-off events. For 4521/4696 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9884 event pairs, 88 based on Foata normal form. 105/1677 useless extension candidates. Maximal degree in co-relation 5705. Up to 662 conditions per place. [2025-04-30 10:27:02,942 INFO L140 encePairwiseOnDemand]: 143/163 looper letters, 169 selfloop transitions, 83 changer transitions 20/427 dead transitions. [2025-04-30 10:27:02,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 427 transitions, 3521 flow [2025-04-30 10:27:02,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1261 transitions. [2025-04-30 10:27:02,946 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8595773687798227 [2025-04-30 10:27:02,946 INFO L175 Difference]: Start difference. First operand has 271 places, 361 transitions, 2488 flow. Second operand 9 states and 1261 transitions. [2025-04-30 10:27:02,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 427 transitions, 3521 flow [2025-04-30 10:27:02,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 427 transitions, 3481 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-04-30 10:27:02,971 INFO L231 Difference]: Finished difference. Result has 274 places, 365 transitions, 2692 flow [2025-04-30 10:27:02,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2692, PETRI_PLACES=274, PETRI_TRANSITIONS=365} [2025-04-30 10:27:02,972 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 111 predicate places. [2025-04-30 10:27:02,972 INFO L485 AbstractCegarLoop]: Abstraction has has 274 places, 365 transitions, 2692 flow [2025-04-30 10:27:02,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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-30 10:27:02,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:02,973 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:02,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:27:02,973 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:02,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1851445652, now seen corresponding path program 3 times [2025-04-30 10:27:02,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:02,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002241184] [2025-04-30 10:27:02,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:27:02,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:02,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 171 statements into 11 equivalence classes. [2025-04-30 10:27:02,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 121 of 171 statements. [2025-04-30 10:27:02,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:27:02,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:03,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:03,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002241184] [2025-04-30 10:27:03,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002241184] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:03,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:03,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242025022] [2025-04-30 10:27:03,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:03,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:03,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:03,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:03,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:04,452 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 163 [2025-04-30 10:27:04,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 365 transitions, 2692 flow. Second operand has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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-30 10:27:04,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:04,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 163 [2025-04-30 10:27:04,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:05,123 INFO L116 PetriNetUnfolderBase]: 780/2497 cut-off events. [2025-04-30 10:27:05,123 INFO L117 PetriNetUnfolderBase]: For 9720/9931 co-relation queries the response was YES. [2025-04-30 10:27:05,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10447 conditions, 2497 events. 780/2497 cut-off events. For 9720/9931 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 18253 event pairs, 58 based on Foata normal form. 79/2543 useless extension candidates. Maximal degree in co-relation 10157. Up to 632 conditions per place. [2025-04-30 10:27:05,139 INFO L140 encePairwiseOnDemand]: 145/163 looper letters, 348 selfloop transitions, 95 changer transitions 12/614 dead transitions. [2025-04-30 10:27:05,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 614 transitions, 6195 flow [2025-04-30 10:27:05,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:27:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:27:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1542 transitions. [2025-04-30 10:27:05,141 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8600111544896821 [2025-04-30 10:27:05,141 INFO L175 Difference]: Start difference. First operand has 274 places, 365 transitions, 2692 flow. Second operand 11 states and 1542 transitions. [2025-04-30 10:27:05,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 614 transitions, 6195 flow [2025-04-30 10:27:05,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 614 transitions, 6045 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-30 10:27:05,184 INFO L231 Difference]: Finished difference. Result has 287 places, 445 transitions, 4100 flow [2025-04-30 10:27:05,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=2622, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4100, PETRI_PLACES=287, PETRI_TRANSITIONS=445} [2025-04-30 10:27:05,184 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 124 predicate places. [2025-04-30 10:27:05,185 INFO L485 AbstractCegarLoop]: Abstraction has has 287 places, 445 transitions, 4100 flow [2025-04-30 10:27:05,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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-30 10:27:05,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:05,185 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:05,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:27:05,185 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:05,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:05,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2142090562, now seen corresponding path program 4 times [2025-04-30 10:27:05,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:05,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686491909] [2025-04-30 10:27:05,187 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:27:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:05,196 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 171 statements into 2 equivalence classes. [2025-04-30 10:27:05,218 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:27:05,218 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:27:05,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-04-30 10:27:06,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:06,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686491909] [2025-04-30 10:27:06,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686491909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:06,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:06,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:27:06,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150311524] [2025-04-30 10:27:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:06,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:27:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:06,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:27:06,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:27:07,419 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 163 [2025-04-30 10:27:07,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 445 transitions, 4100 flow. Second operand has 13 states, 13 states have (on average 123.15384615384616) internal successors, (1601), 13 states have internal predecessors, (1601), 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-30 10:27:07,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:07,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 163 [2025-04-30 10:27:07,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:08,587 INFO L116 PetriNetUnfolderBase]: 1242/3817 cut-off events. [2025-04-30 10:27:08,588 INFO L117 PetriNetUnfolderBase]: For 19204/19482 co-relation queries the response was YES. [2025-04-30 10:27:08,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16838 conditions, 3817 events. 1242/3817 cut-off events. For 19204/19482 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 31007 event pairs, 173 based on Foata normal form. 91/3865 useless extension candidates. Maximal degree in co-relation 16541. Up to 1434 conditions per place. [2025-04-30 10:27:08,615 INFO L140 encePairwiseOnDemand]: 139/163 looper letters, 454 selfloop transitions, 128 changer transitions 17/750 dead transitions. [2025-04-30 10:27:08,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 750 transitions, 8561 flow [2025-04-30 10:27:08,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:27:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:27:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2757 transitions. [2025-04-30 10:27:08,617 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8054338299737073 [2025-04-30 10:27:08,617 INFO L175 Difference]: Start difference. First operand has 287 places, 445 transitions, 4100 flow. Second operand 21 states and 2757 transitions. [2025-04-30 10:27:08,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 750 transitions, 8561 flow [2025-04-30 10:27:08,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 750 transitions, 8499 flow, removed 31 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:08,689 INFO L231 Difference]: Finished difference. Result has 319 places, 532 transitions, 5869 flow [2025-04-30 10:27:08,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=4052, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5869, PETRI_PLACES=319, PETRI_TRANSITIONS=532} [2025-04-30 10:27:08,690 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 156 predicate places. [2025-04-30 10:27:08,690 INFO L485 AbstractCegarLoop]: Abstraction has has 319 places, 532 transitions, 5869 flow [2025-04-30 10:27:08,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 123.15384615384616) internal successors, (1601), 13 states have internal predecessors, (1601), 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-30 10:27:08,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:08,691 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:08,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:27:08,691 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:08,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:08,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1170776066, now seen corresponding path program 5 times [2025-04-30 10:27:08,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:08,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293941485] [2025-04-30 10:27:08,692 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:27:08,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:08,702 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 171 statements into 11 equivalence classes. [2025-04-30 10:27:08,717 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:27:08,718 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:27:08,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-04-30 10:27:09,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:09,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293941485] [2025-04-30 10:27:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293941485] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:09,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402504706] [2025-04-30 10:27:09,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:09,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:09,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:09,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:09,850 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 163 [2025-04-30 10:27:09,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 532 transitions, 5869 flow. Second operand has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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-30 10:27:09,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:09,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 163 [2025-04-30 10:27:09,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:10,610 INFO L116 PetriNetUnfolderBase]: 1128/3679 cut-off events. [2025-04-30 10:27:10,610 INFO L117 PetriNetUnfolderBase]: For 23752/24016 co-relation queries the response was YES. [2025-04-30 10:27:10,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17380 conditions, 3679 events. 1128/3679 cut-off events. For 23752/24016 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 30734 event pairs, 123 based on Foata normal form. 83/3718 useless extension candidates. Maximal degree in co-relation 17071. Up to 1094 conditions per place. [2025-04-30 10:27:10,690 INFO L140 encePairwiseOnDemand]: 144/163 looper letters, 352 selfloop transitions, 189 changer transitions 18/723 dead transitions. [2025-04-30 10:27:10,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 723 transitions, 8893 flow [2025-04-30 10:27:10,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:27:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:27:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1432 transitions. [2025-04-30 10:27:10,692 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8785276073619632 [2025-04-30 10:27:10,692 INFO L175 Difference]: Start difference. First operand has 319 places, 532 transitions, 5869 flow. Second operand 10 states and 1432 transitions. [2025-04-30 10:27:10,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 723 transitions, 8893 flow [2025-04-30 10:27:10,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 723 transitions, 8696 flow, removed 89 selfloop flow, removed 6 redundant places. [2025-04-30 10:27:10,800 INFO L231 Difference]: Finished difference. Result has 327 places, 562 transitions, 6856 flow [2025-04-30 10:27:10,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=5676, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6856, PETRI_PLACES=327, PETRI_TRANSITIONS=562} [2025-04-30 10:27:10,801 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 164 predicate places. [2025-04-30 10:27:10,801 INFO L485 AbstractCegarLoop]: Abstraction has has 327 places, 562 transitions, 6856 flow [2025-04-30 10:27:10,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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-30 10:27:10,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:10,802 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:10,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:27:10,802 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:10,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:10,803 INFO L85 PathProgramCache]: Analyzing trace with hash 916401346, now seen corresponding path program 6 times [2025-04-30 10:27:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:10,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889690156] [2025-04-30 10:27:10,804 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:27:10,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:10,817 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 171 statements into 11 equivalence classes. [2025-04-30 10:27:10,825 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 119 of 171 statements. [2025-04-30 10:27:10,825 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-30 10:27:10,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-04-30 10:27:11,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:11,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889690156] [2025-04-30 10:27:11,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889690156] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:11,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:11,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764282464] [2025-04-30 10:27:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:11,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:11,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:11,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:12,312 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 163 [2025-04-30 10:27:12,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 562 transitions, 6856 flow. Second operand has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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-30 10:27:12,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:12,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 163 [2025-04-30 10:27:12,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:13,423 INFO L116 PetriNetUnfolderBase]: 1242/3849 cut-off events. [2025-04-30 10:27:13,423 INFO L117 PetriNetUnfolderBase]: For 30003/30295 co-relation queries the response was YES. [2025-04-30 10:27:13,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19365 conditions, 3849 events. 1242/3849 cut-off events. For 30003/30295 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 31902 event pairs, 169 based on Foata normal form. 185/3986 useless extension candidates. Maximal degree in co-relation 19050. Up to 1768 conditions per place. [2025-04-30 10:27:13,456 INFO L140 encePairwiseOnDemand]: 143/163 looper letters, 234 selfloop transitions, 216 changer transitions 25/635 dead transitions. [2025-04-30 10:27:13,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 635 transitions, 8622 flow [2025-04-30 10:27:13,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:27:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:27:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1651 transitions. [2025-04-30 10:27:13,457 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8440695296523517 [2025-04-30 10:27:13,457 INFO L175 Difference]: Start difference. First operand has 327 places, 562 transitions, 6856 flow. Second operand 12 states and 1651 transitions. [2025-04-30 10:27:13,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 635 transitions, 8622 flow [2025-04-30 10:27:13,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 635 transitions, 8415 flow, removed 99 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:13,599 INFO L231 Difference]: Finished difference. Result has 342 places, 570 transitions, 7303 flow [2025-04-30 10:27:13,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=6666, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7303, PETRI_PLACES=342, PETRI_TRANSITIONS=570} [2025-04-30 10:27:13,601 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 179 predicate places. [2025-04-30 10:27:13,601 INFO L485 AbstractCegarLoop]: Abstraction has has 342 places, 570 transitions, 7303 flow [2025-04-30 10:27:13,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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-30 10:27:13,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:13,601 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:13,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:27:13,602 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:13,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:13,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1618963606, now seen corresponding path program 7 times [2025-04-30 10:27:13,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:13,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747306693] [2025-04-30 10:27:13,603 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:27:13,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:13,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-04-30 10:27:13,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:27:13,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:13,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-04-30 10:27:22,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:22,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747306693] [2025-04-30 10:27:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747306693] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:22,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328847679] [2025-04-30 10:27:22,845 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:27:22,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:22,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:22,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:27:22,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:27:22,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-04-30 10:27:22,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:27:22,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:22,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:22,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-30 10:27:22,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:23,221 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 16 treesize of output 12 [2025-04-30 10:27:23,386 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:27:23,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 15 [2025-04-30 10:27:23,431 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-30 10:27:23,490 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-30 10:27:23,553 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 0 case distinctions, treesize of input 40 treesize of output 42 [2025-04-30 10:27:23,618 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 0 case distinctions, treesize of input 52 treesize of output 57 [2025-04-30 10:27:23,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:27:23,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:27:23,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:27:23,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:27:23,772 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:23,773 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 65 treesize of output 73 [2025-04-30 10:27:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 214 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:27:23,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-04-30 10:27:24,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328847679] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:24,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:27:24,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14, 23] total 45 [2025-04-30 10:27:24,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887649209] [2025-04-30 10:27:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:24,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:27:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:24,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:27:24,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1865, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:27:26,908 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 163 [2025-04-30 10:27:26,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 570 transitions, 7303 flow. Second operand has 11 states, 11 states have (on average 128.0) internal successors, (1408), 11 states have internal predecessors, (1408), 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-30 10:27:26,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:26,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 163 [2025-04-30 10:27:26,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:28,635 INFO L116 PetriNetUnfolderBase]: 1215/3913 cut-off events. [2025-04-30 10:27:28,635 INFO L117 PetriNetUnfolderBase]: For 31862/32067 co-relation queries the response was YES. [2025-04-30 10:27:28,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19680 conditions, 3913 events. 1215/3913 cut-off events. For 31862/32067 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 32792 event pairs, 85 based on Foata normal form. 93/3971 useless extension candidates. Maximal degree in co-relation 19422. Up to 1261 conditions per place. [2025-04-30 10:27:28,668 INFO L140 encePairwiseOnDemand]: 143/163 looper letters, 470 selfloop transitions, 123 changer transitions 34/782 dead transitions. [2025-04-30 10:27:28,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 782 transitions, 10622 flow [2025-04-30 10:27:28,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:27:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:27:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1809 transitions. [2025-04-30 10:27:28,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.853704577630958 [2025-04-30 10:27:28,671 INFO L175 Difference]: Start difference. First operand has 342 places, 570 transitions, 7303 flow. Second operand 13 states and 1809 transitions. [2025-04-30 10:27:28,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 782 transitions, 10622 flow [2025-04-30 10:27:28,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 782 transitions, 10170 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:28,841 INFO L231 Difference]: Finished difference. Result has 354 places, 592 transitions, 7613 flow [2025-04-30 10:27:28,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=6909, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7613, PETRI_PLACES=354, PETRI_TRANSITIONS=592} [2025-04-30 10:27:28,842 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 191 predicate places. [2025-04-30 10:27:28,843 INFO L485 AbstractCegarLoop]: Abstraction has has 354 places, 592 transitions, 7613 flow [2025-04-30 10:27:28,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 128.0) internal successors, (1408), 11 states have internal predecessors, (1408), 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-30 10:27:28,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:28,843 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:28,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:27:29,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:27:29,044 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:29,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1571883052, now seen corresponding path program 8 times [2025-04-30 10:27:29,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:29,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970141699] [2025-04-30 10:27:29,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:29,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:29,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-04-30 10:27:29,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 171 statements. [2025-04-30 10:27:29,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:29,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-04-30 10:27:31,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:31,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970141699] [2025-04-30 10:27:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970141699] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:31,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:31,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740116458] [2025-04-30 10:27:31,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:31,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:31,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:31,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:32,223 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 163 [2025-04-30 10:27:32,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 592 transitions, 7613 flow. Second operand has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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-30 10:27:32,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:32,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 163 [2025-04-30 10:27:32,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:33,377 INFO L116 PetriNetUnfolderBase]: 1141/3766 cut-off events. [2025-04-30 10:27:33,377 INFO L117 PetriNetUnfolderBase]: For 34322/34628 co-relation queries the response was YES. [2025-04-30 10:27:33,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19458 conditions, 3766 events. 1141/3766 cut-off events. For 34322/34628 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 31777 event pairs, 144 based on Foata normal form. 142/3859 useless extension candidates. Maximal degree in co-relation 19299. Up to 1558 conditions per place. [2025-04-30 10:27:33,406 INFO L140 encePairwiseOnDemand]: 143/163 looper letters, 257 selfloop transitions, 219 changer transitions 11/651 dead transitions. [2025-04-30 10:27:33,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 651 transitions, 9383 flow [2025-04-30 10:27:33,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:27:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-30 10:27:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1916 transitions. [2025-04-30 10:27:33,410 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8396143733567046 [2025-04-30 10:27:33,410 INFO L175 Difference]: Start difference. First operand has 354 places, 592 transitions, 7613 flow. Second operand 14 states and 1916 transitions. [2025-04-30 10:27:33,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 651 transitions, 9383 flow [2025-04-30 10:27:33,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 651 transitions, 9225 flow, removed 36 selfloop flow, removed 3 redundant places. [2025-04-30 10:27:33,572 INFO L231 Difference]: Finished difference. Result has 370 places, 612 transitions, 8388 flow [2025-04-30 10:27:33,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=7475, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8388, PETRI_PLACES=370, PETRI_TRANSITIONS=612} [2025-04-30 10:27:33,572 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 207 predicate places. [2025-04-30 10:27:33,572 INFO L485 AbstractCegarLoop]: Abstraction has has 370 places, 612 transitions, 8388 flow [2025-04-30 10:27:33,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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-30 10:27:33,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:33,573 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:33,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:27:33,573 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:33,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:33,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1174584208, now seen corresponding path program 9 times [2025-04-30 10:27:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:33,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640361861] [2025-04-30 10:27:33,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:27:33,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:33,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 171 statements into 11 equivalence classes. [2025-04-30 10:27:33,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 116 of 171 statements. [2025-04-30 10:27:33,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:27:33,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-04-30 10:27:34,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:34,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640361861] [2025-04-30 10:27:34,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640361861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:34,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:34,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:34,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534599876] [2025-04-30 10:27:34,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:34,223 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:34,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:34,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:34,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:35,037 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 163 [2025-04-30 10:27:35,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 612 transitions, 8388 flow. Second operand has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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-30 10:27:35,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:35,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 163 [2025-04-30 10:27:35,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:36,062 INFO L116 PetriNetUnfolderBase]: 1237/3871 cut-off events. [2025-04-30 10:27:36,062 INFO L117 PetriNetUnfolderBase]: For 37929/38188 co-relation queries the response was YES. [2025-04-30 10:27:36,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20860 conditions, 3871 events. 1237/3871 cut-off events. For 37929/38188 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 32244 event pairs, 131 based on Foata normal form. 108/3935 useless extension candidates. Maximal degree in co-relation 20685. Up to 1320 conditions per place. [2025-04-30 10:27:36,092 INFO L140 encePairwiseOnDemand]: 142/163 looper letters, 452 selfloop transitions, 153 changer transitions 24/789 dead transitions. [2025-04-30 10:27:36,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 789 transitions, 11458 flow [2025-04-30 10:27:36,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:27:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:27:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1553 transitions. [2025-04-30 10:27:36,094 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8661461238148355 [2025-04-30 10:27:36,094 INFO L175 Difference]: Start difference. First operand has 370 places, 612 transitions, 8388 flow. Second operand 11 states and 1553 transitions. [2025-04-30 10:27:36,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 789 transitions, 11458 flow [2025-04-30 10:27:36,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 789 transitions, 11165 flow, removed 77 selfloop flow, removed 4 redundant places. [2025-04-30 10:27:36,251 INFO L231 Difference]: Finished difference. Result has 382 places, 626 transitions, 8824 flow [2025-04-30 10:27:36,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=8116, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8824, PETRI_PLACES=382, PETRI_TRANSITIONS=626} [2025-04-30 10:27:36,252 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 219 predicate places. [2025-04-30 10:27:36,252 INFO L485 AbstractCegarLoop]: Abstraction has has 382 places, 626 transitions, 8824 flow [2025-04-30 10:27:36,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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-30 10:27:36,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:36,252 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:36,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:27:36,252 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:36,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1829357954, now seen corresponding path program 10 times [2025-04-30 10:27:36,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:36,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133324046] [2025-04-30 10:27:36,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:27:36,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:36,263 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 171 statements into 2 equivalence classes. [2025-04-30 10:27:36,279 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:27:36,279 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:27:36,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-04-30 10:27:37,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:37,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133324046] [2025-04-30 10:27:37,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133324046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:37,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70057706] [2025-04-30 10:27:37,259 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:27:37,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:37,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:37,261 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:27:37,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:27:37,325 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 171 statements into 2 equivalence classes. [2025-04-30 10:27:37,362 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:27:37,362 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:27:37,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:37,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-30 10:27:37,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:37,583 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 16 treesize of output 12 [2025-04-30 10:27:37,624 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-30 10:27:37,732 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:27:37,732 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 15 [2025-04-30 10:27:37,780 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-30 10:27:37,846 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 0 case distinctions, treesize of input 40 treesize of output 42 [2025-04-30 10:27:37,913 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 0 case distinctions, treesize of input 52 treesize of output 57 [2025-04-30 10:27:38,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:27:38,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:27:38,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:27:38,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:27:38,046 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:38,046 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 75 treesize of output 60 [2025-04-30 10:27:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:27:38,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:39,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2025-04-30 10:27:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-04-30 10:27:39,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70057706] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:39,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:27:39,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14, 25] total 45 [2025-04-30 10:27:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38369405] [2025-04-30 10:27:39,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:39,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:27:39,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:39,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:27:39,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1880, Unknown=0, NotChecked=0, Total=2070 Killed by 15