./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97ad512bc93f35417e0ac00ea14a500e8330bbb73ecd9f9120442ecb7a421418 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:41,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:41,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:08:41,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:41,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:41,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:41,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:41,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:41,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:41,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:41,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:41,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:41,682 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:41,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:41,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:41,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:41,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:41,684 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 -> 97ad512bc93f35417e0ac00ea14a500e8330bbb73ecd9f9120442ecb7a421418 [2025-04-29 11:08:41,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:41,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:41,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:41,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:41,940 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:41,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.c [2025-04-29 11:08:43,240 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfa7ebd5/91955142885b46788ae512ab772b4ca8/FLAG5f10f326b [2025-04-29 11:08:43,436 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:43,436 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.c [2025-04-29 11:08:43,438 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:43,438 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:43,438 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:43,443 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfa7ebd5/91955142885b46788ae512ab772b4ca8/FLAG5f10f326b [2025-04-29 11:08:44,291 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfa7ebd5/91955142885b46788ae512ab772b4ca8 [2025-04-29 11:08:44,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:44,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:44,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:44,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:44,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:44,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da49d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44, skipping insertion in model container [2025-04-29 11:08:44,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:44,470 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:44,481 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:44,511 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:44,521 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:44,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44 WrapperNode [2025-04-29 11:08:44,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:44,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:44,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:44,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:44,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,562 INFO L138 Inliner]: procedures = 15, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2025-04-29 11:08:44,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:44,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:44,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:44,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:44,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,595 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:44,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:44,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:44,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:44,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (1/1) ... [2025-04-29 11:08:44,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:44,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:44,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:08:44,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:08:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-29 11:08:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:08:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:08:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:44,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:44,672 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:44,672 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:44,673 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:08:44,748 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:44,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:45,018 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:45,018 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:45,048 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:45,048 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:45,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:45 BoogieIcfgContainer [2025-04-29 11:08:45,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:45,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:45,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:45,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:45,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:44" (1/3) ... [2025-04-29 11:08:45,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5869abd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:45, skipping insertion in model container [2025-04-29 11:08:45,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:44" (2/3) ... [2025-04-29 11:08:45,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5869abd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:45, skipping insertion in model container [2025-04-29 11:08:45,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:45" (3/3) ... [2025-04-29 11:08:45,058 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.c [2025-04-29 11:08:45,070 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:45,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.c that has 2 procedures, 190 locations, 188 edges, 1 initial locations, 0 loop locations, and 18 error locations. [2025-04-29 11:08:45,073 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:45,155 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:45,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 189 transitions, 382 flow [2025-04-29 11:08:45,257 INFO L116 PetriNetUnfolderBase]: 0/188 cut-off events. [2025-04-29 11:08:45,258 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:45,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 188 events. 0/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 84 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:08:45,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 189 transitions, 382 flow [2025-04-29 11:08:45,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 188 transitions, 379 flow [2025-04-29 11:08:45,271 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:45,284 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;@2ffaa091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:45,285 INFO L341 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-04-29 11:08:45,290 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:45,291 INFO L116 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-04-29 11:08:45,292 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:45,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:45,292 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] [2025-04-29 11:08:45,293 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:45,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1928499, now seen corresponding path program 1 times [2025-04-29 11:08:45,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:45,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565024332] [2025-04-29 11:08:45,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:45,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:45,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:08:45,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:08:45,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:45,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:45,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:45,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565024332] [2025-04-29 11:08:45,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565024332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:45,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:45,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:45,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354446589] [2025-04-29 11:08:45,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:45,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:45,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:45,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:45,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:46,193 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 189 [2025-04-29 11:08:46,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 188 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:46,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:46,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 189 [2025-04-29 11:08:46,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:46,492 INFO L116 PetriNetUnfolderBase]: 220/1012 cut-off events. [2025-04-29 11:08:46,492 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:46,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 1012 events. 220/1012 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5378 event pairs, 220 based on Foata normal form. 0/907 useless extension candidates. Maximal degree in co-relation 1398. Up to 488 conditions per place. [2025-04-29 11:08:46,521 INFO L140 encePairwiseOnDemand]: 177/189 looper letters, 47 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2025-04-29 11:08:46,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 489 flow [2025-04-29 11:08:46,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 839 transitions. [2025-04-29 11:08:46,533 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7398589065255732 [2025-04-29 11:08:46,534 INFO L175 Difference]: Start difference. First operand has 192 places, 188 transitions, 379 flow. Second operand 6 states and 839 transitions. [2025-04-29 11:08:46,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 489 flow [2025-04-29 11:08:46,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 186 transitions, 488 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:46,540 INFO L231 Difference]: Finished difference. Result has 194 places, 186 transitions, 394 flow [2025-04-29 11:08:46,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=194, PETRI_TRANSITIONS=186} [2025-04-29 11:08:46,545 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 2 predicate places. [2025-04-29 11:08:46,545 INFO L485 AbstractCegarLoop]: Abstraction has has 194 places, 186 transitions, 394 flow [2025-04-29 11:08:46,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:46,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:46,545 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] [2025-04-29 11:08:46,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:46,546 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:46,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash 330547799, now seen corresponding path program 1 times [2025-04-29 11:08:46,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:46,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903433322] [2025-04-29 11:08:46,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:46,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:08:46,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:08:46,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:46,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:46,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903433322] [2025-04-29 11:08:46,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903433322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:46,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:46,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:46,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291510538] [2025-04-29 11:08:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:46,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:46,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:46,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:46,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:47,098 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 189 [2025-04-29 11:08:47,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 186 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:47,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:47,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 189 [2025-04-29 11:08:47,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:47,278 INFO L116 PetriNetUnfolderBase]: 220/1010 cut-off events. [2025-04-29 11:08:47,279 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:47,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 1010 events. 220/1010 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5354 event pairs, 220 based on Foata normal form. 0/907 useless extension candidates. Maximal degree in co-relation 1439. Up to 488 conditions per place. [2025-04-29 11:08:47,283 INFO L140 encePairwiseOnDemand]: 177/189 looper letters, 47 selfloop transitions, 10 changer transitions 0/184 dead transitions. [2025-04-29 11:08:47,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 184 transitions, 504 flow [2025-04-29 11:08:47,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 839 transitions. [2025-04-29 11:08:47,286 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7398589065255732 [2025-04-29 11:08:47,286 INFO L175 Difference]: Start difference. First operand has 194 places, 186 transitions, 394 flow. Second operand 6 states and 839 transitions. [2025-04-29 11:08:47,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 184 transitions, 504 flow [2025-04-29 11:08:47,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 184 transitions, 484 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:47,290 INFO L231 Difference]: Finished difference. Result has 192 places, 184 transitions, 390 flow [2025-04-29 11:08:47,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=192, PETRI_TRANSITIONS=184} [2025-04-29 11:08:47,291 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 0 predicate places. [2025-04-29 11:08:47,291 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 184 transitions, 390 flow [2025-04-29 11:08:47,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:47,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:47,292 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] [2025-04-29 11:08:47,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:08:47,292 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:47,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1832852525, now seen corresponding path program 1 times [2025-04-29 11:08:47,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:47,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737478903] [2025-04-29 11:08:47,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:47,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:47,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:08:47,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:08:47,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:47,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:47,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:47,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737478903] [2025-04-29 11:08:47,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737478903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:47,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:47,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:47,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860091414] [2025-04-29 11:08:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:47,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:47,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:47,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:47,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:47,362 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 189 [2025-04-29 11:08:47,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 184 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:47,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:47,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 189 [2025-04-29 11:08:47,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:47,403 INFO L116 PetriNetUnfolderBase]: 16/319 cut-off events. [2025-04-29 11:08:47,403 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:47,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 319 events. 16/319 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 759 event pairs, 16 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 298. Up to 47 conditions per place. [2025-04-29 11:08:47,404 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 14 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-04-29 11:08:47,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 183 transitions, 420 flow [2025-04-29 11:08:47,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2025-04-29 11:08:47,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9400352733686067 [2025-04-29 11:08:47,406 INFO L175 Difference]: Start difference. First operand has 192 places, 184 transitions, 390 flow. Second operand 3 states and 533 transitions. [2025-04-29 11:08:47,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 183 transitions, 420 flow [2025-04-29 11:08:47,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 183 transitions, 400 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:47,409 INFO L231 Difference]: Finished difference. Result has 188 places, 183 transitions, 372 flow [2025-04-29 11:08:47,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=188, PETRI_TRANSITIONS=183} [2025-04-29 11:08:47,409 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -4 predicate places. [2025-04-29 11:08:47,409 INFO L485 AbstractCegarLoop]: Abstraction has has 188 places, 183 transitions, 372 flow [2025-04-29 11:08:47,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:47,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:47,410 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] [2025-04-29 11:08:47,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:47,410 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:47,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:47,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1109869208, now seen corresponding path program 1 times [2025-04-29 11:08:47,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:47,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313261811] [2025-04-29 11:08:47,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:47,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:47,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:08:47,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:08:47,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:47,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:47,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:47,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313261811] [2025-04-29 11:08:47,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313261811] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:47,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:47,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:47,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572119752] [2025-04-29 11:08:47,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:47,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:47,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:47,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:47,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:47,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 189 [2025-04-29 11:08:47,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 183 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:47,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:47,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 189 [2025-04-29 11:08:47,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:47,503 INFO L116 PetriNetUnfolderBase]: 24/396 cut-off events. [2025-04-29 11:08:47,504 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:47,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 396 events. 24/396 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1203 event pairs, 24 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 419. Up to 63 conditions per place. [2025-04-29 11:08:47,506 INFO L140 encePairwiseOnDemand]: 183/189 looper letters, 15 selfloop transitions, 1 changer transitions 0/178 dead transitions. [2025-04-29 11:08:47,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 178 transitions, 394 flow [2025-04-29 11:08:47,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2025-04-29 11:08:47,508 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-04-29 11:08:47,508 INFO L175 Difference]: Start difference. First operand has 188 places, 183 transitions, 372 flow. Second operand 3 states and 525 transitions. [2025-04-29 11:08:47,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 178 transitions, 394 flow [2025-04-29 11:08:47,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 178 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:47,510 INFO L231 Difference]: Finished difference. Result has 183 places, 178 transitions, 360 flow [2025-04-29 11:08:47,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=183, PETRI_TRANSITIONS=178} [2025-04-29 11:08:47,514 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -9 predicate places. [2025-04-29 11:08:47,514 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 178 transitions, 360 flow [2025-04-29 11:08:47,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:47,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:47,515 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] [2025-04-29 11:08:47,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:08:47,515 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:47,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash 847096973, now seen corresponding path program 1 times [2025-04-29 11:08:47,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:47,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491172583] [2025-04-29 11:08:47,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:47,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:47,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-29 11:08:47,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 11:08:47,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:47,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:47,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:47,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491172583] [2025-04-29 11:08:47,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491172583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:47,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:47,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:47,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778301298] [2025-04-29 11:08:47,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:47,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:47,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:47,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:47,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:48,111 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 189 [2025-04-29 11:08:48,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 178 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:48,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:48,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 189 [2025-04-29 11:08:48,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:48,192 INFO L116 PetriNetUnfolderBase]: 288/1149 cut-off events. [2025-04-29 11:08:48,193 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:48,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 1149 events. 288/1149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6323 event pairs, 288 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1736. Up to 635 conditions per place. [2025-04-29 11:08:48,196 INFO L140 encePairwiseOnDemand]: 183/189 looper letters, 58 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2025-04-29 11:08:48,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 177 transitions, 484 flow [2025-04-29 11:08:48,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 814 transitions. [2025-04-29 11:08:48,198 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7178130511463845 [2025-04-29 11:08:48,198 INFO L175 Difference]: Start difference. First operand has 183 places, 178 transitions, 360 flow. Second operand 6 states and 814 transitions. [2025-04-29 11:08:48,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 177 transitions, 484 flow [2025-04-29 11:08:48,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 177 transitions, 483 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:48,200 INFO L231 Difference]: Finished difference. Result has 186 places, 177 transitions, 367 flow [2025-04-29 11:08:48,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=186, PETRI_TRANSITIONS=177} [2025-04-29 11:08:48,201 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -6 predicate places. [2025-04-29 11:08:48,201 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 177 transitions, 367 flow [2025-04-29 11:08:48,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:48,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:48,202 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] [2025-04-29 11:08:48,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:48,202 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:48,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash 698172555, now seen corresponding path program 1 times [2025-04-29 11:08:48,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:48,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913524352] [2025-04-29 11:08:48,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:48,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-29 11:08:48,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-29 11:08:48,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:48,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:48,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:48,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913524352] [2025-04-29 11:08:48,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913524352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:48,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:48,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534489576] [2025-04-29 11:08:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:48,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:48,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:48,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:48,804 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 189 [2025-04-29 11:08:48,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 177 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:48,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:48,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 189 [2025-04-29 11:08:48,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:49,150 INFO L116 PetriNetUnfolderBase]: 316/1469 cut-off events. [2025-04-29 11:08:49,150 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:49,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 1469 events. 316/1469 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9056 event pairs, 32 based on Foata normal form. 0/1378 useless extension candidates. Maximal degree in co-relation 2148. Up to 380 conditions per place. [2025-04-29 11:08:49,154 INFO L140 encePairwiseOnDemand]: 161/189 looper letters, 99 selfloop transitions, 70 changer transitions 0/289 dead transitions. [2025-04-29 11:08:49,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 289 transitions, 929 flow [2025-04-29 11:08:49,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 963 transitions. [2025-04-29 11:08:49,157 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2025-04-29 11:08:49,157 INFO L175 Difference]: Start difference. First operand has 186 places, 177 transitions, 367 flow. Second operand 6 states and 963 transitions. [2025-04-29 11:08:49,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 289 transitions, 929 flow [2025-04-29 11:08:49,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 289 transitions, 919 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:49,163 INFO L231 Difference]: Finished difference. Result has 190 places, 247 transitions, 835 flow [2025-04-29 11:08:49,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=835, PETRI_PLACES=190, PETRI_TRANSITIONS=247} [2025-04-29 11:08:49,164 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -2 predicate places. [2025-04-29 11:08:49,164 INFO L485 AbstractCegarLoop]: Abstraction has has 190 places, 247 transitions, 835 flow [2025-04-29 11:08:49,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:49,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:49,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:49,165 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:08:49,165 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:49,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:49,166 INFO L85 PathProgramCache]: Analyzing trace with hash 126703214, now seen corresponding path program 1 times [2025-04-29 11:08:49,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:49,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301725620] [2025-04-29 11:08:49,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:49,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:49,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-29 11:08:49,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-29 11:08:49,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:49,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:49,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:49,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301725620] [2025-04-29 11:08:49,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301725620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:49,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:49,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098866818] [2025-04-29 11:08:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:49,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:49,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:49,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:49,649 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 189 [2025-04-29 11:08:49,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 247 transitions, 835 flow. Second operand has 6 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:49,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:49,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 189 [2025-04-29 11:08:49,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:49,966 INFO L116 PetriNetUnfolderBase]: 588/2246 cut-off events. [2025-04-29 11:08:49,967 INFO L117 PetriNetUnfolderBase]: For 602/608 co-relation queries the response was YES. [2025-04-29 11:08:49,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4635 conditions, 2246 events. 588/2246 cut-off events. For 602/608 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15113 event pairs, 222 based on Foata normal form. 0/2135 useless extension candidates. Maximal degree in co-relation 4576. Up to 1082 conditions per place. [2025-04-29 11:08:49,977 INFO L140 encePairwiseOnDemand]: 174/189 looper letters, 106 selfloop transitions, 48 changer transitions 0/298 dead transitions. [2025-04-29 11:08:49,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 298 transitions, 1315 flow [2025-04-29 11:08:49,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 900 transitions. [2025-04-29 11:08:49,980 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7936507936507936 [2025-04-29 11:08:49,980 INFO L175 Difference]: Start difference. First operand has 190 places, 247 transitions, 835 flow. Second operand 6 states and 900 transitions. [2025-04-29 11:08:49,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 298 transitions, 1315 flow [2025-04-29 11:08:49,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 298 transitions, 1315 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:49,990 INFO L231 Difference]: Finished difference. Result has 200 places, 290 transitions, 1223 flow [2025-04-29 11:08:49,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1223, PETRI_PLACES=200, PETRI_TRANSITIONS=290} [2025-04-29 11:08:49,992 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 8 predicate places. [2025-04-29 11:08:49,993 INFO L485 AbstractCegarLoop]: Abstraction has has 200 places, 290 transitions, 1223 flow [2025-04-29 11:08:49,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:49,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:49,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:49,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:08:49,994 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:49,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash 533987184, now seen corresponding path program 1 times [2025-04-29 11:08:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:49,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935483012] [2025-04-29 11:08:49,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:50,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-29 11:08:50,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-29 11:08:50,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:50,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:08:50,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:50,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935483012] [2025-04-29 11:08:50,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935483012] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:50,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:50,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:50,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566819001] [2025-04-29 11:08:50,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:50,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:50,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:50,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:50,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:50,529 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 189 [2025-04-29 11:08:50,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 290 transitions, 1223 flow. Second operand has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:50,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:50,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 189 [2025-04-29 11:08:50,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:50,909 INFO L116 PetriNetUnfolderBase]: 743/2807 cut-off events. [2025-04-29 11:08:50,909 INFO L117 PetriNetUnfolderBase]: For 1665/1727 co-relation queries the response was YES. [2025-04-29 11:08:50,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6587 conditions, 2807 events. 743/2807 cut-off events. For 1665/1727 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 20318 event pairs, 86 based on Foata normal form. 0/2711 useless extension candidates. Maximal degree in co-relation 6521. Up to 1023 conditions per place. [2025-04-29 11:08:50,924 INFO L140 encePairwiseOnDemand]: 166/189 looper letters, 128 selfloop transitions, 136 changer transitions 4/430 dead transitions. [2025-04-29 11:08:50,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 430 transitions, 2515 flow [2025-04-29 11:08:50,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 958 transitions. [2025-04-29 11:08:50,927 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8447971781305115 [2025-04-29 11:08:50,927 INFO L175 Difference]: Start difference. First operand has 200 places, 290 transitions, 1223 flow. Second operand 6 states and 958 transitions. [2025-04-29 11:08:50,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 430 transitions, 2515 flow [2025-04-29 11:08:50,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 430 transitions, 2497 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:50,945 INFO L231 Difference]: Finished difference. Result has 210 places, 421 transitions, 2571 flow [2025-04-29 11:08:50,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2571, PETRI_PLACES=210, PETRI_TRANSITIONS=421} [2025-04-29 11:08:50,946 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 18 predicate places. [2025-04-29 11:08:50,947 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 421 transitions, 2571 flow [2025-04-29 11:08:50,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:50,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:50,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:50,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:50,948 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:50,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash 583096197, now seen corresponding path program 1 times [2025-04-29 11:08:50,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:50,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268477456] [2025-04-29 11:08:50,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:50,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-29 11:08:50,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:08:50,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:50,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:08:51,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:51,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268477456] [2025-04-29 11:08:51,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268477456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:51,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:51,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:08:51,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864369762] [2025-04-29 11:08:51,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:51,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:08:51,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:51,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:08:51,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:08:52,408 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 189 [2025-04-29 11:08:52,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 421 transitions, 2571 flow. Second operand has 13 states, 13 states have (on average 123.07692307692308) internal successors, (1600), 13 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:52,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:52,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 189 [2025-04-29 11:08:52,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:53,364 INFO L116 PetriNetUnfolderBase]: 1151/4110 cut-off events. [2025-04-29 11:08:53,365 INFO L117 PetriNetUnfolderBase]: For 5346/5449 co-relation queries the response was YES. [2025-04-29 11:08:53,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11876 conditions, 4110 events. 1151/4110 cut-off events. For 5346/5449 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 32926 event pairs, 78 based on Foata normal form. 35/4050 useless extension candidates. Maximal degree in co-relation 11802. Up to 880 conditions per place. [2025-04-29 11:08:53,392 INFO L140 encePairwiseOnDemand]: 152/189 looper letters, 349 selfloop transitions, 159 changer transitions 4/645 dead transitions. [2025-04-29 11:08:53,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 645 transitions, 5011 flow [2025-04-29 11:08:53,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:08:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:08:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1937 transitions. [2025-04-29 11:08:53,396 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7320483749055178 [2025-04-29 11:08:53,396 INFO L175 Difference]: Start difference. First operand has 210 places, 421 transitions, 2571 flow. Second operand 14 states and 1937 transitions. [2025-04-29 11:08:53,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 645 transitions, 5011 flow [2025-04-29 11:08:53,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 645 transitions, 4939 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:53,420 INFO L231 Difference]: Finished difference. Result has 233 places, 484 transitions, 3844 flow [2025-04-29 11:08:53,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2535, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3844, PETRI_PLACES=233, PETRI_TRANSITIONS=484} [2025-04-29 11:08:53,421 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 41 predicate places. [2025-04-29 11:08:53,421 INFO L485 AbstractCegarLoop]: Abstraction has has 233 places, 484 transitions, 3844 flow [2025-04-29 11:08:53,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 123.07692307692308) internal successors, (1600), 13 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:53,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:53,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:53,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:08:53,422 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:53,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash 522251141, now seen corresponding path program 2 times [2025-04-29 11:08:53,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:53,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057667796] [2025-04-29 11:08:53,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:53,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:53,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-04-29 11:08:53,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 104 statements. [2025-04-29 11:08:53,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:53,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:08:53,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:53,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057667796] [2025-04-29 11:08:53,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057667796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:53,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:53,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:08:53,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701706043] [2025-04-29 11:08:53,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:53,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:08:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:53,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:08:53,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:08:54,719 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 189 [2025-04-29 11:08:54,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 484 transitions, 3844 flow. Second operand has 13 states, 13 states have (on average 123.07692307692308) internal successors, (1600), 13 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:54,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:54,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 189 [2025-04-29 11:08:54,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:55,726 INFO L116 PetriNetUnfolderBase]: 1253/4550 cut-off events. [2025-04-29 11:08:55,727 INFO L117 PetriNetUnfolderBase]: For 9595/9694 co-relation queries the response was YES. [2025-04-29 11:08:55,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14510 conditions, 4550 events. 1253/4550 cut-off events. For 9595/9694 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 37090 event pairs, 101 based on Foata normal form. 37/4471 useless extension candidates. Maximal degree in co-relation 14422. Up to 891 conditions per place. [2025-04-29 11:08:55,758 INFO L140 encePairwiseOnDemand]: 168/189 looper letters, 440 selfloop transitions, 103 changer transitions 0/676 dead transitions. [2025-04-29 11:08:55,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 676 transitions, 6388 flow [2025-04-29 11:08:55,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:08:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-29 11:08:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2464 transitions. [2025-04-29 11:08:55,764 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6861598440545809 [2025-04-29 11:08:55,764 INFO L175 Difference]: Start difference. First operand has 233 places, 484 transitions, 3844 flow. Second operand 19 states and 2464 transitions. [2025-04-29 11:08:55,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 676 transitions, 6388 flow [2025-04-29 11:08:55,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 676 transitions, 6383 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:08:55,803 INFO L231 Difference]: Finished difference. Result has 257 places, 539 transitions, 4659 flow [2025-04-29 11:08:55,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=3839, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4659, PETRI_PLACES=257, PETRI_TRANSITIONS=539} [2025-04-29 11:08:55,804 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 65 predicate places. [2025-04-29 11:08:55,804 INFO L485 AbstractCegarLoop]: Abstraction has has 257 places, 539 transitions, 4659 flow [2025-04-29 11:08:55,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 123.07692307692308) internal successors, (1600), 13 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:55,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:55,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:55,805 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:08:55,805 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:55,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1894063621, now seen corresponding path program 3 times [2025-04-29 11:08:55,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:55,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764709947] [2025-04-29 11:08:55,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:08:55,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:55,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 2 equivalence classes. [2025-04-29 11:08:55,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 102 of 104 statements. [2025-04-29 11:08:55,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:08:55,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:08:56,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:56,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764709947] [2025-04-29 11:08:56,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764709947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:56,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:56,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:08:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281249904] [2025-04-29 11:08:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:56,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:08:56,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:56,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:08:56,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:08:56,847 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 189 [2025-04-29 11:08:56,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 539 transitions, 4659 flow. Second operand has 13 states, 13 states have (on average 123.07692307692308) internal successors, (1600), 13 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:56,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:56,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 189 [2025-04-29 11:08:56,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:58,133 INFO L116 PetriNetUnfolderBase]: 1791/6397 cut-off events. [2025-04-29 11:08:58,133 INFO L117 PetriNetUnfolderBase]: For 17599/17794 co-relation queries the response was YES. [2025-04-29 11:08:58,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21698 conditions, 6397 events. 1791/6397 cut-off events. For 17599/17794 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 57918 event pairs, 127 based on Foata normal form. 52/6273 useless extension candidates. Maximal degree in co-relation 21600. Up to 1298 conditions per place. [2025-04-29 11:08:58,233 INFO L140 encePairwiseOnDemand]: 156/189 looper letters, 450 selfloop transitions, 226 changer transitions 3/812 dead transitions. [2025-04-29 11:08:58,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 812 transitions, 8467 flow [2025-04-29 11:08:58,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:08:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-29 11:08:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2660 transitions. [2025-04-29 11:08:58,237 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2025-04-29 11:08:58,237 INFO L175 Difference]: Start difference. First operand has 257 places, 539 transitions, 4659 flow. Second operand 20 states and 2660 transitions. [2025-04-29 11:08:58,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 812 transitions, 8467 flow [2025-04-29 11:08:58,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 812 transitions, 8431 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:58,287 INFO L231 Difference]: Finished difference. Result has 282 places, 633 transitions, 6866 flow [2025-04-29 11:08:58,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=4633, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6866, PETRI_PLACES=282, PETRI_TRANSITIONS=633} [2025-04-29 11:08:58,288 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 90 predicate places. [2025-04-29 11:08:58,288 INFO L485 AbstractCegarLoop]: Abstraction has has 282 places, 633 transitions, 6866 flow [2025-04-29 11:08:58,289 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 123.07692307692308) internal successors, (1600), 13 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:58,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:58,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:58,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:08:58,289 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:08:58,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2112094937, now seen corresponding path program 4 times [2025-04-29 11:08:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:58,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761683168] [2025-04-29 11:08:58,290 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:08:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:58,304 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 104 statements into 2 equivalence classes. [2025-04-29 11:08:58,313 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:08:58,314 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:08:58,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:08:58,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:58,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761683168] [2025-04-29 11:08:58,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761683168] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:58,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877661873] [2025-04-29 11:08:58,660 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:08:58,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:58,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:58,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:58,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:08:58,739 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 104 statements into 2 equivalence classes. [2025-04-29 11:08:58,774 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:08:58,775 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:08:58,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:58,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:08:58,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:58,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:08:58,891 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:08:58,892 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:08:58,908 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 13 treesize of output 9 [2025-04-29 11:08:58,917 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 23 treesize of output 22 [2025-04-29 11:08:58,929 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:08:58,929 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 32 treesize of output 34 [2025-04-29 11:08:58,947 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:08:58,947 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 41 treesize of output 46 [2025-04-29 11:08:59,093 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 45 treesize of output 34 [2025-04-29 11:08:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:08:59,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:59,128 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 4)) 0))) is different from false [2025-04-29 11:08:59,184 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 7)) 0))) is different from false [2025-04-29 11:08:59,204 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 6)) 0))) is different from false [2025-04-29 11:08:59,233 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 4)) 0))) is different from false [2025-04-29 11:08:59,249 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_929) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_929 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_929) c_~A~0.base) (+ c_~A~0.offset 5)) 0))))) is different from false [2025-04-29 11:09:02,871 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:02,871 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-04-29 11:09:02,880 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:02,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2025-04-29 11:09:02,891 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:02,892 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:02,899 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:02,899 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:02,908 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:02,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:02,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877661873] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:02,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:02,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2025-04-29 11:09:02,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420131344] [2025-04-29 11:09:02,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:02,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:09:02,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:02,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:09:02,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=199, Unknown=29, NotChecked=170, Total=462 [2025-04-29 11:09:03,220 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 189 [2025-04-29 11:09:03,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 633 transitions, 6866 flow. Second operand has 22 states, 22 states have (on average 90.81818181818181) internal successors, (1998), 22 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:03,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:03,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 189 [2025-04-29 11:09:03,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:06,129 INFO L116 PetriNetUnfolderBase]: 4662/13165 cut-off events. [2025-04-29 11:09:06,129 INFO L117 PetriNetUnfolderBase]: For 46434/46660 co-relation queries the response was YES. [2025-04-29 11:09:06,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48984 conditions, 13165 events. 4662/13165 cut-off events. For 46434/46660 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 126234 event pairs, 1220 based on Foata normal form. 61/12838 useless extension candidates. Maximal degree in co-relation 48869. Up to 5385 conditions per place. [2025-04-29 11:09:06,218 INFO L140 encePairwiseOnDemand]: 156/189 looper letters, 614 selfloop transitions, 272 changer transitions 2/969 dead transitions. [2025-04-29 11:09:06,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 969 transitions, 12136 flow [2025-04-29 11:09:06,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:09:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 11:09:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1549 transitions. [2025-04-29 11:09:06,222 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.546384479717813 [2025-04-29 11:09:06,222 INFO L175 Difference]: Start difference. First operand has 282 places, 633 transitions, 6866 flow. Second operand 15 states and 1549 transitions. [2025-04-29 11:09:06,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 969 transitions, 12136 flow [2025-04-29 11:09:06,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 969 transitions, 12088 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-04-29 11:09:06,375 INFO L231 Difference]: Finished difference. Result has 299 places, 748 transitions, 9926 flow [2025-04-29 11:09:06,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=6824, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=9926, PETRI_PLACES=299, PETRI_TRANSITIONS=748} [2025-04-29 11:09:06,377 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 107 predicate places. [2025-04-29 11:09:06,377 INFO L485 AbstractCegarLoop]: Abstraction has has 299 places, 748 transitions, 9926 flow [2025-04-29 11:09:06,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 90.81818181818181) internal successors, (1998), 22 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:06,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:06,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:06,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:06,578 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,SelfDestructingSolverStorable11 [2025-04-29 11:09:06,579 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:09:06,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:06,579 INFO L85 PathProgramCache]: Analyzing trace with hash 67876159, now seen corresponding path program 5 times [2025-04-29 11:09:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:06,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591850031] [2025-04-29 11:09:06,580 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:09:06,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:06,594 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 104 statements into 3 equivalence classes. [2025-04-29 11:09:06,606 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:09:06,606 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-29 11:09:06,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:07,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:07,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591850031] [2025-04-29 11:09:07,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591850031] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:07,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135465212] [2025-04-29 11:09:07,035 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:09:07,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:07,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:07,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:07,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:09:07,120 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 104 statements into 3 equivalence classes. [2025-04-29 11:09:07,178 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:09:07,178 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-29 11:09:07,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:07,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:09:07,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:07,187 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:09:07,242 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:07,242 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:09:07,257 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 13 treesize of output 9 [2025-04-29 11:09:07,273 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 23 treesize of output 22 [2025-04-29 11:09:07,282 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:07,282 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 32 treesize of output 34 [2025-04-29 11:09:07,294 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:07,294 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 41 treesize of output 46 [2025-04-29 11:09:07,306 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 45 treesize of output 34 [2025-04-29 11:09:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:07,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:07,326 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) (+ c_~A~0.offset 5)) 0))) is different from false [2025-04-29 11:09:07,337 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1126 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) .cse1))) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) (+ c_~A~0.offset 5)) 0))))) is different from false [2025-04-29 11:09:07,352 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 6)) (.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) .cse2))) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) (+ c_~A~0.offset 5)) 0))))) is different from false [2025-04-29 11:09:07,362 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 5)) (.cse3 (+ c_~A~0.offset 6)) (.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1126) c_~A~0.base) .cse3) 0))))) is different from false [2025-04-29 11:09:07,406 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 5)) (.cse1 (+ c_~A~0.offset 6)) (.cse3 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1126) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1126) c_~A~0.base) .cse2))) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1126) c_~A~0.base) .cse3) 0)) (forall ((v_ArrVal_1126 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1126) c_~A~0.base) (+ c_~A~0.offset 4)) 0))))) is different from false [2025-04-29 11:09:07,418 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:07,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-04-29 11:09:07,422 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:07,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2025-04-29 11:09:07,429 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:07,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:07,433 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:07,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:07,437 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:07,437 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:07,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135465212] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:07,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:07,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2025-04-29 11:09:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829134302] [2025-04-29 11:09:07,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:07,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:09:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:07,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:09:07,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=178, Unknown=5, NotChecked=150, Total=380 [2025-04-29 11:09:07,514 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 189 [2025-04-29 11:09:07,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 748 transitions, 9926 flow. Second operand has 20 states, 20 states have (on average 91.0) internal successors, (1820), 20 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:07,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:07,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 189 [2025-04-29 11:09:07,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:11,516 INFO L116 PetriNetUnfolderBase]: 6334/17645 cut-off events. [2025-04-29 11:09:11,516 INFO L117 PetriNetUnfolderBase]: For 78289/78570 co-relation queries the response was YES. [2025-04-29 11:09:11,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68614 conditions, 17645 events. 6334/17645 cut-off events. For 78289/78570 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 180589 event pairs, 1150 based on Foata normal form. 73/17216 useless extension candidates. Maximal degree in co-relation 68489. Up to 3726 conditions per place. [2025-04-29 11:09:11,700 INFO L140 encePairwiseOnDemand]: 160/189 looper letters, 721 selfloop transitions, 392 changer transitions 0/1194 dead transitions. [2025-04-29 11:09:11,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 1194 transitions, 17036 flow [2025-04-29 11:09:11,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:09:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-29 11:09:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1975 transitions. [2025-04-29 11:09:11,704 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5499860763018658 [2025-04-29 11:09:11,704 INFO L175 Difference]: Start difference. First operand has 299 places, 748 transitions, 9926 flow. Second operand 19 states and 1975 transitions. [2025-04-29 11:09:11,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 1194 transitions, 17036 flow [2025-04-29 11:09:12,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 1194 transitions, 16953 flow, removed 39 selfloop flow, removed 3 redundant places. [2025-04-29 11:09:12,037 INFO L231 Difference]: Finished difference. Result has 323 places, 868 transitions, 13814 flow [2025-04-29 11:09:12,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=9885, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=13814, PETRI_PLACES=323, PETRI_TRANSITIONS=868} [2025-04-29 11:09:12,038 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 131 predicate places. [2025-04-29 11:09:12,038 INFO L485 AbstractCegarLoop]: Abstraction has has 323 places, 868 transitions, 13814 flow [2025-04-29 11:09:12,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 91.0) internal successors, (1820), 20 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:12,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:12,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:12,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:09:12,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 11:09:12,240 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:09:12,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2050671079, now seen corresponding path program 6 times [2025-04-29 11:09:12,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:12,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781995614] [2025-04-29 11:09:12,241 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:09:12,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:12,252 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 3 equivalence classes. [2025-04-29 11:09:12,272 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:09:12,272 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-29 11:09:12,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:12,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:12,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781995614] [2025-04-29 11:09:12,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781995614] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:12,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937843244] [2025-04-29 11:09:12,742 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:09:12,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:12,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:12,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:12,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:09:12,827 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 3 equivalence classes. [2025-04-29 11:09:13,214 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:09:13,214 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-29 11:09:13,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:13,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-29 11:09:13,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:13,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:09:13,390 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:09:13,411 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 19 treesize of output 18 [2025-04-29 11:09:13,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:09:13,483 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:13,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:09:13,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-04-29 11:09:13,678 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 37 treesize of output 26 [2025-04-29 11:09:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:13,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:13,719 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 7)) 0))) is different from false [2025-04-29 11:09:13,744 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 7)) 0))) is different from false [2025-04-29 11:09:13,831 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 6)) 0))) is different from false [2025-04-29 11:09:13,844 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_1323) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1323 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc2#1.base| v_ArrVal_1323) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-04-29 11:09:14,161 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:14,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-04-29 11:09:14,165 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:14,166 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2025-04-29 11:09:14,167 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 11:09:14,173 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:14,173 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:14,177 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:14,177 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:14,182 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:14,182 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2025-04-29 11:09:22,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937843244] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:22,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:22,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 36 [2025-04-29 11:09:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772575915] [2025-04-29 11:09:22,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:22,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-29 11:09:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:22,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-29 11:09:22,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=905, Unknown=26, NotChecked=260, Total=1332 [2025-04-29 11:09:22,117 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 189 [2025-04-29 11:09:22,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 868 transitions, 13814 flow. Second operand has 37 states, 37 states have (on average 81.72972972972973) internal successors, (3024), 37 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:22,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:22,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 189 [2025-04-29 11:09:22,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:28,994 INFO L116 PetriNetUnfolderBase]: 9154/24820 cut-off events. [2025-04-29 11:09:28,994 INFO L117 PetriNetUnfolderBase]: For 138104/138406 co-relation queries the response was YES. [2025-04-29 11:09:29,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99369 conditions, 24820 events. 9154/24820 cut-off events. For 138104/138406 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 265674 event pairs, 1293 based on Foata normal form. 118/24271 useless extension candidates. Maximal degree in co-relation 99229. Up to 5668 conditions per place. [2025-04-29 11:09:29,267 INFO L140 encePairwiseOnDemand]: 144/189 looper letters, 944 selfloop transitions, 560 changer transitions 10/1586 dead transitions. [2025-04-29 11:09:29,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 1586 transitions, 25497 flow [2025-04-29 11:09:29,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:09:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:09:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2880 transitions. [2025-04-29 11:09:29,270 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2025-04-29 11:09:29,271 INFO L175 Difference]: Start difference. First operand has 323 places, 868 transitions, 13814 flow. Second operand 30 states and 2880 transitions. [2025-04-29 11:09:29,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 1586 transitions, 25497 flow [2025-04-29 11:09:29,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 1586 transitions, 25307 flow, removed 45 selfloop flow, removed 9 redundant places. [2025-04-29 11:09:29,914 INFO L231 Difference]: Finished difference. Result has 364 places, 1087 transitions, 20728 flow [2025-04-29 11:09:29,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=13675, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=868, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=346, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=20728, PETRI_PLACES=364, PETRI_TRANSITIONS=1087} [2025-04-29 11:09:29,914 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 172 predicate places. [2025-04-29 11:09:29,914 INFO L485 AbstractCegarLoop]: Abstraction has has 364 places, 1087 transitions, 20728 flow [2025-04-29 11:09:29,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 81.72972972972973) internal successors, (3024), 37 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:29,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:29,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:29,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:09:30,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:30,116 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:09:30,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 33931886, now seen corresponding path program 1 times [2025-04-29 11:09:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:30,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8663333] [2025-04-29 11:09:30,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:30,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-29 11:09:30,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:09:30,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:30,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:30,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:30,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8663333] [2025-04-29 11:09:30,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8663333] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:30,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766023943] [2025-04-29 11:09:30,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:30,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:30,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:30,560 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:30,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:09:30,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-29 11:09:30,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:09:30,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:30,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:30,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:09:30,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:30,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:09:30,770 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:30,771 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:09:30,784 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-29 11:09:30,792 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-29 11:09:30,803 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:30,803 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-29 11:09:30,821 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:30,821 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-29 11:09:30,839 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-29 11:09:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:30,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:30,866 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1519 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet0#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1519) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1519 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet0#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1519) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_1519 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet0#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1519) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3)))) (forall ((v_ArrVal_1519 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1519) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet0#1|))) is different from false [2025-04-29 11:09:30,878 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~nondet0#1|)))) (and (forall ((v_ArrVal_1519 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1519) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) |c_t_funThread1of1ForFork0_init_#t~nondet0#1|)) (forall ((v_ArrVal_1519 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1519) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet0#1|)) (forall ((v_ArrVal_1519 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet0#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1519) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1519 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1519) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet0#1|))))) is different from false [2025-04-29 11:09:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:34,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766023943] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:34,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:34,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-04-29 11:09:34,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588925105] [2025-04-29 11:09:34,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:34,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:09:34,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:34,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:09:34,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=186, Unknown=13, NotChecked=58, Total=306 [2025-04-29 11:09:34,648 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 189 [2025-04-29 11:09:34,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 1087 transitions, 20728 flow. Second operand has 18 states, 18 states have (on average 89.44444444444444) internal successors, (1610), 18 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:34,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:34,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 189 [2025-04-29 11:09:34,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:40,902 INFO L116 PetriNetUnfolderBase]: 8521/23570 cut-off events. [2025-04-29 11:09:40,902 INFO L117 PetriNetUnfolderBase]: For 168859/169253 co-relation queries the response was YES. [2025-04-29 11:09:41,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100821 conditions, 23570 events. 8521/23570 cut-off events. For 168859/169253 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 255538 event pairs, 2013 based on Foata normal form. 137/23114 useless extension candidates. Maximal degree in co-relation 100660. Up to 8476 conditions per place. [2025-04-29 11:09:41,135 INFO L140 encePairwiseOnDemand]: 168/189 looper letters, 885 selfloop transitions, 329 changer transitions 0/1301 dead transitions. [2025-04-29 11:09:41,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 1301 transitions, 26256 flow [2025-04-29 11:09:41,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:09:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:09:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1432 transitions. [2025-04-29 11:09:41,137 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5411942554799698 [2025-04-29 11:09:41,137 INFO L175 Difference]: Start difference. First operand has 364 places, 1087 transitions, 20728 flow. Second operand 14 states and 1432 transitions. [2025-04-29 11:09:41,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 1301 transitions, 26256 flow [2025-04-29 11:09:41,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 1301 transitions, 26111 flow, removed 64 selfloop flow, removed 8 redundant places. [2025-04-29 11:09:41,971 INFO L231 Difference]: Finished difference. Result has 374 places, 1102 transitions, 21942 flow [2025-04-29 11:09:41,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=20591, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=21942, PETRI_PLACES=374, PETRI_TRANSITIONS=1102} [2025-04-29 11:09:41,972 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 182 predicate places. [2025-04-29 11:09:41,972 INFO L485 AbstractCegarLoop]: Abstraction has has 374 places, 1102 transitions, 21942 flow [2025-04-29 11:09:41,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 89.44444444444444) internal successors, (1610), 18 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:41,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:41,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:41,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:42,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:09:42,173 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-29 11:09:42,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1862734259, now seen corresponding path program 7 times [2025-04-29 11:09:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:42,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141208078] [2025-04-29 11:09:42,174 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:09:42,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:42,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-29 11:09:42,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:09:42,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:42,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:42,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:42,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141208078] [2025-04-29 11:09:42,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141208078] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:42,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195031859] [2025-04-29 11:09:42,650 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:09:42,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:42,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:42,652 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:42,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:09:42,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-29 11:09:42,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:09:42,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:42,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:42,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:09:42,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:42,789 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:09:42,825 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:42,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:09:42,837 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 13 treesize of output 9 [2025-04-29 11:09:42,842 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 23 treesize of output 22 [2025-04-29 11:09:42,849 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:42,849 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 32 treesize of output 34 [2025-04-29 11:09:42,871 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:42,871 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 41 treesize of output 46 [2025-04-29 11:09:42,901 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 45 treesize of output 34 [2025-04-29 11:09:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:42,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:42,919 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 7)))) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 4)) 0))) is different from false [2025-04-29 11:09:42,943 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 5)) 0))) is different from false [2025-04-29 11:09:42,953 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1716) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-04-29 11:09:42,979 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 4)) 0))))) is different from false [2025-04-29 11:09:42,998 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 6)) (.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 5)) 0))))) is different from false [2025-04-29 11:09:43,010 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 5)) (.cse1 (+ c_~A~0.offset 6)) (.cse3 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1716 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1716) c_~A~0.base) .cse3) 0))))) is different from false [2025-04-29 11:09:43,020 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:43,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-04-29 11:09:43,024 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:43,025 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2025-04-29 11:09:43,030 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:43,031 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:43,035 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:43,035 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:43,038 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:43,039 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-29 11:09:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:43,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195031859] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:43,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:43,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2025-04-29 11:09:43,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031653069] [2025-04-29 11:09:43,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:43,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:09:43,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:43,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:09:43,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=178, Unknown=6, NotChecked=186, Total=420 [2025-04-29 11:09:43,116 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 189 [2025-04-29 11:09:43,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 1102 transitions, 21942 flow. Second operand has 21 states, 21 states have (on average 90.9047619047619) internal successors, (1909), 21 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:43,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:43,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 189 [2025-04-29 11:09:43,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15