./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4b0baa913b04cb405887810f5346cca5c549e3b66e03da220a52b8657c83a30 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:25,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:25,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:08:25,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:25,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:25,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:25,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:25,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:25,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:25,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:25,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:25,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:25,408 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:25,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:25,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:25,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:25,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:25,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:25,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:25,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:25,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:25,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:25,409 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:25,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:25,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:25,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:25,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:25,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:25,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:25,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:25,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:25,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:25,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:25,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:25,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:25,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:25,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:25,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:25,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:25,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:25,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:25,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:25,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:25,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:25,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:25,412 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 -> d4b0baa913b04cb405887810f5346cca5c549e3b66e03da220a52b8657c83a30 [2025-04-29 11:08:25,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:25,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:25,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:25,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:25,659 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:25,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.c [2025-04-29 11:08:26,902 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fab29511/a73085b0fce34ae8a0735e8189a7a97e/FLAG387d712bb [2025-04-29 11:08:27,142 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:27,157 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.c [2025-04-29 11:08:27,159 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:27,159 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:27,164 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fab29511/a73085b0fce34ae8a0735e8189a7a97e/FLAG387d712bb [2025-04-29 11:08:27,953 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fab29511/a73085b0fce34ae8a0735e8189a7a97e [2025-04-29 11:08:27,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:27,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:27,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:27,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:27,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:27,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:27" (1/1) ... [2025-04-29 11:08:27,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfead2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:27, skipping insertion in model container [2025-04-29 11:08:27,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:27" (1/1) ... [2025-04-29 11:08:27,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:28,142 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:28,160 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:28,189 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:28,203 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:28,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28 WrapperNode [2025-04-29 11:08:28,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:28,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:28,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:28,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:28,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,245 INFO L138 Inliner]: procedures = 14, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 108 [2025-04-29 11:08:28,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:28,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:28,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:28,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:28,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:28,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:28,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:28,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:28,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (1/1) ... [2025-04-29 11:08:28,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:28,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:28,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:08:28,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:28,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:28,319 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:28,320 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:08:28,370 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:28,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:28,626 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:28,626 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:28,656 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:28,657 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:28,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:28 BoogieIcfgContainer [2025-04-29 11:08:28,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:28,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:28,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:28,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:28,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:27" (1/3) ... [2025-04-29 11:08:28,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1ac2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:28, skipping insertion in model container [2025-04-29 11:08:28,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:28" (2/3) ... [2025-04-29 11:08:28,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1ac2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:28, skipping insertion in model container [2025-04-29 11:08:28,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:28" (3/3) ... [2025-04-29 11:08:28,669 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.c [2025-04-29 11:08:28,680 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:28,683 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_06-tricky_address1.c that has 2 procedures, 118 locations, 119 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-29 11:08:28,683 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:28,751 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:28,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 120 transitions, 244 flow [2025-04-29 11:08:28,824 INFO L116 PetriNetUnfolderBase]: 3/119 cut-off events. [2025-04-29 11:08:28,828 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:28,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2025-04-29 11:08:28,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 120 transitions, 244 flow [2025-04-29 11:08:28,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 119 transitions, 241 flow [2025-04-29 11:08:28,843 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:28,852 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;@47ca3c62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:28,852 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:08:28,866 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:28,866 INFO L116 PetriNetUnfolderBase]: 3/71 cut-off events. [2025-04-29 11:08:28,866 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:28,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:28,866 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] [2025-04-29 11:08:28,867 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-29 11:08:28,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash -786000854, now seen corresponding path program 1 times [2025-04-29 11:08:28,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:28,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094808440] [2025-04-29 11:08:28,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:28,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:08:28,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:08:28,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:28,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:29,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094808440] [2025-04-29 11:08:29,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094808440] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:29,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:29,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:08:29,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401037084] [2025-04-29 11:08:29,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:29,081 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:29,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:29,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:29,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:29,142 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 120 [2025-04-29 11:08:29,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:29,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:29,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 120 [2025-04-29 11:08:29,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:29,197 INFO L116 PetriNetUnfolderBase]: 7/181 cut-off events. [2025-04-29 11:08:29,198 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:29,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 181 events. 7/181 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 324 event pairs, 6 based on Foata normal form. 5/174 useless extension candidates. Maximal degree in co-relation 144. Up to 24 conditions per place. [2025-04-29 11:08:29,201 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 10 selfloop transitions, 2 changer transitions 1/118 dead transitions. [2025-04-29 11:08:29,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 118 transitions, 263 flow [2025-04-29 11:08:29,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2025-04-29 11:08:29,214 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-04-29 11:08:29,216 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 241 flow. Second operand 3 states and 336 transitions. [2025-04-29 11:08:29,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 118 transitions, 263 flow [2025-04-29 11:08:29,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 118 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:29,225 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 246 flow [2025-04-29 11:08:29,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=122, PETRI_TRANSITIONS=117} [2025-04-29 11:08:29,232 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 2 predicate places. [2025-04-29 11:08:29,233 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 246 flow [2025-04-29 11:08:29,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:29,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:29,234 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] [2025-04-29 11:08:29,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:29,235 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-29 11:08:29,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1729146193, now seen corresponding path program 1 times [2025-04-29 11:08:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:29,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140128008] [2025-04-29 11:08:29,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:29,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:08:29,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:08:29,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:29,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:29,396 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-29 11:08:29,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:29,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140128008] [2025-04-29 11:08:29,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140128008] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:29,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748140852] [2025-04-29 11:08:29,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:29,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:29,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:29,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:29,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:08:29,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:08:29,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:08:29,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:29,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:29,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:08:29,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:29,523 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-29 11:08:29,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:29,584 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-29 11:08:29,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748140852] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:29,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:08:29,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992467429] [2025-04-29 11:08:29,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:29,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:29,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:29,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:29,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:29,627 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 120 [2025-04-29 11:08:29,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:29,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:29,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 120 [2025-04-29 11:08:29,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:29,759 INFO L116 PetriNetUnfolderBase]: 7/187 cut-off events. [2025-04-29 11:08:29,760 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:29,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 187 events. 7/187 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 317 event pairs, 6 based on Foata normal form. 2/178 useless extension candidates. Maximal degree in co-relation 191. Up to 24 conditions per place. [2025-04-29 11:08:29,761 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 14 selfloop transitions, 9 changer transitions 0/125 dead transitions. [2025-04-29 11:08:29,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 125 transitions, 310 flow [2025-04-29 11:08:29,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 961 transitions. [2025-04-29 11:08:29,765 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8898148148148148 [2025-04-29 11:08:29,765 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 246 flow. Second operand 9 states and 961 transitions. [2025-04-29 11:08:29,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 125 transitions, 310 flow [2025-04-29 11:08:29,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 125 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:29,767 INFO L231 Difference]: Finished difference. Result has 131 places, 123 transitions, 294 flow [2025-04-29 11:08:29,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=294, PETRI_PLACES=131, PETRI_TRANSITIONS=123} [2025-04-29 11:08:29,768 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 11 predicate places. [2025-04-29 11:08:29,768 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 123 transitions, 294 flow [2025-04-29 11:08:29,769 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:29,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:29,769 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] [2025-04-29 11:08:29,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:08:29,970 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-29 11:08:29,970 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-29 11:08:29,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1327889295, now seen corresponding path program 2 times [2025-04-29 11:08:29,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:29,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379576872] [2025-04-29 11:08:29,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:29,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:29,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-04-29 11:08:29,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 69 statements. [2025-04-29 11:08:29,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:29,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:30,347 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-29 11:08:30,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:30,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379576872] [2025-04-29 11:08:30,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379576872] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:30,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:30,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546823518] [2025-04-29 11:08:30,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:30,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:30,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:30,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:30,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:30,620 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 120 [2025-04-29 11:08:30,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 123 transitions, 294 flow. Second operand has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:30,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:30,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 120 [2025-04-29 11:08:30,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:30,729 INFO L116 PetriNetUnfolderBase]: 103/478 cut-off events. [2025-04-29 11:08:30,729 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:08:30,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 478 events. 103/478 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2259 event pairs, 49 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 671. Up to 184 conditions per place. [2025-04-29 11:08:30,732 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 31 selfloop transitions, 22 changer transitions 0/152 dead transitions. [2025-04-29 11:08:30,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 152 transitions, 458 flow [2025-04-29 11:08:30,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2025-04-29 11:08:30,734 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8583333333333333 [2025-04-29 11:08:30,734 INFO L175 Difference]: Start difference. First operand has 131 places, 123 transitions, 294 flow. Second operand 6 states and 618 transitions. [2025-04-29 11:08:30,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 152 transitions, 458 flow [2025-04-29 11:08:30,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 152 transitions, 452 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:30,737 INFO L231 Difference]: Finished difference. Result has 140 places, 144 transitions, 438 flow [2025-04-29 11:08:30,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=140, PETRI_TRANSITIONS=144} [2025-04-29 11:08:30,738 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 20 predicate places. [2025-04-29 11:08:30,738 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 144 transitions, 438 flow [2025-04-29 11:08:30,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:30,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:30,739 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] [2025-04-29 11:08:30,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:30,739 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-29 11:08:30,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:30,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1474340804, now seen corresponding path program 1 times [2025-04-29 11:08:30,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:30,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702698692] [2025-04-29 11:08:30,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:30,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:30,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:08:30,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:08:30,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:30,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:30,880 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-29 11:08:30,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:30,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702698692] [2025-04-29 11:08:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702698692] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:30,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808232039] [2025-04-29 11:08:30,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:30,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:30,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:30,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:30,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:08:30,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:08:30,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:08:30,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:30,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:30,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:08:30,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:31,005 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-29 11:08:31,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:31,111 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-29 11:08:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808232039] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:31,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:31,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:08:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455725716] [2025-04-29 11:08:31,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:31,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:08:31,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:31,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:08:31,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:08:31,147 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 120 [2025-04-29 11:08:31,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 144 transitions, 438 flow. Second operand has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:31,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:31,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 120 [2025-04-29 11:08:31,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:31,372 INFO L116 PetriNetUnfolderBase]: 38/356 cut-off events. [2025-04-29 11:08:31,372 INFO L117 PetriNetUnfolderBase]: For 57/62 co-relation queries the response was YES. [2025-04-29 11:08:31,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 356 events. 38/356 cut-off events. For 57/62 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1199 event pairs, 11 based on Foata normal form. 4/344 useless extension candidates. Maximal degree in co-relation 482. Up to 51 conditions per place. [2025-04-29 11:08:31,374 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 18 selfloop transitions, 21 changer transitions 0/162 dead transitions. [2025-04-29 11:08:31,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 162 transitions, 604 flow [2025-04-29 11:08:31,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:08:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:08:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2227 transitions. [2025-04-29 11:08:31,380 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8837301587301587 [2025-04-29 11:08:31,380 INFO L175 Difference]: Start difference. First operand has 140 places, 144 transitions, 438 flow. Second operand 21 states and 2227 transitions. [2025-04-29 11:08:31,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 162 transitions, 604 flow [2025-04-29 11:08:31,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 162 transitions, 604 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:31,386 INFO L231 Difference]: Finished difference. Result has 165 places, 157 transitions, 568 flow [2025-04-29 11:08:31,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=568, PETRI_PLACES=165, PETRI_TRANSITIONS=157} [2025-04-29 11:08:31,389 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 45 predicate places. [2025-04-29 11:08:31,389 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 157 transitions, 568 flow [2025-04-29 11:08:31,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:31,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:31,390 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] [2025-04-29 11:08:31,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:08:31,591 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-29 11:08:31,591 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-29 11:08:31,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1088151044, now seen corresponding path program 2 times [2025-04-29 11:08:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:31,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788475800] [2025-04-29 11:08:31,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:31,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-04-29 11:08:31,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 62 of 97 statements. [2025-04-29 11:08:31,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:31,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:31,864 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-29 11:08:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:31,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788475800] [2025-04-29 11:08:31,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788475800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:31,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283405557] [2025-04-29 11:08:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:31,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:31,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:31,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:31,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:32,064 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 120 [2025-04-29 11:08:32,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 157 transitions, 568 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:32,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:32,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 120 [2025-04-29 11:08:32,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:32,268 INFO L116 PetriNetUnfolderBase]: 223/852 cut-off events. [2025-04-29 11:08:32,269 INFO L117 PetriNetUnfolderBase]: For 188/194 co-relation queries the response was YES. [2025-04-29 11:08:32,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 852 events. 223/852 cut-off events. For 188/194 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4663 event pairs, 82 based on Foata normal form. 5/799 useless extension candidates. Maximal degree in co-relation 1566. Up to 407 conditions per place. [2025-04-29 11:08:32,275 INFO L140 encePairwiseOnDemand]: 105/120 looper letters, 53 selfloop transitions, 39 changer transitions 5/202 dead transitions. [2025-04-29 11:08:32,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 202 transitions, 882 flow [2025-04-29 11:08:32,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2025-04-29 11:08:32,278 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8388888888888889 [2025-04-29 11:08:32,278 INFO L175 Difference]: Start difference. First operand has 165 places, 157 transitions, 568 flow. Second operand 6 states and 604 transitions. [2025-04-29 11:08:32,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 202 transitions, 882 flow [2025-04-29 11:08:32,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 202 transitions, 858 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:08:32,288 INFO L231 Difference]: Finished difference. Result has 169 places, 193 transitions, 832 flow [2025-04-29 11:08:32,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=832, PETRI_PLACES=169, PETRI_TRANSITIONS=193} [2025-04-29 11:08:32,292 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 49 predicate places. [2025-04-29 11:08:32,292 INFO L485 AbstractCegarLoop]: Abstraction has has 169 places, 193 transitions, 832 flow [2025-04-29 11:08:32,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:32,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:32,293 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] [2025-04-29 11:08:32,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:32,293 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-29 11:08:32,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash -187517879, now seen corresponding path program 1 times [2025-04-29 11:08:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:32,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996046442] [2025-04-29 11:08:32,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:32,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:32,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-29 11:08:32,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-29 11:08:32,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:32,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:32,517 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-29 11:08:32,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:32,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996046442] [2025-04-29 11:08:32,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996046442] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:32,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773578416] [2025-04-29 11:08:32,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:32,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:32,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:32,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:32,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:08:32,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-29 11:08:32,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-29 11:08:32,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:32,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:32,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:08:32,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:32,634 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-29 11:08:32,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:32,792 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-29 11:08:32,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773578416] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:32,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:32,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:08:32,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520097397] [2025-04-29 11:08:32,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:32,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:08:32,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:32,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:08:32,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:08:32,817 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 120 [2025-04-29 11:08:32,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 193 transitions, 832 flow. Second operand has 23 states, 23 states have (on average 106.08695652173913) internal successors, (2440), 23 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:32,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:32,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 120 [2025-04-29 11:08:32,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:33,142 INFO L116 PetriNetUnfolderBase]: 117/615 cut-off events. [2025-04-29 11:08:33,142 INFO L117 PetriNetUnfolderBase]: For 327/332 co-relation queries the response was YES. [2025-04-29 11:08:33,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 615 events. 117/615 cut-off events. For 327/332 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2913 event pairs, 15 based on Foata normal form. 3/590 useless extension candidates. Maximal degree in co-relation 1115. Up to 118 conditions per place. [2025-04-29 11:08:33,145 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 21 selfloop transitions, 30 changer transitions 0/210 dead transitions. [2025-04-29 11:08:33,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 210 transitions, 1056 flow [2025-04-29 11:08:33,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:08:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:08:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3174 transitions. [2025-04-29 11:08:33,150 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8816666666666667 [2025-04-29 11:08:33,150 INFO L175 Difference]: Start difference. First operand has 169 places, 193 transitions, 832 flow. Second operand 30 states and 3174 transitions. [2025-04-29 11:08:33,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 210 transitions, 1056 flow [2025-04-29 11:08:33,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 210 transitions, 1024 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:33,156 INFO L231 Difference]: Finished difference. Result has 201 places, 203 transitions, 952 flow [2025-04-29 11:08:33,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=952, PETRI_PLACES=201, PETRI_TRANSITIONS=203} [2025-04-29 11:08:33,157 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 81 predicate places. [2025-04-29 11:08:33,157 INFO L485 AbstractCegarLoop]: Abstraction has has 201 places, 203 transitions, 952 flow [2025-04-29 11:08:33,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 106.08695652173913) internal successors, (2440), 23 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:33,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:33,158 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] [2025-04-29 11:08:33,165 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-29 11:08:33,359 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-29 11:08:33,359 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-29 11:08:33,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash -279343868, now seen corresponding path program 2 times [2025-04-29 11:08:33,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:33,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788066905] [2025-04-29 11:08:33,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:33,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:33,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-04-29 11:08:33,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 114 statements. [2025-04-29 11:08:33,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:33,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:33,534 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-29 11:08:33,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:33,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788066905] [2025-04-29 11:08:33,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788066905] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:33,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:33,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:33,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976919748] [2025-04-29 11:08:33,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:33,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:33,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:33,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:33,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:33,615 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2025-04-29 11:08:33,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 203 transitions, 952 flow. Second operand has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:33,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:33,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2025-04-29 11:08:33,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:33,804 INFO L116 PetriNetUnfolderBase]: 212/885 cut-off events. [2025-04-29 11:08:33,804 INFO L117 PetriNetUnfolderBase]: For 571/615 co-relation queries the response was YES. [2025-04-29 11:08:33,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2145 conditions, 885 events. 212/885 cut-off events. For 571/615 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4941 event pairs, 40 based on Foata normal form. 1/868 useless extension candidates. Maximal degree in co-relation 1908. Up to 338 conditions per place. [2025-04-29 11:08:33,811 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 72 selfloop transitions, 40 changer transitions 0/242 dead transitions. [2025-04-29 11:08:33,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 242 transitions, 1360 flow [2025-04-29 11:08:33,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2025-04-29 11:08:33,814 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8791666666666667 [2025-04-29 11:08:33,814 INFO L175 Difference]: Start difference. First operand has 201 places, 203 transitions, 952 flow. Second operand 6 states and 633 transitions. [2025-04-29 11:08:33,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 242 transitions, 1360 flow [2025-04-29 11:08:33,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 242 transitions, 1314 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:08:33,822 INFO L231 Difference]: Finished difference. Result has 193 places, 234 transitions, 1274 flow [2025-04-29 11:08:33,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1274, PETRI_PLACES=193, PETRI_TRANSITIONS=234} [2025-04-29 11:08:33,824 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 73 predicate places. [2025-04-29 11:08:33,825 INFO L485 AbstractCegarLoop]: Abstraction has has 193 places, 234 transitions, 1274 flow [2025-04-29 11:08:33,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:33,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:33,826 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] [2025-04-29 11:08:33,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:08:33,827 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-29 11:08:33,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1927687799, now seen corresponding path program 1 times [2025-04-29 11:08:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:33,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527350897] [2025-04-29 11:08:33,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:33,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:33,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-29 11:08:33,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-29 11:08:33,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:33,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:34,107 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-29 11:08:34,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:34,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527350897] [2025-04-29 11:08:34,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527350897] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:34,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:34,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:34,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765122445] [2025-04-29 11:08:34,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:34,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:34,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:34,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:34,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:34,178 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2025-04-29 11:08:34,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 234 transitions, 1274 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:34,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:34,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2025-04-29 11:08:34,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:34,452 INFO L116 PetriNetUnfolderBase]: 361/1286 cut-off events. [2025-04-29 11:08:34,452 INFO L117 PetriNetUnfolderBase]: For 1410/1438 co-relation queries the response was YES. [2025-04-29 11:08:34,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3625 conditions, 1286 events. 361/1286 cut-off events. For 1410/1438 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7995 event pairs, 87 based on Foata normal form. 2/1252 useless extension candidates. Maximal degree in co-relation 3405. Up to 610 conditions per place. [2025-04-29 11:08:34,461 INFO L140 encePairwiseOnDemand]: 105/120 looper letters, 100 selfloop transitions, 64 changer transitions 10/295 dead transitions. [2025-04-29 11:08:34,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 295 transitions, 1962 flow [2025-04-29 11:08:34,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2025-04-29 11:08:34,463 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8597222222222223 [2025-04-29 11:08:34,463 INFO L175 Difference]: Start difference. First operand has 193 places, 234 transitions, 1274 flow. Second operand 6 states and 619 transitions. [2025-04-29 11:08:34,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 295 transitions, 1962 flow [2025-04-29 11:08:34,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 295 transitions, 1944 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:34,477 INFO L231 Difference]: Finished difference. Result has 203 places, 281 transitions, 1842 flow [2025-04-29 11:08:34,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1842, PETRI_PLACES=203, PETRI_TRANSITIONS=281} [2025-04-29 11:08:34,478 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 83 predicate places. [2025-04-29 11:08:34,478 INFO L485 AbstractCegarLoop]: Abstraction has has 203 places, 281 transitions, 1842 flow [2025-04-29 11:08:34,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:34,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:34,478 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] [2025-04-29 11:08:34,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:34,479 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-29 11:08:34,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:34,479 INFO L85 PathProgramCache]: Analyzing trace with hash 996873668, now seen corresponding path program 1 times [2025-04-29 11:08:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:34,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67322922] [2025-04-29 11:08:34,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:34,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:34,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:08:34,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:08:34,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:34,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:35,342 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-29 11:08:35,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:35,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67322922] [2025-04-29 11:08:35,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67322922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:35,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:35,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:35,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061704097] [2025-04-29 11:08:35,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:35,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:35,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:35,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:35,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:35,772 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 120 [2025-04-29 11:08:35,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 281 transitions, 1842 flow. Second operand has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:35,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:35,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 120 [2025-04-29 11:08:35,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:36,220 INFO L116 PetriNetUnfolderBase]: 460/1549 cut-off events. [2025-04-29 11:08:36,220 INFO L117 PetriNetUnfolderBase]: For 2975/3048 co-relation queries the response was YES. [2025-04-29 11:08:36,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5194 conditions, 1549 events. 460/1549 cut-off events. For 2975/3048 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 10037 event pairs, 19 based on Foata normal form. 37/1570 useless extension candidates. Maximal degree in co-relation 4957. Up to 571 conditions per place. [2025-04-29 11:08:36,229 INFO L140 encePairwiseOnDemand]: 99/120 looper letters, 191 selfloop transitions, 86 changer transitions 37/430 dead transitions. [2025-04-29 11:08:36,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 430 transitions, 3558 flow [2025-04-29 11:08:36,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:08:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:08:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1163 transitions. [2025-04-29 11:08:36,232 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8076388888888889 [2025-04-29 11:08:36,232 INFO L175 Difference]: Start difference. First operand has 203 places, 281 transitions, 1842 flow. Second operand 12 states and 1163 transitions. [2025-04-29 11:08:36,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 430 transitions, 3558 flow [2025-04-29 11:08:36,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 430 transitions, 3472 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:36,254 INFO L231 Difference]: Finished difference. Result has 222 places, 327 transitions, 2454 flow [2025-04-29 11:08:36,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2454, PETRI_PLACES=222, PETRI_TRANSITIONS=327} [2025-04-29 11:08:36,255 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 102 predicate places. [2025-04-29 11:08:36,255 INFO L485 AbstractCegarLoop]: Abstraction has has 222 places, 327 transitions, 2454 flow [2025-04-29 11:08:36,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:36,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:36,256 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] [2025-04-29 11:08:36,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:08:36,256 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-29 11:08:36,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2022001262, now seen corresponding path program 2 times [2025-04-29 11:08:36,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:36,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338585905] [2025-04-29 11:08:36,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:36,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:08:36,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:08:36,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:36,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:36,756 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-29 11:08:36,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:36,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338585905] [2025-04-29 11:08:36,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338585905] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:36,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:36,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:36,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247685880] [2025-04-29 11:08:36,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:36,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:36,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:36,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:36,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:37,179 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 120 [2025-04-29 11:08:37,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 327 transitions, 2454 flow. Second operand has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:37,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:37,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 120 [2025-04-29 11:08:37,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:37,759 INFO L116 PetriNetUnfolderBase]: 431/1496 cut-off events. [2025-04-29 11:08:37,759 INFO L117 PetriNetUnfolderBase]: For 4363/4469 co-relation queries the response was YES. [2025-04-29 11:08:37,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5804 conditions, 1496 events. 431/1496 cut-off events. For 4363/4469 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9682 event pairs, 67 based on Foata normal form. 64/1541 useless extension candidates. Maximal degree in co-relation 5558. Up to 601 conditions per place. [2025-04-29 11:08:37,770 INFO L140 encePairwiseOnDemand]: 100/120 looper letters, 155 selfloop transitions, 83 changer transitions 31/385 dead transitions. [2025-04-29 11:08:37,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 385 transitions, 3458 flow [2025-04-29 11:08:37,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:08:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:08:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 968 transitions. [2025-04-29 11:08:37,774 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8066666666666666 [2025-04-29 11:08:37,774 INFO L175 Difference]: Start difference. First operand has 222 places, 327 transitions, 2454 flow. Second operand 10 states and 968 transitions. [2025-04-29 11:08:37,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 385 transitions, 3458 flow [2025-04-29 11:08:37,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 385 transitions, 3434 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:37,799 INFO L231 Difference]: Finished difference. Result has 234 places, 322 transitions, 2608 flow [2025-04-29 11:08:37,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=2430, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2608, PETRI_PLACES=234, PETRI_TRANSITIONS=322} [2025-04-29 11:08:37,800 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 114 predicate places. [2025-04-29 11:08:37,800 INFO L485 AbstractCegarLoop]: Abstraction has has 234 places, 322 transitions, 2608 flow [2025-04-29 11:08:37,801 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:37,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:37,801 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] [2025-04-29 11:08:37,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:08:37,801 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-29 11:08:37,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:37,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1071959786, now seen corresponding path program 3 times [2025-04-29 11:08:37,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:37,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194411040] [2025-04-29 11:08:37,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:08:37,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:37,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:08:37,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:08:37,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:08:37,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:38,319 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-29 11:08:38,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:38,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194411040] [2025-04-29 11:08:38,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194411040] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:38,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:38,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:38,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981490773] [2025-04-29 11:08:38,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:38,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:38,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:38,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:38,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:38,787 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 120 [2025-04-29 11:08:38,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 322 transitions, 2608 flow. Second operand has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:38,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:38,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 120 [2025-04-29 11:08:38,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:39,458 INFO L116 PetriNetUnfolderBase]: 777/2383 cut-off events. [2025-04-29 11:08:39,458 INFO L117 PetriNetUnfolderBase]: For 9275/9398 co-relation queries the response was YES. [2025-04-29 11:08:39,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10329 conditions, 2383 events. 777/2383 cut-off events. For 9275/9398 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 17622 event pairs, 58 based on Foata normal form. 56/2411 useless extension candidates. Maximal degree in co-relation 10079. Up to 632 conditions per place. [2025-04-29 11:08:39,476 INFO L140 encePairwiseOnDemand]: 102/120 looper letters, 351 selfloop transitions, 95 changer transitions 9/571 dead transitions. [2025-04-29 11:08:39,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 571 transitions, 6114 flow [2025-04-29 11:08:39,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:08:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:08:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1069 transitions. [2025-04-29 11:08:39,478 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8098484848484848 [2025-04-29 11:08:39,478 INFO L175 Difference]: Start difference. First operand has 234 places, 322 transitions, 2608 flow. Second operand 11 states and 1069 transitions. [2025-04-29 11:08:39,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 571 transitions, 6114 flow [2025-04-29 11:08:39,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 571 transitions, 5964 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-29 11:08:39,518 INFO L231 Difference]: Finished difference. Result has 244 places, 402 transitions, 4019 flow [2025-04-29 11:08:39,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=2538, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4019, PETRI_PLACES=244, PETRI_TRANSITIONS=402} [2025-04-29 11:08:39,519 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 124 predicate places. [2025-04-29 11:08:39,520 INFO L485 AbstractCegarLoop]: Abstraction has has 244 places, 402 transitions, 4019 flow [2025-04-29 11:08:39,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:39,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:39,520 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] [2025-04-29 11:08:39,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:08:39,520 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-29 11:08:39,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:39,521 INFO L85 PathProgramCache]: Analyzing trace with hash -632508566, now seen corresponding path program 4 times [2025-04-29 11:08:39,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:39,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293113181] [2025-04-29 11:08:39,521 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:08:39,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:39,530 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:08:39,541 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 108 of 128 statements. [2025-04-29 11:08:39,542 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:08:39,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:40,032 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-29 11:08:40,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:40,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293113181] [2025-04-29 11:08:40,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293113181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:40,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:40,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804734643] [2025-04-29 11:08:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:40,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:40,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:40,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:40,445 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 120 [2025-04-29 11:08:40,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 402 transitions, 4019 flow. Second operand has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:40,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:40,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 120 [2025-04-29 11:08:40,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:41,097 INFO L116 PetriNetUnfolderBase]: 786/2404 cut-off events. [2025-04-29 11:08:41,097 INFO L117 PetriNetUnfolderBase]: For 12545/12692 co-relation queries the response was YES. [2025-04-29 11:08:41,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11199 conditions, 2404 events. 786/2404 cut-off events. For 12545/12692 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 17856 event pairs, 90 based on Foata normal form. 82/2456 useless extension candidates. Maximal degree in co-relation 10942. Up to 1095 conditions per place. [2025-04-29 11:08:41,119 INFO L140 encePairwiseOnDemand]: 100/120 looper letters, 181 selfloop transitions, 148 changer transitions 12/457 dead transitions. [2025-04-29 11:08:41,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 457 transitions, 5246 flow [2025-04-29 11:08:41,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:08:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:08:41,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1055 transitions. [2025-04-29 11:08:41,121 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7992424242424242 [2025-04-29 11:08:41,121 INFO L175 Difference]: Start difference. First operand has 244 places, 402 transitions, 4019 flow. Second operand 11 states and 1055 transitions. [2025-04-29 11:08:41,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 457 transitions, 5246 flow [2025-04-29 11:08:41,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 457 transitions, 5192 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:41,176 INFO L231 Difference]: Finished difference. Result has 261 places, 413 transitions, 4660 flow [2025-04-29 11:08:41,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=3971, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4660, PETRI_PLACES=261, PETRI_TRANSITIONS=413} [2025-04-29 11:08:41,177 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 141 predicate places. [2025-04-29 11:08:41,177 INFO L485 AbstractCegarLoop]: Abstraction has has 261 places, 413 transitions, 4660 flow [2025-04-29 11:08:41,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:41,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:41,178 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] [2025-04-29 11:08:41,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:08:41,178 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-29 11:08:41,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1989445542, now seen corresponding path program 5 times [2025-04-29 11:08:41,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:41,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091643775] [2025-04-29 11:08:41,179 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:08:41,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:41,192 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:08:41,253 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:08:41,253 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:08:41,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:44,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:44,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091643775] [2025-04-29 11:08:44,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091643775] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:44,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250667903] [2025-04-29 11:08:44,952 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:08:44,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:44,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:44,954 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-29 11:08:44,955 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-29 11:08:45,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:08:45,062 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:08:45,062 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:08:45,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:45,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-29 11:08:45,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:45,408 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-29 11:08:45,554 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:08:45,555 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-29 11:08:45,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:08:45,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:08:45,714 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-29 11:08:45,791 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-29 11:08:45,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:08:45,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:08:45,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:08:45,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:08:45,903 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:08:45,903 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-29 11:08:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:08:46,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:46,852 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-29 11:08:46,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250667903] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:46,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:08:46,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [32, 25] total 65 [2025-04-29 11:08:46,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692510085] [2025-04-29 11:08:46,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:46,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:08:46,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:46,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:08:46,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4031, Unknown=0, NotChecked=0, Total=4290 [2025-04-29 11:08:48,027 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 120 [2025-04-29 11:08:48,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 413 transitions, 4660 flow. Second operand has 11 states, 11 states have (on average 85.9090909090909) internal successors, (945), 11 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:48,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:48,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 120 [2025-04-29 11:08:48,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:49,269 INFO L116 PetriNetUnfolderBase]: 826/2666 cut-off events. [2025-04-29 11:08:49,269 INFO L117 PetriNetUnfolderBase]: For 17088/17251 co-relation queries the response was YES. [2025-04-29 11:08:49,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12733 conditions, 2666 events. 826/2666 cut-off events. For 17088/17251 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 20519 event pairs, 55 based on Foata normal form. 79/2723 useless extension candidates. Maximal degree in co-relation 12468. Up to 665 conditions per place. [2025-04-29 11:08:49,285 INFO L140 encePairwiseOnDemand]: 100/120 looper letters, 366 selfloop transitions, 113 changer transitions 35/627 dead transitions. [2025-04-29 11:08:49,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 627 transitions, 7770 flow [2025-04-29 11:08:49,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:08:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:08:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1342 transitions. [2025-04-29 11:08:49,288 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7988095238095239 [2025-04-29 11:08:49,288 INFO L175 Difference]: Start difference. First operand has 261 places, 413 transitions, 4660 flow. Second operand 14 states and 1342 transitions. [2025-04-29 11:08:49,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 627 transitions, 7770 flow [2025-04-29 11:08:49,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 627 transitions, 7627 flow, removed 21 selfloop flow, removed 3 redundant places. [2025-04-29 11:08:49,345 INFO L231 Difference]: Finished difference. Result has 277 places, 440 transitions, 5262 flow [2025-04-29 11:08:49,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=4546, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5262, PETRI_PLACES=277, PETRI_TRANSITIONS=440} [2025-04-29 11:08:49,346 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 157 predicate places. [2025-04-29 11:08:49,346 INFO L485 AbstractCegarLoop]: Abstraction has has 277 places, 440 transitions, 5262 flow [2025-04-29 11:08:49,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.9090909090909) internal successors, (945), 11 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:49,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:49,346 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] [2025-04-29 11:08:49,352 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-29 11:08:49,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:49,547 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-29 11:08:49,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:49,548 INFO L85 PathProgramCache]: Analyzing trace with hash -819315954, now seen corresponding path program 6 times [2025-04-29 11:08:49,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:49,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732732344] [2025-04-29 11:08:49,548 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:08:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:49,557 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:08:49,563 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:08:49,564 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 11:08:49,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:49,981 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-29 11:08:49,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:49,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732732344] [2025-04-29 11:08:49,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732732344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:49,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:49,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:49,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577571225] [2025-04-29 11:08:49,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:49,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:49,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:49,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:50,647 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 120 [2025-04-29 11:08:50,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 440 transitions, 5262 flow. Second operand has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:50,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:50,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 120 [2025-04-29 11:08:50,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:51,442 INFO L116 PetriNetUnfolderBase]: 861/2675 cut-off events. [2025-04-29 11:08:51,442 INFO L117 PetriNetUnfolderBase]: For 21131/21302 co-relation queries the response was YES. [2025-04-29 11:08:51,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13711 conditions, 2675 events. 861/2675 cut-off events. For 21131/21302 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 20508 event pairs, 147 based on Foata normal form. 93/2739 useless extension candidates. Maximal degree in co-relation 13440. Up to 1239 conditions per place. [2025-04-29 11:08:51,465 INFO L140 encePairwiseOnDemand]: 100/120 looper letters, 220 selfloop transitions, 162 changer transitions 16/510 dead transitions. [2025-04-29 11:08:51,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 510 transitions, 6869 flow [2025-04-29 11:08:51,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:08:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:08:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1211 transitions. [2025-04-29 11:08:51,467 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7762820512820513 [2025-04-29 11:08:51,467 INFO L175 Difference]: Start difference. First operand has 277 places, 440 transitions, 5262 flow. Second operand 13 states and 1211 transitions. [2025-04-29 11:08:51,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 510 transitions, 6869 flow [2025-04-29 11:08:51,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 510 transitions, 6799 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:51,553 INFO L231 Difference]: Finished difference. Result has 293 places, 460 transitions, 5977 flow [2025-04-29 11:08:51,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=5202, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5977, PETRI_PLACES=293, PETRI_TRANSITIONS=460} [2025-04-29 11:08:51,555 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 173 predicate places. [2025-04-29 11:08:51,555 INFO L485 AbstractCegarLoop]: Abstraction has has 293 places, 460 transitions, 5977 flow [2025-04-29 11:08:51,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:51,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:51,556 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] [2025-04-29 11:08:51,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:08:51,556 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-29 11:08:51,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:51,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2144857646, now seen corresponding path program 7 times [2025-04-29 11:08:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:51,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8041957] [2025-04-29 11:08:51,557 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:08:51,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:51,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:08:51,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:08:51,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:51,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:52,108 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-29 11:08:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:52,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8041957] [2025-04-29 11:08:52,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8041957] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:52,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:52,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660470833] [2025-04-29 11:08:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:52,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:52,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:52,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:52,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:52,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 120 [2025-04-29 11:08:52,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 460 transitions, 5977 flow. Second operand has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:52,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:52,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 120 [2025-04-29 11:08:52,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:53,217 INFO L116 PetriNetUnfolderBase]: 796/2578 cut-off events. [2025-04-29 11:08:53,217 INFO L117 PetriNetUnfolderBase]: For 23509/23672 co-relation queries the response was YES. [2025-04-29 11:08:53,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13791 conditions, 2578 events. 796/2578 cut-off events. For 23509/23672 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 19888 event pairs, 92 based on Foata normal form. 64/2610 useless extension candidates. Maximal degree in co-relation 13607. Up to 627 conditions per place. [2025-04-29 11:08:53,270 INFO L140 encePairwiseOnDemand]: 102/120 looper letters, 348 selfloop transitions, 140 changer transitions 11/615 dead transitions. [2025-04-29 11:08:53,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 615 transitions, 8633 flow [2025-04-29 11:08:53,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:08:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:08:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1083 transitions. [2025-04-29 11:08:53,272 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8204545454545454 [2025-04-29 11:08:53,272 INFO L175 Difference]: Start difference. First operand has 293 places, 460 transitions, 5977 flow. Second operand 11 states and 1083 transitions. [2025-04-29 11:08:53,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 615 transitions, 8633 flow [2025-04-29 11:08:53,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 615 transitions, 8358 flow, removed 74 selfloop flow, removed 3 redundant places. [2025-04-29 11:08:53,364 INFO L231 Difference]: Finished difference. Result has 305 places, 472 transitions, 6336 flow [2025-04-29 11:08:53,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=5727, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6336, PETRI_PLACES=305, PETRI_TRANSITIONS=472} [2025-04-29 11:08:53,365 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 185 predicate places. [2025-04-29 11:08:53,365 INFO L485 AbstractCegarLoop]: Abstraction has has 305 places, 472 transitions, 6336 flow [2025-04-29 11:08:53,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:53,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:53,366 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] [2025-04-29 11:08:53,366 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:08:53,366 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-29 11:08:53,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:53,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1841121136, now seen corresponding path program 8 times [2025-04-29 11:08:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:53,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888943488] [2025-04-29 11:08:53,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:53,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:53,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:08:53,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:08:53,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:53,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:53,781 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-29 11:08:53,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:53,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888943488] [2025-04-29 11:08:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888943488] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:53,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:53,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:53,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588216568] [2025-04-29 11:08:53,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:53,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:53,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:53,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:54,176 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 120 [2025-04-29 11:08:54,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 472 transitions, 6336 flow. Second operand has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:54,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:54,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 120 [2025-04-29 11:08:54,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:54,790 INFO L116 PetriNetUnfolderBase]: 808/2602 cut-off events. [2025-04-29 11:08:54,790 INFO L117 PetriNetUnfolderBase]: For 26961/27085 co-relation queries the response was YES. [2025-04-29 11:08:54,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14315 conditions, 2602 events. 808/2602 cut-off events. For 26961/27085 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 20142 event pairs, 92 based on Foata normal form. 51/2616 useless extension candidates. Maximal degree in co-relation 14131. Up to 1095 conditions per place. [2025-04-29 11:08:54,810 INFO L140 encePairwiseOnDemand]: 100/120 looper letters, 246 selfloop transitions, 169 changer transitions 9/540 dead transitions. [2025-04-29 11:08:54,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 540 transitions, 8169 flow [2025-04-29 11:08:54,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:08:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:08:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 956 transitions. [2025-04-29 11:08:54,811 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7966666666666666 [2025-04-29 11:08:54,811 INFO L175 Difference]: Start difference. First operand has 305 places, 472 transitions, 6336 flow. Second operand 10 states and 956 transitions. [2025-04-29 11:08:54,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 540 transitions, 8169 flow [2025-04-29 11:08:54,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 540 transitions, 7837 flow, removed 27 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:54,927 INFO L231 Difference]: Finished difference. Result has 315 places, 498 transitions, 7020 flow [2025-04-29 11:08:54,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=6037, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7020, PETRI_PLACES=315, PETRI_TRANSITIONS=498} [2025-04-29 11:08:54,928 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 195 predicate places. [2025-04-29 11:08:54,928 INFO L485 AbstractCegarLoop]: Abstraction has has 315 places, 498 transitions, 7020 flow [2025-04-29 11:08:54,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:54,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:54,929 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] [2025-04-29 11:08:54,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:08:54,929 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:54,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1153653309, now seen corresponding path program 1 times [2025-04-29 11:08:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:54,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801341283] [2025-04-29 11:08:54,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:54,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:08:54,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:08:54,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:54,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:55,421 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-29 11:08:55,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:55,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801341283] [2025-04-29 11:08:55,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801341283] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:55,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:55,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:08:55,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011895336] [2025-04-29 11:08:55,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:55,423 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:08:55,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:55,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:08:55,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:08:55,995 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2025-04-29 11:08:55,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 498 transitions, 7020 flow. Second operand has 11 states, 11 states have (on average 92.36363636363636) internal successors, (1016), 11 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:55,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:55,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2025-04-29 11:08:55,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:56,626 INFO L116 PetriNetUnfolderBase]: 674/2340 cut-off events. [2025-04-29 11:08:56,626 INFO L117 PetriNetUnfolderBase]: For 27533/27671 co-relation queries the response was YES. [2025-04-29 11:08:56,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13193 conditions, 2340 events. 674/2340 cut-off events. For 27533/27671 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 18090 event pairs, 27 based on Foata normal form. 38/2364 useless extension candidates. Maximal degree in co-relation 12994. Up to 500 conditions per place. [2025-04-29 11:08:56,645 INFO L140 encePairwiseOnDemand]: 103/120 looper letters, 327 selfloop transitions, 134 changer transitions 26/649 dead transitions. [2025-04-29 11:08:56,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 649 transitions, 9636 flow [2025-04-29 11:08:56,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:08:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-29 11:08:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1578 transitions. [2025-04-29 11:08:56,646 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.821875 [2025-04-29 11:08:56,646 INFO L175 Difference]: Start difference. First operand has 315 places, 498 transitions, 7020 flow. Second operand 16 states and 1578 transitions. [2025-04-29 11:08:56,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 649 transitions, 9636 flow [2025-04-29 11:08:56,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 649 transitions, 9501 flow, removed 61 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:56,792 INFO L231 Difference]: Finished difference. Result has 338 places, 545 transitions, 8033 flow [2025-04-29 11:08:56,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=6891, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=8033, PETRI_PLACES=338, PETRI_TRANSITIONS=545} [2025-04-29 11:08:56,793 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 218 predicate places. [2025-04-29 11:08:56,794 INFO L485 AbstractCegarLoop]: Abstraction has has 338 places, 545 transitions, 8033 flow [2025-04-29 11:08:56,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 92.36363636363636) internal successors, (1016), 11 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:56,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:56,794 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] [2025-04-29 11:08:56,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:08:56,794 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-29 11:08:56,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash -446954080, now seen corresponding path program 9 times [2025-04-29 11:08:56,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:56,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198628190] [2025-04-29 11:08:56,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:08:56,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:56,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:08:56,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:08:56,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:08:56,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:57,128 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-29 11:08:57,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:57,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198628190] [2025-04-29 11:08:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198628190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033549598] [2025-04-29 11:08:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:57,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:57,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:57,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:57,535 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 120 [2025-04-29 11:08:57,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 545 transitions, 8033 flow. Second operand has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:57,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:57,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 120 [2025-04-29 11:08:57,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:58,272 INFO L116 PetriNetUnfolderBase]: 804/2597 cut-off events. [2025-04-29 11:08:58,272 INFO L117 PetriNetUnfolderBase]: For 31683/31835 co-relation queries the response was YES. [2025-04-29 11:08:58,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15349 conditions, 2597 events. 804/2597 cut-off events. For 31683/31835 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 20042 event pairs, 50 based on Foata normal form. 66/2628 useless extension candidates. Maximal degree in co-relation 15189. Up to 629 conditions per place. [2025-04-29 11:08:58,294 INFO L140 encePairwiseOnDemand]: 101/120 looper letters, 386 selfloop transitions, 148 changer transitions 10/664 dead transitions. [2025-04-29 11:08:58,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 664 transitions, 10434 flow [2025-04-29 11:08:58,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:08:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:08:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1079 transitions. [2025-04-29 11:08:58,299 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8174242424242424 [2025-04-29 11:08:58,299 INFO L175 Difference]: Start difference. First operand has 338 places, 545 transitions, 8033 flow. Second operand 11 states and 1079 transitions. [2025-04-29 11:08:58,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 664 transitions, 10434 flow [2025-04-29 11:08:58,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 664 transitions, 10394 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-04-29 11:08:58,475 INFO L231 Difference]: Finished difference. Result has 344 places, 555 transitions, 8583 flow [2025-04-29 11:08:58,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=7997, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8583, PETRI_PLACES=344, PETRI_TRANSITIONS=555} [2025-04-29 11:08:58,476 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 224 predicate places. [2025-04-29 11:08:58,476 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 555 transitions, 8583 flow [2025-04-29 11:08:58,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:58,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:58,476 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] [2025-04-29 11:08:58,476 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:08:58,476 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:58,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1520492284, now seen corresponding path program 10 times [2025-04-29 11:08:58,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:58,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898877454] [2025-04-29 11:08:58,478 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:08:58,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:58,485 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:08:58,490 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 108 of 128 statements. [2025-04-29 11:08:58,490 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:08:58,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:58,976 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-29 11:08:58,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:58,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898877454] [2025-04-29 11:08:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898877454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:58,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:58,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705988115] [2025-04-29 11:08:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:58,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:58,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:58,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:59,479 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 120 [2025-04-29 11:08:59,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 555 transitions, 8583 flow. Second operand has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:59,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:59,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 120 [2025-04-29 11:08:59,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:00,179 INFO L116 PetriNetUnfolderBase]: 802/2596 cut-off events. [2025-04-29 11:09:00,179 INFO L117 PetriNetUnfolderBase]: For 34799/34953 co-relation queries the response was YES. [2025-04-29 11:09:00,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15749 conditions, 2596 events. 802/2596 cut-off events. For 34799/34953 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 20074 event pairs, 50 based on Foata normal form. 66/2627 useless extension candidates. Maximal degree in co-relation 15586. Up to 629 conditions per place. [2025-04-29 11:09:00,201 INFO L140 encePairwiseOnDemand]: 102/120 looper letters, 397 selfloop transitions, 143 changer transitions 9/669 dead transitions. [2025-04-29 11:09:00,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 669 transitions, 10914 flow [2025-04-29 11:09:00,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:09:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:09:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1073 transitions. [2025-04-29 11:09:00,203 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8128787878787879 [2025-04-29 11:09:00,203 INFO L175 Difference]: Start difference. First operand has 344 places, 555 transitions, 8583 flow. Second operand 11 states and 1073 transitions. [2025-04-29 11:09:00,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 669 transitions, 10914 flow [2025-04-29 11:09:00,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 669 transitions, 10679 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-04-29 11:09:00,361 INFO L231 Difference]: Finished difference. Result has 352 places, 560 transitions, 8850 flow [2025-04-29 11:09:00,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=8351, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8850, PETRI_PLACES=352, PETRI_TRANSITIONS=560} [2025-04-29 11:09:00,361 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 232 predicate places. [2025-04-29 11:09:00,361 INFO L485 AbstractCegarLoop]: Abstraction has has 352 places, 560 transitions, 8850 flow [2025-04-29 11:09:00,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:00,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:00,362 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] [2025-04-29 11:09:00,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:09:00,362 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:00,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1493569034, now seen corresponding path program 11 times [2025-04-29 11:09:00,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:00,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100910401] [2025-04-29 11:09:00,363 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:09:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:00,370 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:09:00,391 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:09:00,392 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:09:00,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:03,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:03,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100910401] [2025-04-29 11:09:03,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100910401] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:03,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020964694] [2025-04-29 11:09:03,975 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:09:03,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:03,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:03,977 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-29 11:09:03,978 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-29 11:09:04,035 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:09:04,078 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:09:04,078 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:09:04,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:04,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-29 11:09:04,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:04,387 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-29 11:09:04,473 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:09:04,516 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:09:04,564 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-29 11:09:04,627 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:09:04,627 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-29 11:09:04,690 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-29 11:09:04,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:04,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:04,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:04,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:04,798 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:04,798 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-29 11:09:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:09:04,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:05,428 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-29 11:09:05,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020964694] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:05,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:09:05,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [32, 25] total 63 [2025-04-29 11:09:05,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552072994] [2025-04-29 11:09:05,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:05,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:05,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:05,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:05,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=3773, Unknown=0, NotChecked=0, Total=4032 [2025-04-29 11:09:06,377 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:09:06,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 560 transitions, 8850 flow. Second operand has 10 states, 10 states have (on average 87.0) internal successors, (870), 10 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:06,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:06,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:09:06,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:08,105 INFO L116 PetriNetUnfolderBase]: 879/2795 cut-off events. [2025-04-29 11:09:08,105 INFO L117 PetriNetUnfolderBase]: For 38654/38818 co-relation queries the response was YES. [2025-04-29 11:09:08,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17111 conditions, 2795 events. 879/2795 cut-off events. For 38654/38818 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 21654 event pairs, 30 based on Foata normal form. 80/2850 useless extension candidates. Maximal degree in co-relation 16944. Up to 1091 conditions per place. [2025-04-29 11:09:08,131 INFO L140 encePairwiseOnDemand]: 95/120 looper letters, 288 selfloop transitions, 261 changer transitions 20/683 dead transitions. [2025-04-29 11:09:08,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 683 transitions, 11751 flow [2025-04-29 11:09:08,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:09:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:09:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1248 transitions. [2025-04-29 11:09:08,132 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-04-29 11:09:08,132 INFO L175 Difference]: Start difference. First operand has 352 places, 560 transitions, 8850 flow. Second operand 13 states and 1248 transitions. [2025-04-29 11:09:08,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 683 transitions, 11751 flow [2025-04-29 11:09:08,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 683 transitions, 11514 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:08,303 INFO L231 Difference]: Finished difference. Result has 365 places, 603 transitions, 10458 flow [2025-04-29 11:09:08,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=8630, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10458, PETRI_PLACES=365, PETRI_TRANSITIONS=603} [2025-04-29 11:09:08,304 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 245 predicate places. [2025-04-29 11:09:08,304 INFO L485 AbstractCegarLoop]: Abstraction has has 365 places, 603 transitions, 10458 flow [2025-04-29 11:09:08,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.0) internal successors, (870), 10 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:08,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:08,305 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] [2025-04-29 11:09:08,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:08,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:08,505 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:08,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:08,506 INFO L85 PathProgramCache]: Analyzing trace with hash 316614876, now seen corresponding path program 12 times [2025-04-29 11:09:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:08,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308580839] [2025-04-29 11:09:08,506 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:09:08,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:08,514 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:09:08,517 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:09:08,517 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 11:09:08,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:08,860 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-29 11:09:08,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:08,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308580839] [2025-04-29 11:09:08,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308580839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:08,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:08,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:08,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288135541] [2025-04-29 11:09:08,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:08,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:08,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:08,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:09,224 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 120 [2025-04-29 11:09:09,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 603 transitions, 10458 flow. Second operand has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:09,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:09,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 120 [2025-04-29 11:09:09,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:10,056 INFO L116 PetriNetUnfolderBase]: 866/2762 cut-off events. [2025-04-29 11:09:10,056 INFO L117 PetriNetUnfolderBase]: For 46733/46905 co-relation queries the response was YES. [2025-04-29 11:09:10,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18299 conditions, 2762 events. 866/2762 cut-off events. For 46733/46905 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 21397 event pairs, 115 based on Foata normal form. 91/2809 useless extension candidates. Maximal degree in co-relation 18120. Up to 1231 conditions per place. [2025-04-29 11:09:10,079 INFO L140 encePairwiseOnDemand]: 100/120 looper letters, 305 selfloop transitions, 211 changer transitions 9/645 dead transitions. [2025-04-29 11:09:10,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 645 transitions, 12131 flow [2025-04-29 11:09:10,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:09:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:09:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1229 transitions. [2025-04-29 11:09:10,081 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7878205128205128 [2025-04-29 11:09:10,081 INFO L175 Difference]: Start difference. First operand has 365 places, 603 transitions, 10458 flow. Second operand 13 states and 1229 transitions. [2025-04-29 11:09:10,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 645 transitions, 12131 flow [2025-04-29 11:09:10,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 645 transitions, 11864 flow, removed 38 selfloop flow, removed 8 redundant places. [2025-04-29 11:09:10,280 INFO L231 Difference]: Finished difference. Result has 374 places, 614 transitions, 10919 flow [2025-04-29 11:09:10,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=10195, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10919, PETRI_PLACES=374, PETRI_TRANSITIONS=614} [2025-04-29 11:09:10,280 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 254 predicate places. [2025-04-29 11:09:10,281 INFO L485 AbstractCegarLoop]: Abstraction has has 374 places, 614 transitions, 10919 flow [2025-04-29 11:09:10,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:10,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:10,281 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] [2025-04-29 11:09:10,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:09:10,281 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:10,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1406738524, now seen corresponding path program 13 times [2025-04-29 11:09:10,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:10,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400261503] [2025-04-29 11:09:10,282 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:09:10,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:10,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:09:10,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:09:10,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:10,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:10,746 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-29 11:09:10,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:10,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400261503] [2025-04-29 11:09:10,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400261503] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:10,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:10,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:10,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557168300] [2025-04-29 11:09:10,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:10,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:10,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:10,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:10,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:11,167 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 120 [2025-04-29 11:09:11,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 614 transitions, 10919 flow. Second operand has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:11,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:11,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 120 [2025-04-29 11:09:11,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:12,106 INFO L116 PetriNetUnfolderBase]: 921/2831 cut-off events. [2025-04-29 11:09:12,106 INFO L117 PetriNetUnfolderBase]: For 49827/49996 co-relation queries the response was YES. [2025-04-29 11:09:12,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18943 conditions, 2831 events. 921/2831 cut-off events. For 49827/49996 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 21795 event pairs, 135 based on Foata normal form. 67/2858 useless extension candidates. Maximal degree in co-relation 18760. Up to 1357 conditions per place. [2025-04-29 11:09:12,131 INFO L140 encePairwiseOnDemand]: 100/120 looper letters, 317 selfloop transitions, 222 changer transitions 15/666 dead transitions. [2025-04-29 11:09:12,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 666 transitions, 12798 flow [2025-04-29 11:09:12,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:09:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:09:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1290 transitions. [2025-04-29 11:09:12,132 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7678571428571429 [2025-04-29 11:09:12,132 INFO L175 Difference]: Start difference. First operand has 374 places, 614 transitions, 10919 flow. Second operand 14 states and 1290 transitions. [2025-04-29 11:09:12,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 666 transitions, 12798 flow [2025-04-29 11:09:12,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 666 transitions, 12453 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-04-29 11:09:12,336 INFO L231 Difference]: Finished difference. Result has 386 places, 625 transitions, 11356 flow [2025-04-29 11:09:12,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=10587, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=11356, PETRI_PLACES=386, PETRI_TRANSITIONS=625} [2025-04-29 11:09:12,337 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 266 predicate places. [2025-04-29 11:09:12,337 INFO L485 AbstractCegarLoop]: Abstraction has has 386 places, 625 transitions, 11356 flow [2025-04-29 11:09:12,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:12,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:12,338 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] [2025-04-29 11:09:12,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:09:12,338 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:12,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:12,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1636918084, now seen corresponding path program 14 times [2025-04-29 11:09:12,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:12,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791079385] [2025-04-29 11:09:12,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:12,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:12,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:09:12,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:09:12,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:12,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:12,744 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-29 11:09:12,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:12,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791079385] [2025-04-29 11:09:12,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791079385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:12,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:12,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:12,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030630200] [2025-04-29 11:09:12,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:12,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:12,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:12,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:13,103 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 120 [2025-04-29 11:09:13,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 625 transitions, 11356 flow. Second operand has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:13,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:13,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 120 [2025-04-29 11:09:13,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:13,894 INFO L116 PetriNetUnfolderBase]: 864/2758 cut-off events. [2025-04-29 11:09:13,895 INFO L117 PetriNetUnfolderBase]: For 50053/50227 co-relation queries the response was YES. [2025-04-29 11:09:13,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18497 conditions, 2758 events. 864/2758 cut-off events. For 50053/50227 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 21387 event pairs, 114 based on Foata normal form. 89/2803 useless extension candidates. Maximal degree in co-relation 18308. Up to 1231 conditions per place. [2025-04-29 11:09:13,916 INFO L140 encePairwiseOnDemand]: 100/120 looper letters, 317 selfloop transitions, 211 changer transitions 9/657 dead transitions. [2025-04-29 11:09:13,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 657 transitions, 12811 flow [2025-04-29 11:09:13,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:09:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:09:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 960 transitions. [2025-04-29 11:09:13,917 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-04-29 11:09:13,917 INFO L175 Difference]: Start difference. First operand has 386 places, 625 transitions, 11356 flow. Second operand 10 states and 960 transitions. [2025-04-29 11:09:13,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 657 transitions, 12811 flow [2025-04-29 11:09:14,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 657 transitions, 12265 flow, removed 82 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:14,117 INFO L231 Difference]: Finished difference. Result has 394 places, 628 transitions, 11350 flow [2025-04-29 11:09:14,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=10810, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11350, PETRI_PLACES=394, PETRI_TRANSITIONS=628} [2025-04-29 11:09:14,118 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 274 predicate places. [2025-04-29 11:09:14,118 INFO L485 AbstractCegarLoop]: Abstraction has has 394 places, 628 transitions, 11350 flow [2025-04-29 11:09:14,118 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:14,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:14,119 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] [2025-04-29 11:09:14,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:09:14,119 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:14,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1164014578, now seen corresponding path program 15 times [2025-04-29 11:09:14,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:14,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75684948] [2025-04-29 11:09:14,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:09:14,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:14,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:09:14,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:09:14,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:09:14,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:14,427 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-29 11:09:14,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:14,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75684948] [2025-04-29 11:09:14,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75684948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:14,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:14,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:14,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187443914] [2025-04-29 11:09:14,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:14,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:14,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:14,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:14,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:14,838 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 120 [2025-04-29 11:09:14,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 628 transitions, 11350 flow. Second operand has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:14,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:14,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 120 [2025-04-29 11:09:14,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:15,672 INFO L116 PetriNetUnfolderBase]: 867/2766 cut-off events. [2025-04-29 11:09:15,672 INFO L117 PetriNetUnfolderBase]: For 50917/51089 co-relation queries the response was YES. [2025-04-29 11:09:15,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18615 conditions, 2766 events. 867/2766 cut-off events. For 50917/51089 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 21488 event pairs, 125 based on Foata normal form. 67/2793 useless extension candidates. Maximal degree in co-relation 18338. Up to 1219 conditions per place. [2025-04-29 11:09:15,697 INFO L140 encePairwiseOnDemand]: 100/120 looper letters, 321 selfloop transitions, 222 changer transitions 9/672 dead transitions. [2025-04-29 11:09:15,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 672 transitions, 13154 flow [2025-04-29 11:09:15,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:09:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:09:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1226 transitions. [2025-04-29 11:09:15,698 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7858974358974359 [2025-04-29 11:09:15,698 INFO L175 Difference]: Start difference. First operand has 394 places, 628 transitions, 11350 flow. Second operand 13 states and 1226 transitions. [2025-04-29 11:09:15,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 672 transitions, 13154 flow [2025-04-29 11:09:15,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 672 transitions, 12738 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-04-29 11:09:15,910 INFO L231 Difference]: Finished difference. Result has 403 places, 641 transitions, 11749 flow [2025-04-29 11:09:15,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=10954, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11749, PETRI_PLACES=403, PETRI_TRANSITIONS=641} [2025-04-29 11:09:15,911 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 283 predicate places. [2025-04-29 11:09:15,911 INFO L485 AbstractCegarLoop]: Abstraction has has 403 places, 641 transitions, 11749 flow [2025-04-29 11:09:15,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:15,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:15,911 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] [2025-04-29 11:09:15,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:09:15,912 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:15,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1752297942, now seen corresponding path program 16 times [2025-04-29 11:09:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:15,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949886656] [2025-04-29 11:09:15,913 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:09:15,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:15,919 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:09:15,932 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 108 of 128 statements. [2025-04-29 11:09:15,933 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:09:15,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:18,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:18,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949886656] [2025-04-29 11:09:18,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949886656] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:18,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265495149] [2025-04-29 11:09:18,983 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:09:18,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:18,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:18,985 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:18,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:09:19,048 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:09:19,115 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 108 of 128 statements. [2025-04-29 11:09:19,116 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:09:19,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:19,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-29 11:09:19,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:19,277 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-29 11:09:19,308 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:09:19,407 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:09:19,453 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-29 11:09:19,505 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:09:19,505 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-29 11:09:19,554 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-29 11:09:19,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:19,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:19,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:19,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:09:19,634 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:19,634 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-29 11:09:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 11:09:19,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:20,285 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-29 11:09:20,329 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-29 11:09:20,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265495149] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:20,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:09:20,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [32, 19] total 59 [2025-04-29 11:09:20,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539044690] [2025-04-29 11:09:20,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:20,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:09:20,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:20,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:09:20,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3304, Unknown=0, NotChecked=0, Total=3540 [2025-04-29 11:09:21,494 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 120 [2025-04-29 11:09:21,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 641 transitions, 11749 flow. Second operand has 11 states, 11 states have (on average 85.9090909090909) internal successors, (945), 11 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:21,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:21,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 120 [2025-04-29 11:09:21,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15