./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_26-alloc_region_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_26-alloc_region_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:27:57,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:27:57,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:27:57,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:27:57,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:27:57,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:27:57,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:27:57,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:27:57,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:27:57,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:27:57,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:27:57,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:27:57,225 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:27:57,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:27:57,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:27:57,225 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:27:57,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:27:57,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:27:57,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:27:57,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:27:57,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:27:57,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:27:57,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:57,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:57,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:57,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:27:57,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:27:57,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:27:57,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:27:57,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:27:57,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:27:57,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:27:57,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:27:57,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:27:57,228 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 -> a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 [2025-04-30 10:27:57,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:27:57,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:27:57,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:27:57,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:27:57,466 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:27:57,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_26-alloc_region_rc.i [2025-04-30 10:27:58,742 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11cc39a6/b32501ad30be46358f940f5c06deb071/FLAG8a34b03c8 [2025-04-30 10:27:59,015 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:27:59,016 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_26-alloc_region_rc.i [2025-04-30 10:27:59,032 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11cc39a6/b32501ad30be46358f940f5c06deb071/FLAG8a34b03c8 [2025-04-30 10:27:59,744 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11cc39a6/b32501ad30be46358f940f5c06deb071 [2025-04-30 10:27:59,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:27:59,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:27:59,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:59,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:27:59,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:27:59,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:59" (1/1) ... [2025-04-30 10:27:59,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18daf60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:59, skipping insertion in model container [2025-04-30 10:27:59,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:59" (1/1) ... [2025-04-30 10:27:59,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:28:00,181 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:28:00,192 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:28:00,250 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:28:00,298 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:28:00,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00 WrapperNode [2025-04-30 10:28:00,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:28:00,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:28:00,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:28:00,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:28:00,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,353 INFO L138 Inliner]: procedures = 370, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 243 [2025-04-30 10:28:00,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:28:00,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:28:00,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:28:00,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:28:00,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:28:00,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:28:00,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:28:00,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:28:00,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:28:00,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:00,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:28:00,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:28:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-30 10:28:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-30 10:28:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:28:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:28:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:28:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:28:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:28:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:28:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-30 10:28:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:28:00,444 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:28:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:28:00,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:28:00,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:28:00,445 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:28:00,564 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:28:00,565 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:28:00,960 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:28:00,960 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:28:00,979 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:28:00,980 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:28:00,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:28:00 BoogieIcfgContainer [2025-04-30 10:28:00,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:28:00,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:28:00,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:28:00,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:28:00,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:27:59" (1/3) ... [2025-04-30 10:28:00,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8936c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:28:00, skipping insertion in model container [2025-04-30 10:28:00,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (2/3) ... [2025-04-30 10:28:00,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8936c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:28:00, skipping insertion in model container [2025-04-30 10:28:00,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:28:00" (3/3) ... [2025-04-30 10:28:00,987 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i [2025-04-30 10:28:00,996 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:28:00,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_26-alloc_region_rc.i that has 2 procedures, 272 locations, 272 edges, 1 initial locations, 1 loop locations, and 20 error locations. [2025-04-30 10:28:00,998 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:28:01,053 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:28:01,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 273 transitions, 550 flow [2025-04-30 10:28:01,150 INFO L116 PetriNetUnfolderBase]: 2/272 cut-off events. [2025-04-30 10:28:01,152 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:28:01,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 272 events. 2/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 258 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2025-04-30 10:28:01,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 273 transitions, 550 flow [2025-04-30 10:28:01,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 272 transitions, 547 flow [2025-04-30 10:28:01,170 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:28:01,180 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;@55d4fe2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:28:01,182 INFO L341 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-04-30 10:28:01,189 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:28:01,189 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:28:01,189 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:28:01,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:01,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:01,190 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:01,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash -527324182, now seen corresponding path program 1 times [2025-04-30 10:28:01,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:01,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426103236] [2025-04-30 10:28:01,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:01,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:28:01,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:28:01,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:01,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:01,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:01,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426103236] [2025-04-30 10:28:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426103236] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:01,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:01,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865335820] [2025-04-30 10:28:01,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:01,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:01,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:01,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:02,309 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 273 [2025-04-30 10:28:02,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 272 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:02,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:02,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 273 [2025-04-30 10:28:02,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:02,963 INFO L116 PetriNetUnfolderBase]: 1377/5015 cut-off events. [2025-04-30 10:28:02,964 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:28:02,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7809 conditions, 5015 events. 1377/5015 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 37623 event pairs, 1344 based on Foata normal form. 36/4687 useless extension candidates. Maximal degree in co-relation 7712. Up to 2785 conditions per place. [2025-04-30 10:28:02,991 INFO L140 encePairwiseOnDemand]: 266/273 looper letters, 92 selfloop transitions, 5 changer transitions 0/270 dead transitions. [2025-04-30 10:28:02,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 270 transitions, 737 flow [2025-04-30 10:28:02,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1143 transitions. [2025-04-30 10:28:03,007 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6978021978021978 [2025-04-30 10:28:03,009 INFO L175 Difference]: Start difference. First operand has 274 places, 272 transitions, 547 flow. Second operand 6 states and 1143 transitions. [2025-04-30 10:28:03,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 270 transitions, 737 flow [2025-04-30 10:28:03,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 270 transitions, 736 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:28:03,020 INFO L231 Difference]: Finished difference. Result has 277 places, 270 transitions, 552 flow [2025-04-30 10:28:03,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=277, PETRI_TRANSITIONS=270} [2025-04-30 10:28:03,024 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 3 predicate places. [2025-04-30 10:28:03,025 INFO L485 AbstractCegarLoop]: Abstraction has has 277 places, 270 transitions, 552 flow [2025-04-30 10:28:03,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:03,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:03,026 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] [2025-04-30 10:28:03,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:28:03,026 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:03,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash 940357652, now seen corresponding path program 1 times [2025-04-30 10:28:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:03,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653110356] [2025-04-30 10:28:03,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:03,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:03,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:28:03,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:28:03,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:03,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:03,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:03,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653110356] [2025-04-30 10:28:03,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653110356] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:03,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:03,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:03,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814798448] [2025-04-30 10:28:03,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:03,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:03,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:03,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:03,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:03,726 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 273 [2025-04-30 10:28:03,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 270 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 202.83333333333334) internal successors, (1217), 6 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:03,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:03,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 273 [2025-04-30 10:28:03,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:04,360 INFO L116 PetriNetUnfolderBase]: 762/4094 cut-off events. [2025-04-30 10:28:04,361 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:28:04,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5678 conditions, 4094 events. 762/4094 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 31513 event pairs, 460 based on Foata normal form. 0/3734 useless extension candidates. Maximal degree in co-relation 5631. Up to 1372 conditions per place. [2025-04-30 10:28:04,373 INFO L140 encePairwiseOnDemand]: 241/273 looper letters, 81 selfloop transitions, 90 changer transitions 0/370 dead transitions. [2025-04-30 10:28:04,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 370 transitions, 1094 flow [2025-04-30 10:28:04,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2025-04-30 10:28:04,377 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8418803418803419 [2025-04-30 10:28:04,377 INFO L175 Difference]: Start difference. First operand has 277 places, 270 transitions, 552 flow. Second operand 6 states and 1379 transitions. [2025-04-30 10:28:04,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 370 transitions, 1094 flow [2025-04-30 10:28:04,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 370 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:04,384 INFO L231 Difference]: Finished difference. Result has 281 places, 353 transitions, 1118 flow [2025-04-30 10:28:04,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1118, PETRI_PLACES=281, PETRI_TRANSITIONS=353} [2025-04-30 10:28:04,385 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 7 predicate places. [2025-04-30 10:28:04,385 INFO L485 AbstractCegarLoop]: Abstraction has has 281 places, 353 transitions, 1118 flow [2025-04-30 10:28:04,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.83333333333334) internal successors, (1217), 6 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:04,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:04,386 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] [2025-04-30 10:28:04,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:28:04,386 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:04,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:04,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1512683605, now seen corresponding path program 1 times [2025-04-30 10:28:04,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:04,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283724489] [2025-04-30 10:28:04,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:04,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:04,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:28:04,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:28:04,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:04,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:04,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:04,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283724489] [2025-04-30 10:28:04,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283724489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:04,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:04,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:04,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991678308] [2025-04-30 10:28:04,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:04,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:04,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:04,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:04,855 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 273 [2025-04-30 10:28:04,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 353 transitions, 1118 flow. Second operand has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:04,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:04,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 273 [2025-04-30 10:28:04,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:05,797 INFO L116 PetriNetUnfolderBase]: 2110/7422 cut-off events. [2025-04-30 10:28:05,797 INFO L117 PetriNetUnfolderBase]: For 1552/1557 co-relation queries the response was YES. [2025-04-30 10:28:05,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13852 conditions, 7422 events. 2110/7422 cut-off events. For 1552/1557 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 59957 event pairs, 1264 based on Foata normal form. 0/6804 useless extension candidates. Maximal degree in co-relation 13747. Up to 4041 conditions per place. [2025-04-30 10:28:05,822 INFO L140 encePairwiseOnDemand]: 232/273 looper letters, 187 selfloop transitions, 123 changer transitions 0/485 dead transitions. [2025-04-30 10:28:05,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 485 transitions, 2162 flow [2025-04-30 10:28:05,823 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2025-04-30 10:28:05,825 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7881562881562881 [2025-04-30 10:28:05,825 INFO L175 Difference]: Start difference. First operand has 281 places, 353 transitions, 1118 flow. Second operand 6 states and 1291 transitions. [2025-04-30 10:28:05,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 485 transitions, 2162 flow [2025-04-30 10:28:05,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 485 transitions, 2162 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:05,838 INFO L231 Difference]: Finished difference. Result has 290 places, 469 transitions, 2070 flow [2025-04-30 10:28:05,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2070, PETRI_PLACES=290, PETRI_TRANSITIONS=469} [2025-04-30 10:28:05,839 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 16 predicate places. [2025-04-30 10:28:05,840 INFO L485 AbstractCegarLoop]: Abstraction has has 290 places, 469 transitions, 2070 flow [2025-04-30 10:28:05,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:05,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:05,840 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] [2025-04-30 10:28:05,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:28:05,841 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:05,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:05,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1900410785, now seen corresponding path program 1 times [2025-04-30 10:28:05,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:05,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142843312] [2025-04-30 10:28:05,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:05,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:28:05,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:28:05,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:05,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:06,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:06,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142843312] [2025-04-30 10:28:06,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142843312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:06,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:06,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:06,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825956979] [2025-04-30 10:28:06,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:06,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:06,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:06,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:06,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:06,393 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 273 [2025-04-30 10:28:06,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 469 transitions, 2070 flow. Second operand has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:06,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:06,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 273 [2025-04-30 10:28:06,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:07,320 INFO L116 PetriNetUnfolderBase]: 2410/8365 cut-off events. [2025-04-30 10:28:07,321 INFO L117 PetriNetUnfolderBase]: For 3703/3714 co-relation queries the response was YES. [2025-04-30 10:28:07,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17813 conditions, 8365 events. 2410/8365 cut-off events. For 3703/3714 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 68287 event pairs, 1292 based on Foata normal form. 0/7721 useless extension candidates. Maximal degree in co-relation 17694. Up to 4365 conditions per place. [2025-04-30 10:28:07,353 INFO L140 encePairwiseOnDemand]: 232/273 looper letters, 299 selfloop transitions, 123 changer transitions 0/601 dead transitions. [2025-04-30 10:28:07,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 601 transitions, 3562 flow [2025-04-30 10:28:07,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2025-04-30 10:28:07,356 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7881562881562881 [2025-04-30 10:28:07,356 INFO L175 Difference]: Start difference. First operand has 290 places, 469 transitions, 2070 flow. Second operand 6 states and 1291 transitions. [2025-04-30 10:28:07,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 601 transitions, 3562 flow [2025-04-30 10:28:07,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 601 transitions, 3402 flow, removed 80 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:07,371 INFO L231 Difference]: Finished difference. Result has 299 places, 585 transitions, 3086 flow [2025-04-30 10:28:07,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1908, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3086, PETRI_PLACES=299, PETRI_TRANSITIONS=585} [2025-04-30 10:28:07,372 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 25 predicate places. [2025-04-30 10:28:07,372 INFO L485 AbstractCegarLoop]: Abstraction has has 299 places, 585 transitions, 3086 flow [2025-04-30 10:28:07,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:07,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:07,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:07,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:28:07,373 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:07,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:07,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1673401969, now seen corresponding path program 1 times [2025-04-30 10:28:07,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:07,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040995231] [2025-04-30 10:28:07,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:07,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-30 10:28:07,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-30 10:28:07,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:07,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:07,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:07,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040995231] [2025-04-30 10:28:07,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040995231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:07,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:07,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:07,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369035271] [2025-04-30 10:28:07,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:07,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:07,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:07,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:08,103 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 273 [2025-04-30 10:28:08,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 585 transitions, 3086 flow. Second operand has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:08,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:08,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 273 [2025-04-30 10:28:08,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:09,188 INFO L116 PetriNetUnfolderBase]: 2734/9162 cut-off events. [2025-04-30 10:28:09,188 INFO L117 PetriNetUnfolderBase]: For 5360/5426 co-relation queries the response was YES. [2025-04-30 10:28:09,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21659 conditions, 9162 events. 2734/9162 cut-off events. For 5360/5426 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 75178 event pairs, 1246 based on Foata normal form. 0/8495 useless extension candidates. Maximal degree in co-relation 21527. Up to 4881 conditions per place. [2025-04-30 10:28:09,224 INFO L140 encePairwiseOnDemand]: 230/273 looper letters, 360 selfloop transitions, 180 changer transitions 0/768 dead transitions. [2025-04-30 10:28:09,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 768 transitions, 4754 flow [2025-04-30 10:28:09,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1338 transitions. [2025-04-30 10:28:09,226 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8168498168498168 [2025-04-30 10:28:09,226 INFO L175 Difference]: Start difference. First operand has 299 places, 585 transitions, 3086 flow. Second operand 6 states and 1338 transitions. [2025-04-30 10:28:09,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 768 transitions, 4754 flow [2025-04-30 10:28:09,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 768 transitions, 4358 flow, removed 198 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:09,246 INFO L231 Difference]: Finished difference. Result has 309 places, 752 transitions, 4086 flow [2025-04-30 10:28:09,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=2702, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4086, PETRI_PLACES=309, PETRI_TRANSITIONS=752} [2025-04-30 10:28:09,247 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 35 predicate places. [2025-04-30 10:28:09,247 INFO L485 AbstractCegarLoop]: Abstraction has has 309 places, 752 transitions, 4086 flow [2025-04-30 10:28:09,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:09,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:09,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:09,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:28:09,248 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:09,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1877789814, now seen corresponding path program 1 times [2025-04-30 10:28:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:09,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592439440] [2025-04-30 10:28:09,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:09,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:28:09,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:28:09,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:09,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:09,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:09,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592439440] [2025-04-30 10:28:09,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592439440] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:09,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:09,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:09,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399289415] [2025-04-30 10:28:09,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:09,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:09,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:09,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:09,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:09,834 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 273 [2025-04-30 10:28:09,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 752 transitions, 4086 flow. Second operand has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:09,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:09,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 273 [2025-04-30 10:28:09,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:11,094 INFO L116 PetriNetUnfolderBase]: 3192/10515 cut-off events. [2025-04-30 10:28:11,095 INFO L117 PetriNetUnfolderBase]: For 8640/8735 co-relation queries the response was YES. [2025-04-30 10:28:11,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27972 conditions, 10515 events. 3192/10515 cut-off events. For 8640/8735 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 87949 event pairs, 1284 based on Foata normal form. 0/9822 useless extension candidates. Maximal degree in co-relation 27835. Up to 5371 conditions per place. [2025-04-30 10:28:11,142 INFO L140 encePairwiseOnDemand]: 230/273 looper letters, 513 selfloop transitions, 180 changer transitions 0/935 dead transitions. [2025-04-30 10:28:11,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 935 transitions, 6354 flow [2025-04-30 10:28:11,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1338 transitions. [2025-04-30 10:28:11,145 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8168498168498168 [2025-04-30 10:28:11,145 INFO L175 Difference]: Start difference. First operand has 309 places, 752 transitions, 4086 flow. Second operand 6 states and 1338 transitions. [2025-04-30 10:28:11,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 935 transitions, 6354 flow [2025-04-30 10:28:11,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 935 transitions, 6300 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:11,183 INFO L231 Difference]: Finished difference. Result has 319 places, 919 transitions, 5722 flow [2025-04-30 10:28:11,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=4032, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5722, PETRI_PLACES=319, PETRI_TRANSITIONS=919} [2025-04-30 10:28:11,185 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 45 predicate places. [2025-04-30 10:28:11,185 INFO L485 AbstractCegarLoop]: Abstraction has has 319 places, 919 transitions, 5722 flow [2025-04-30 10:28:11,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:11,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:11,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:11,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:28:11,186 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:11,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:11,189 INFO L85 PathProgramCache]: Analyzing trace with hash 482397346, now seen corresponding path program 1 times [2025-04-30 10:28:11,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:11,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358783112] [2025-04-30 10:28:11,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:11,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:11,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-30 10:28:11,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-30 10:28:11,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:11,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:11,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:11,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358783112] [2025-04-30 10:28:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358783112] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:11,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:11,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-30 10:28:11,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103568269] [2025-04-30 10:28:11,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:11,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:28:11,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:11,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:28:11,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:28:13,485 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273 [2025-04-30 10:28:13,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 919 transitions, 5722 flow. Second operand has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:13,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273 [2025-04-30 10:28:13,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:16,751 INFO L116 PetriNetUnfolderBase]: 4080/12657 cut-off events. [2025-04-30 10:28:16,751 INFO L117 PetriNetUnfolderBase]: For 15561/15656 co-relation queries the response was YES. [2025-04-30 10:28:16,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38134 conditions, 12657 events. 4080/12657 cut-off events. For 15561/15656 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 105298 event pairs, 787 based on Foata normal form. 37/12063 useless extension candidates. Maximal degree in co-relation 37985. Up to 4181 conditions per place. [2025-04-30 10:28:16,812 INFO L140 encePairwiseOnDemand]: 216/273 looper letters, 906 selfloop transitions, 252 changer transitions 0/1377 dead transitions. [2025-04-30 10:28:16,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1377 transitions, 10662 flow [2025-04-30 10:28:16,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-30 10:28:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-30 10:28:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4735 transitions. [2025-04-30 10:28:16,821 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6670893209354748 [2025-04-30 10:28:16,821 INFO L175 Difference]: Start difference. First operand has 319 places, 919 transitions, 5722 flow. Second operand 26 states and 4735 transitions. [2025-04-30 10:28:16,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 1377 transitions, 10662 flow [2025-04-30 10:28:16,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 1377 transitions, 10302 flow, removed 180 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:16,900 INFO L231 Difference]: Finished difference. Result has 363 places, 1001 transitions, 6977 flow [2025-04-30 10:28:16,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=5362, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=6977, PETRI_PLACES=363, PETRI_TRANSITIONS=1001} [2025-04-30 10:28:16,901 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 89 predicate places. [2025-04-30 10:28:16,901 INFO L485 AbstractCegarLoop]: Abstraction has has 363 places, 1001 transitions, 6977 flow [2025-04-30 10:28:16,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:16,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:16,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:16,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:28:16,903 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:16,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash 743987164, now seen corresponding path program 2 times [2025-04-30 10:28:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:16,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391703155] [2025-04-30 10:28:16,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:16,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 1 equivalence classes. [2025-04-30 10:28:16,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-30 10:28:16,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:28:16,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:17,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:17,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391703155] [2025-04-30 10:28:17,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391703155] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:17,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:17,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-30 10:28:17,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835999290] [2025-04-30 10:28:17,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:17,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:28:17,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:17,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:28:17,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:28:18,997 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273 [2025-04-30 10:28:18,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 1001 transitions, 6977 flow. Second operand has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:18,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:19,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273 [2025-04-30 10:28:19,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:22,167 INFO L116 PetriNetUnfolderBase]: 5056/15659 cut-off events. [2025-04-30 10:28:22,167 INFO L117 PetriNetUnfolderBase]: For 27005/27310 co-relation queries the response was YES. [2025-04-30 10:28:22,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51560 conditions, 15659 events. 5056/15659 cut-off events. For 27005/27310 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 135578 event pairs, 1282 based on Foata normal form. 51/14943 useless extension candidates. Maximal degree in co-relation 51391. Up to 2883 conditions per place. [2025-04-30 10:28:22,258 INFO L140 encePairwiseOnDemand]: 215/273 looper letters, 1322 selfloop transitions, 193 changer transitions 0/1734 dead transitions. [2025-04-30 10:28:22,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 1734 transitions, 15673 flow [2025-04-30 10:28:22,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:28:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-30 10:28:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3946 transitions. [2025-04-30 10:28:22,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.657009657009657 [2025-04-30 10:28:22,264 INFO L175 Difference]: Start difference. First operand has 363 places, 1001 transitions, 6977 flow. Second operand 22 states and 3946 transitions. [2025-04-30 10:28:22,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 1734 transitions, 15673 flow [2025-04-30 10:28:22,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 1734 transitions, 15420 flow, removed 43 selfloop flow, removed 6 redundant places. [2025-04-30 10:28:22,386 INFO L231 Difference]: Finished difference. Result has 392 places, 1145 transitions, 9013 flow [2025-04-30 10:28:22,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=6826, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1001, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=849, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9013, PETRI_PLACES=392, PETRI_TRANSITIONS=1145} [2025-04-30 10:28:22,390 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 118 predicate places. [2025-04-30 10:28:22,390 INFO L485 AbstractCegarLoop]: Abstraction has has 392 places, 1145 transitions, 9013 flow [2025-04-30 10:28:22,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:22,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:22,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:22,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:28:22,391 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:22,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2127013216, now seen corresponding path program 3 times [2025-04-30 10:28:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:22,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840263040] [2025-04-30 10:28:22,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:28:22,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:22,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 1 equivalence classes. [2025-04-30 10:28:22,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-30 10:28:22,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:28:22,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:22,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:22,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840263040] [2025-04-30 10:28:22,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840263040] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:22,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:22,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-30 10:28:22,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540204238] [2025-04-30 10:28:22,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:22,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:28:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:22,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:28:22,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:28:24,063 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273 [2025-04-30 10:28:24,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 1145 transitions, 9013 flow. Second operand has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:24,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:24,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273 [2025-04-30 10:28:24,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:28,453 INFO L116 PetriNetUnfolderBase]: 5132/15682 cut-off events. [2025-04-30 10:28:28,454 INFO L117 PetriNetUnfolderBase]: For 34522/34803 co-relation queries the response was YES. [2025-04-30 10:28:28,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55029 conditions, 15682 events. 5132/15682 cut-off events. For 34522/34803 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 135510 event pairs, 941 based on Foata normal form. 77/15030 useless extension candidates. Maximal degree in co-relation 54846. Up to 5166 conditions per place. [2025-04-30 10:28:28,607 INFO L140 encePairwiseOnDemand]: 216/273 looper letters, 974 selfloop transitions, 345 changer transitions 0/1538 dead transitions. [2025-04-30 10:28:28,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1538 transitions, 14837 flow [2025-04-30 10:28:28,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:28:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-30 10:28:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3190 transitions. [2025-04-30 10:28:28,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6873518638224521 [2025-04-30 10:28:28,611 INFO L175 Difference]: Start difference. First operand has 392 places, 1145 transitions, 9013 flow. Second operand 17 states and 3190 transitions. [2025-04-30 10:28:28,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 1538 transitions, 14837 flow [2025-04-30 10:28:28,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 1538 transitions, 14578 flow, removed 97 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:28,822 INFO L231 Difference]: Finished difference. Result has 417 places, 1219 transitions, 11185 flow [2025-04-30 10:28:28,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=8862, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=830, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=11185, PETRI_PLACES=417, PETRI_TRANSITIONS=1219} [2025-04-30 10:28:28,824 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 143 predicate places. [2025-04-30 10:28:28,824 INFO L485 AbstractCegarLoop]: Abstraction has has 417 places, 1219 transitions, 11185 flow [2025-04-30 10:28:28,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:28,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:28,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:28,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:28:28,825 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:28,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1823839556, now seen corresponding path program 4 times [2025-04-30 10:28:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:28,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973255481] [2025-04-30 10:28:28,825 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:28:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:28,837 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-04-30 10:28:28,846 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 93 statements. [2025-04-30 10:28:28,847 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:28:28,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:29,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:29,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973255481] [2025-04-30 10:28:29,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973255481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:29,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:29,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-30 10:28:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514888371] [2025-04-30 10:28:29,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:29,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:28:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:29,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:28:29,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:28:30,761 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273 [2025-04-30 10:28:30,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1219 transitions, 11185 flow. Second operand has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:30,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:30,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273 [2025-04-30 10:28:30,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:34,952 INFO L116 PetriNetUnfolderBase]: 6077/18481 cut-off events. [2025-04-30 10:28:34,953 INFO L117 PetriNetUnfolderBase]: For 53430/53886 co-relation queries the response was YES. [2025-04-30 10:28:35,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68843 conditions, 18481 events. 6077/18481 cut-off events. For 53430/53886 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 165341 event pairs, 917 based on Foata normal form. 64/17739 useless extension candidates. Maximal degree in co-relation 68648. Up to 3546 conditions per place. [2025-04-30 10:28:35,063 INFO L140 encePairwiseOnDemand]: 215/273 looper letters, 1397 selfloop transitions, 259 changer transitions 0/1875 dead transitions. [2025-04-30 10:28:35,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 1875 transitions, 20317 flow [2025-04-30 10:28:35,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:28:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:28:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3763 transitions. [2025-04-30 10:28:35,066 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.656375370661085 [2025-04-30 10:28:35,066 INFO L175 Difference]: Start difference. First operand has 417 places, 1219 transitions, 11185 flow. Second operand 21 states and 3763 transitions. [2025-04-30 10:28:35,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 1875 transitions, 20317 flow [2025-04-30 10:28:35,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 1875 transitions, 19986 flow, removed 113 selfloop flow, removed 6 redundant places. [2025-04-30 10:28:35,373 INFO L231 Difference]: Finished difference. Result has 445 places, 1314 transitions, 13378 flow [2025-04-30 10:28:35,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=10976, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=976, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=13378, PETRI_PLACES=445, PETRI_TRANSITIONS=1314} [2025-04-30 10:28:35,374 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 171 predicate places. [2025-04-30 10:28:35,374 INFO L485 AbstractCegarLoop]: Abstraction has has 445 places, 1314 transitions, 13378 flow [2025-04-30 10:28:35,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:35,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:35,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:35,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:28:35,375 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:35,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1466590318, now seen corresponding path program 1 times [2025-04-30 10:28:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:35,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520912489] [2025-04-30 10:28:35,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:35,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:35,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-30 10:28:35,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-30 10:28:35,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:35,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:35,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520912489] [2025-04-30 10:28:35,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520912489] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:35,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836910188] [2025-04-30 10:28:35,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:35,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:35,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:35,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:28:35,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:28:35,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-30 10:28:36,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-30 10:28:36,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:36,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:36,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:28:36,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:36,058 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:28:36,096 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:28:36,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:28:36,119 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:28:36,130 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 21 treesize of output 20 [2025-04-30 10:28:36,142 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:36,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-04-30 10:28:36,157 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:36,158 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-04-30 10:28:36,185 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 43 treesize of output 32 [2025-04-30 10:28:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:36,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:28:36,229 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_755 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|))) (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ 3 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|))) is different from false [2025-04-30 10:28:36,253 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse1 |c_ULTIMATE.start_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_755 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|))) (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) .cse1) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)) |c_ULTIMATE.start_init_#t~nondet30#1|))))) is different from false [2025-04-30 10:28:36,274 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse2 |c_ULTIMATE.start_init_#t~nondet30#1|) .cse1 |c_ULTIMATE.start_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) .cse1) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_755 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)))) (forall ((v_ArrVal_755 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|))) (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) .cse2) |c_ULTIMATE.start_init_#t~nondet30#1|))))) is different from false [2025-04-30 10:28:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:46,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836910188] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:28:46,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:28:46,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-04-30 10:28:46,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38465763] [2025-04-30 10:28:46,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:28:46,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:28:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:46,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:28:46,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=295, Unknown=3, NotChecked=108, Total=462 [2025-04-30 10:28:46,682 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 273 [2025-04-30 10:28:46,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 1314 transitions, 13378 flow. Second operand has 22 states, 22 states have (on average 98.18181818181819) internal successors, (2160), 22 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:46,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:46,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 273 [2025-04-30 10:28:46,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:55,822 INFO L116 PetriNetUnfolderBase]: 12412/30989 cut-off events. [2025-04-30 10:28:55,822 INFO L117 PetriNetUnfolderBase]: For 121657/121689 co-relation queries the response was YES. [2025-04-30 10:28:56,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123200 conditions, 30989 events. 12412/30989 cut-off events. For 121657/121689 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 270976 event pairs, 2848 based on Foata normal form. 45/29333 useless extension candidates. Maximal degree in co-relation 122979. Up to 12981 conditions per place. [2025-04-30 10:28:56,118 INFO L140 encePairwiseOnDemand]: 221/273 looper letters, 2039 selfloop transitions, 254 changer transitions 0/2427 dead transitions. [2025-04-30 10:28:56,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 2427 transitions, 28417 flow [2025-04-30 10:28:56,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:28:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-30 10:28:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2888 transitions. [2025-04-30 10:28:56,121 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48085248085248083 [2025-04-30 10:28:56,122 INFO L175 Difference]: Start difference. First operand has 445 places, 1314 transitions, 13378 flow. Second operand 22 states and 2888 transitions. [2025-04-30 10:28:56,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 2427 transitions, 28417 flow [2025-04-30 10:28:56,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 2427 transitions, 27927 flow, removed 173 selfloop flow, removed 6 redundant places. [2025-04-30 10:28:56,886 INFO L231 Difference]: Finished difference. Result has 475 places, 1470 transitions, 15768 flow [2025-04-30 10:28:56,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=13004, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=15768, PETRI_PLACES=475, PETRI_TRANSITIONS=1470} [2025-04-30 10:28:56,887 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, 201 predicate places. [2025-04-30 10:28:56,887 INFO L485 AbstractCegarLoop]: Abstraction has has 475 places, 1470 transitions, 15768 flow [2025-04-30 10:28:56,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 98.18181818181819) internal successors, (2160), 22 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:56,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:56,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:56,895 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-30 10:28:57,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-30 10:28:57,089 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-30 10:28:57,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:57,090 INFO L85 PathProgramCache]: Analyzing trace with hash 366988368, now seen corresponding path program 5 times [2025-04-30 10:28:57,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:57,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430797655] [2025-04-30 10:28:57,090 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:28:57,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:57,103 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-04-30 10:28:57,109 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-04-30 10:28:57,109 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:28:57,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:57,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430797655] [2025-04-30 10:28:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430797655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:57,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568859835] [2025-04-30 10:28:57,435 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:28:57,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:57,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:28:57,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:28:57,520 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-04-30 10:28:57,550 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-04-30 10:28:57,550 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:28:57,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:57,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:28:57,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:57,559 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:28:57,574 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:28:57,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:28:57,601 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:28:57,609 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 21 treesize of output 20 [2025-04-30 10:28:57,620 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:57,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-04-30 10:28:57,636 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:57,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-04-30 10:28:57,662 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 43 treesize of output 32 [2025-04-30 10:28:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:57,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:28:59,786 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_920 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_920 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_920 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_920 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|))))) is different from false Killed by 15