./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array-race.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array-race.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 11c00eb7e81fe5f5d20f8502218732d0ad5be3fe08b502e96ffd3968906ec153 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:10:53,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:10:53,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:10:53,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:10:53,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:10:53,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:10:53,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:10:53,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:10:53,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:10:53,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:10:53,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:10:53,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:10:53,432 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:10:53,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:10:53,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:10:53,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:10:53,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:10:53,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:10:53,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:10:53,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:10:53,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:10:53,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:10:53,433 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:10:53,433 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:10:53,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:10:53,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:10:53,434 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:10:53,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:10:53,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:10:53,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:53,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:53,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:53,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:10:53,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:53,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:53,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:53,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:10:53,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:10:53,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:10:53,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:10:53,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:10:53,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:10:53,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:10:53,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:10:53,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:10:53,435 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 -> 11c00eb7e81fe5f5d20f8502218732d0ad5be3fe08b502e96ffd3968906ec153 [2025-04-29 11:10:53,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:10:53,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:10:53,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:10:53,654 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:10:53,654 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:10:53,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array-race.c [2025-04-29 11:10:54,893 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9da115a40/ecd82b589efd447b8452d4affb3b5478/FLAGa2bf41edd [2025-04-29 11:10:55,122 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:10:55,123 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array-race.c [2025-04-29 11:10:55,124 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:55,124 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:55,128 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9da115a40/ecd82b589efd447b8452d4affb3b5478/FLAGa2bf41edd [2025-04-29 11:10:55,944 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9da115a40/ecd82b589efd447b8452d4affb3b5478 [2025-04-29 11:10:55,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:10:55,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:10:55,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:55,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:10:55,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:10:55,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fde2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:55, skipping insertion in model container [2025-04-29 11:10:55,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:55" (1/1) ... [2025-04-29 11:10:55,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:10:56,137 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:56,150 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:10:56,180 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:56,192 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:10:56,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56 WrapperNode [2025-04-29 11:10:56,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:56,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:56,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:10:56,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:10:56,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,216 INFO L138 Inliner]: procedures = 11, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-04-29 11:10:56,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:56,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:10:56,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:10:56,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:10:56,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,230 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:10:56,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:10:56,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:10:56,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:10:56,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (1/1) ... [2025-04-29 11:10:56,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:56,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:56,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:10:56,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:10:56,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:10:56,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:10:56,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:10:56,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:10:56,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:10:56,280 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:10:56,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:10:56,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:10:56,281 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:10:56,335 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:10:56,336 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:10:56,485 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:10:56,486 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:10:56,492 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:10:56,492 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:10:56,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:56 BoogieIcfgContainer [2025-04-29 11:10:56,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:10:56,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:10:56,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:10:56,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:10:56,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:10:55" (1/3) ... [2025-04-29 11:10:56,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135a415d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:56, skipping insertion in model container [2025-04-29 11:10:56,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:56" (2/3) ... [2025-04-29 11:10:56,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135a415d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:56, skipping insertion in model container [2025-04-29 11:10:56,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:56" (3/3) ... [2025-04-29 11:10:56,498 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array-race.c [2025-04-29 11:10:56,507 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:10:56,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-in-array-race.c that has 2 procedures, 80 locations, 81 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-29 11:10:56,509 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:10:56,552 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:10:56,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 171 flow [2025-04-29 11:10:56,612 INFO L116 PetriNetUnfolderBase]: 2/112 cut-off events. [2025-04-29 11:10:56,616 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:10:56,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 112 events. 2/112 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 193 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-04-29 11:10:56,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 171 flow [2025-04-29 11:10:56,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 171 flow [2025-04-29 11:10:56,629 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:56,639 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;@4cb32bcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:56,639 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-29 11:10:56,652 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:56,652 INFO L116 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-04-29 11:10:56,652 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:56,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:56,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:56,653 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:10:56,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:56,657 INFO L85 PathProgramCache]: Analyzing trace with hash 281933423, now seen corresponding path program 1 times [2025-04-29 11:10:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:56,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769065494] [2025-04-29 11:10:56,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:56,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:10:56,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:10:56,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:56,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:56,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:56,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769065494] [2025-04-29 11:10:56,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769065494] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:56,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:56,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:56,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296848264] [2025-04-29 11:10:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:56,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:57,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:57,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:57,098 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 82 [2025-04-29 11:10:57,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:57,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:57,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 82 [2025-04-29 11:10:57,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:57,172 INFO L116 PetriNetUnfolderBase]: 1/118 cut-off events. [2025-04-29 11:10:57,172 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:10:57,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 118 events. 1/118 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 167 event pairs, 0 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 23. Up to 16 conditions per place. [2025-04-29 11:10:57,174 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 11 selfloop transitions, 2 changer transitions 6/86 dead transitions. [2025-04-29 11:10:57,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 86 transitions, 215 flow [2025-04-29 11:10:57,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 428 transitions. [2025-04-29 11:10:57,198 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8699186991869918 [2025-04-29 11:10:57,199 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 171 flow. Second operand 6 states and 428 transitions. [2025-04-29 11:10:57,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 86 transitions, 215 flow [2025-04-29 11:10:57,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:57,207 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 185 flow [2025-04-29 11:10:57,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2025-04-29 11:10:57,212 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2025-04-29 11:10:57,213 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 185 flow [2025-04-29 11:10:57,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:57,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:57,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:57,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:10:57,215 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:10:57,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash 217789210, now seen corresponding path program 1 times [2025-04-29 11:10:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:57,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811911954] [2025-04-29 11:10:57,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:57,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:10:57,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:10:57,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:57,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:57,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:57,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811911954] [2025-04-29 11:10:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811911954] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:57,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:57,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030251419] [2025-04-29 11:10:57,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:57,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:57,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:57,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:57,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:57,733 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 82 [2025-04-29 11:10:57,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:57,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:57,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 82 [2025-04-29 11:10:57,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:57,830 INFO L116 PetriNetUnfolderBase]: 70/349 cut-off events. [2025-04-29 11:10:57,830 INFO L117 PetriNetUnfolderBase]: For 25/28 co-relation queries the response was YES. [2025-04-29 11:10:57,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 349 events. 70/349 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1681 event pairs, 35 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 487. Up to 150 conditions per place. [2025-04-29 11:10:57,833 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 23 selfloop transitions, 22 changer transitions 0/101 dead transitions. [2025-04-29 11:10:57,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 101 transitions, 317 flow [2025-04-29 11:10:57,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 388 transitions. [2025-04-29 11:10:57,835 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7886178861788617 [2025-04-29 11:10:57,835 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 185 flow. Second operand 6 states and 388 transitions. [2025-04-29 11:10:57,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 101 transitions, 317 flow [2025-04-29 11:10:57,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 101 transitions, 303 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-29 11:10:57,837 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 321 flow [2025-04-29 11:10:57,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2025-04-29 11:10:57,838 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2025-04-29 11:10:57,838 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 321 flow [2025-04-29 11:10:57,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:57,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:57,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:57,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:10:57,839 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:10:57,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash -358008177, now seen corresponding path program 1 times [2025-04-29 11:10:57,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:57,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253923095] [2025-04-29 11:10:57,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:57,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:10:57,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:10:57,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:57,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:58,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:58,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253923095] [2025-04-29 11:10:58,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253923095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:58,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:58,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418113735] [2025-04-29 11:10:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:58,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:58,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:58,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:58,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:58,195 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 82 [2025-04-29 11:10:58,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:58,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:58,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 82 [2025-04-29 11:10:58,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:58,359 INFO L116 PetriNetUnfolderBase]: 130/477 cut-off events. [2025-04-29 11:10:58,359 INFO L117 PetriNetUnfolderBase]: For 138/150 co-relation queries the response was YES. [2025-04-29 11:10:58,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 477 events. 130/477 cut-off events. For 138/150 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2465 event pairs, 23 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 976. Up to 238 conditions per place. [2025-04-29 11:10:58,362 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 33 selfloop transitions, 48 changer transitions 8/144 dead transitions. [2025-04-29 11:10:58,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 144 transitions, 639 flow [2025-04-29 11:10:58,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2025-04-29 11:10:58,364 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8719512195121951 [2025-04-29 11:10:58,364 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 321 flow. Second operand 6 states and 429 transitions. [2025-04-29 11:10:58,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 144 transitions, 639 flow [2025-04-29 11:10:58,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 639 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:58,370 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 693 flow [2025-04-29 11:10:58,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=103, PETRI_TRANSITIONS=136} [2025-04-29 11:10:58,371 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2025-04-29 11:10:58,372 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 693 flow [2025-04-29 11:10:58,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:58,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:58,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:58,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:10:58,373 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:10:58,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash 313813177, now seen corresponding path program 1 times [2025-04-29 11:10:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:58,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493241796] [2025-04-29 11:10:58,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:58,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:58,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:10:58,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:10:58,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:58,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:58,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493241796] [2025-04-29 11:10:58,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493241796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:58,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:58,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:58,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568663355] [2025-04-29 11:10:58,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:58,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:58,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:58,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:58,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:58,744 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 82 [2025-04-29 11:10:58,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 136 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:58,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:58,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 82 [2025-04-29 11:10:58,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:58,879 INFO L116 PetriNetUnfolderBase]: 142/505 cut-off events. [2025-04-29 11:10:58,879 INFO L117 PetriNetUnfolderBase]: For 464/492 co-relation queries the response was YES. [2025-04-29 11:10:58,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 505 events. 142/505 cut-off events. For 464/492 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2810 event pairs, 10 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 1464. Up to 241 conditions per place. [2025-04-29 11:10:58,884 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 73 selfloop transitions, 25 changer transitions 13/164 dead transitions. [2025-04-29 11:10:58,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1076 flow [2025-04-29 11:10:58,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2025-04-29 11:10:58,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.806910569105691 [2025-04-29 11:10:58,886 INFO L175 Difference]: Start difference. First operand has 103 places, 136 transitions, 693 flow. Second operand 6 states and 397 transitions. [2025-04-29 11:10:58,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1076 flow [2025-04-29 11:10:58,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 164 transitions, 1058 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:58,895 INFO L231 Difference]: Finished difference. Result has 105 places, 151 transitions, 910 flow [2025-04-29 11:10:58,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=105, PETRI_TRANSITIONS=151} [2025-04-29 11:10:58,896 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2025-04-29 11:10:58,897 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 151 transitions, 910 flow [2025-04-29 11:10:58,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:58,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:58,897 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:58,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:10:58,897 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:10:58,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash -850196485, now seen corresponding path program 1 times [2025-04-29 11:10:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:58,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153849974] [2025-04-29 11:10:58,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:58,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:58,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:10:58,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:10:58,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:58,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:10:58,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:10:58,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:10:58,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:58,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:10:58,952 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:10:58,953 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-29 11:10:58,954 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-29 11:10:58,954 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-29 11:10:58,954 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-29 11:10:58,954 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-29 11:10:58,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:10:58,955 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-29 11:10:58,956 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:10:58,957 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:10:58,979 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:10:58,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 100 transitions, 216 flow [2025-04-29 11:10:59,004 INFO L116 PetriNetUnfolderBase]: 4/192 cut-off events. [2025-04-29 11:10:59,005 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:10:59,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 192 events. 4/192 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 410 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 114. Up to 6 conditions per place. [2025-04-29 11:10:59,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 100 transitions, 216 flow [2025-04-29 11:10:59,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 100 transitions, 216 flow [2025-04-29 11:10:59,008 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:59,008 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;@4cb32bcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:59,008 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:10:59,013 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:59,016 INFO L116 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-04-29 11:10:59,017 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:59,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:59,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:59,017 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:10:59,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:59,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2123445421, now seen corresponding path program 1 times [2025-04-29 11:10:59,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:59,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377054567] [2025-04-29 11:10:59,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:59,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:59,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:10:59,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:10:59,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:59,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:59,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:59,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377054567] [2025-04-29 11:10:59,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377054567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:59,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:59,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:59,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362827736] [2025-04-29 11:10:59,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:59,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:59,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:59,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:59,146 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 100 [2025-04-29 11:10:59,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:59,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:59,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 100 [2025-04-29 11:10:59,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:59,181 INFO L116 PetriNetUnfolderBase]: 3/198 cut-off events. [2025-04-29 11:10:59,181 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-29 11:10:59,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 198 events. 3/198 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs, 0 based on Foata normal form. 2/190 useless extension candidates. Maximal degree in co-relation 141. Up to 32 conditions per place. [2025-04-29 11:10:59,182 INFO L140 encePairwiseOnDemand]: 91/100 looper letters, 14 selfloop transitions, 2 changer transitions 6/105 dead transitions. [2025-04-29 11:10:59,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 268 flow [2025-04-29 11:10:59,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2025-04-29 11:10:59,183 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2025-04-29 11:10:59,183 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 216 flow. Second operand 6 states and 527 transitions. [2025-04-29 11:10:59,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 268 flow [2025-04-29 11:10:59,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:59,185 INFO L231 Difference]: Finished difference. Result has 111 places, 99 transitions, 234 flow [2025-04-29 11:10:59,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=111, PETRI_TRANSITIONS=99} [2025-04-29 11:10:59,186 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 9 predicate places. [2025-04-29 11:10:59,186 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 99 transitions, 234 flow [2025-04-29 11:10:59,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:59,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:59,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:59,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:10:59,187 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:10:59,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:59,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2107377662, now seen corresponding path program 1 times [2025-04-29 11:10:59,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:59,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828630847] [2025-04-29 11:10:59,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:59,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:59,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:10:59,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:10:59,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:59,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:59,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:59,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828630847] [2025-04-29 11:10:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828630847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:59,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559075797] [2025-04-29 11:10:59,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:59,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:59,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:59,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:59,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:59,443 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 100 [2025-04-29 11:10:59,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 99 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:59,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:59,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 100 [2025-04-29 11:10:59,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:59,729 INFO L116 PetriNetUnfolderBase]: 902/2602 cut-off events. [2025-04-29 11:10:59,730 INFO L117 PetriNetUnfolderBase]: For 180/186 co-relation queries the response was YES. [2025-04-29 11:10:59,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4377 conditions, 2602 events. 902/2602 cut-off events. For 180/186 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 19763 event pairs, 512 based on Foata normal form. 0/2364 useless extension candidates. Maximal degree in co-relation 3404. Up to 1384 conditions per place. [2025-04-29 11:10:59,744 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 31 selfloop transitions, 38 changer transitions 0/137 dead transitions. [2025-04-29 11:10:59,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 453 flow [2025-04-29 11:10:59,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 483 transitions. [2025-04-29 11:10:59,747 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.805 [2025-04-29 11:10:59,747 INFO L175 Difference]: Start difference. First operand has 111 places, 99 transitions, 234 flow. Second operand 6 states and 483 transitions. [2025-04-29 11:10:59,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 453 flow [2025-04-29 11:10:59,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 137 transitions, 441 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:10:59,751 INFO L231 Difference]: Finished difference. Result has 113 places, 136 transitions, 476 flow [2025-04-29 11:10:59,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=113, PETRI_TRANSITIONS=136} [2025-04-29 11:10:59,753 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 11 predicate places. [2025-04-29 11:10:59,753 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 136 transitions, 476 flow [2025-04-29 11:10:59,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:59,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:59,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:59,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:10:59,754 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:10:59,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1154980451, now seen corresponding path program 1 times [2025-04-29 11:10:59,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:59,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968846313] [2025-04-29 11:10:59,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:59,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:59,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:10:59,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:10:59,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:59,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:59,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:59,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968846313] [2025-04-29 11:10:59,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968846313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:59,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:59,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:59,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974303389] [2025-04-29 11:10:59,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:59,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:59,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:59,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:59,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:00,002 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 100 [2025-04-29 11:11:00,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 136 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:00,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:00,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 100 [2025-04-29 11:11:00,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:00,487 INFO L116 PetriNetUnfolderBase]: 1866/4588 cut-off events. [2025-04-29 11:11:00,488 INFO L117 PetriNetUnfolderBase]: For 1539/1624 co-relation queries the response was YES. [2025-04-29 11:11:00,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10753 conditions, 4588 events. 1866/4588 cut-off events. For 1539/1624 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 36024 event pairs, 434 based on Foata normal form. 0/4289 useless extension candidates. Maximal degree in co-relation 8549. Up to 2580 conditions per place. [2025-04-29 11:11:00,511 INFO L140 encePairwiseOnDemand]: 81/100 looper letters, 63 selfloop transitions, 92 changer transitions 0/231 dead transitions. [2025-04-29 11:11:00,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 231 transitions, 1222 flow [2025-04-29 11:11:00,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-04-29 11:11:00,513 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-04-29 11:11:00,513 INFO L175 Difference]: Start difference. First operand has 113 places, 136 transitions, 476 flow. Second operand 6 states and 531 transitions. [2025-04-29 11:11:00,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 231 transitions, 1222 flow [2025-04-29 11:11:00,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 1222 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:00,520 INFO L231 Difference]: Finished difference. Result has 123 places, 223 transitions, 1312 flow [2025-04-29 11:11:00,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=123, PETRI_TRANSITIONS=223} [2025-04-29 11:11:00,521 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2025-04-29 11:11:00,521 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 223 transitions, 1312 flow [2025-04-29 11:11:00,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:00,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:00,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:00,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:11:00,521 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:00,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1897723081, now seen corresponding path program 1 times [2025-04-29 11:11:00,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:00,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343435224] [2025-04-29 11:11:00,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:00,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:00,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:00,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:00,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:00,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:00,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:00,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343435224] [2025-04-29 11:11:00,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343435224] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:00,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:00,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:00,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229928613] [2025-04-29 11:11:00,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:00,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:00,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:00,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:00,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:00,800 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 100 [2025-04-29 11:11:00,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 223 transitions, 1312 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:00,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:00,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 100 [2025-04-29 11:11:00,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:01,293 INFO L116 PetriNetUnfolderBase]: 2323/5522 cut-off events. [2025-04-29 11:11:01,294 INFO L117 PetriNetUnfolderBase]: For 5284/5444 co-relation queries the response was YES. [2025-04-29 11:11:01,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17444 conditions, 5522 events. 2323/5522 cut-off events. For 5284/5444 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 44218 event pairs, 290 based on Foata normal form. 2/5293 useless extension candidates. Maximal degree in co-relation 13989. Up to 3131 conditions per place. [2025-04-29 11:11:01,339 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 145 selfloop transitions, 76 changer transitions 0/296 dead transitions. [2025-04-29 11:11:01,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 296 transitions, 2246 flow [2025-04-29 11:11:01,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-04-29 11:11:01,342 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8233333333333334 [2025-04-29 11:11:01,342 INFO L175 Difference]: Start difference. First operand has 123 places, 223 transitions, 1312 flow. Second operand 6 states and 494 transitions. [2025-04-29 11:11:01,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 296 transitions, 2246 flow [2025-04-29 11:11:01,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 296 transitions, 2228 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:01,378 INFO L231 Difference]: Finished difference. Result has 133 places, 294 transitions, 2152 flow [2025-04-29 11:11:01,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2152, PETRI_PLACES=133, PETRI_TRANSITIONS=294} [2025-04-29 11:11:01,380 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2025-04-29 11:11:01,380 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2152 flow [2025-04-29 11:11:01,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:01,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:01,381 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:01,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:11:01,381 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:01,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1727947617, now seen corresponding path program 1 times [2025-04-29 11:11:01,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:01,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851735484] [2025-04-29 11:11:01,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:01,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:01,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:01,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:01,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:01,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:01,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851735484] [2025-04-29 11:11:01,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851735484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:01,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:01,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:01,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475885108] [2025-04-29 11:11:01,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:01,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:01,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:01,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:01,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:02,300 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-04-29 11:11:02,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 294 transitions, 2152 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:02,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:02,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-04-29 11:11:02,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:03,389 INFO L116 PetriNetUnfolderBase]: 3298/7928 cut-off events. [2025-04-29 11:11:03,389 INFO L117 PetriNetUnfolderBase]: For 12552/12787 co-relation queries the response was YES. [2025-04-29 11:11:03,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27646 conditions, 7928 events. 3298/7928 cut-off events. For 12552/12787 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 67486 event pairs, 353 based on Foata normal form. 65/7687 useless extension candidates. Maximal degree in co-relation 23504. Up to 3811 conditions per place. [2025-04-29 11:11:03,428 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 229 selfloop transitions, 135 changer transitions 0/427 dead transitions. [2025-04-29 11:11:03,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 427 transitions, 3993 flow [2025-04-29 11:11:03,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:11:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 11:11:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1151 transitions. [2025-04-29 11:11:03,431 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6770588235294117 [2025-04-29 11:11:03,431 INFO L175 Difference]: Start difference. First operand has 133 places, 294 transitions, 2152 flow. Second operand 17 states and 1151 transitions. [2025-04-29 11:11:03,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 427 transitions, 3993 flow [2025-04-29 11:11:03,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 427 transitions, 3849 flow, removed 72 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:03,472 INFO L231 Difference]: Finished difference. Result has 157 places, 353 transitions, 3118 flow [2025-04-29 11:11:03,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3118, PETRI_PLACES=157, PETRI_TRANSITIONS=353} [2025-04-29 11:11:03,473 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 55 predicate places. [2025-04-29 11:11:03,473 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 353 transitions, 3118 flow [2025-04-29 11:11:03,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:03,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:03,474 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:03,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:11:03,474 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:03,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash -597792845, now seen corresponding path program 1 times [2025-04-29 11:11:03,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:03,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554190947] [2025-04-29 11:11:03,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:03,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:03,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:03,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:03,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:03,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:03,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:03,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554190947] [2025-04-29 11:11:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554190947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:03,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:03,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:03,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296229561] [2025-04-29 11:11:03,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:03,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:03,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:03,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:04,140 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 100 [2025-04-29 11:11:04,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 353 transitions, 3118 flow. Second operand has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:04,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:04,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 100 [2025-04-29 11:11:04,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:05,525 INFO L116 PetriNetUnfolderBase]: 3977/8910 cut-off events. [2025-04-29 11:11:05,525 INFO L117 PetriNetUnfolderBase]: For 20521/21071 co-relation queries the response was YES. [2025-04-29 11:11:05,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36130 conditions, 8910 events. 3977/8910 cut-off events. For 20521/21071 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 74886 event pairs, 246 based on Foata normal form. 270/8945 useless extension candidates. Maximal degree in co-relation 31556. Up to 3183 conditions per place. [2025-04-29 11:11:05,589 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 366 selfloop transitions, 366 changer transitions 1/805 dead transitions. [2025-04-29 11:11:05,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 805 transitions, 8690 flow [2025-04-29 11:11:05,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:11:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-29 11:11:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1662 transitions. [2025-04-29 11:11:05,593 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7226086956521739 [2025-04-29 11:11:05,593 INFO L175 Difference]: Start difference. First operand has 157 places, 353 transitions, 3118 flow. Second operand 23 states and 1662 transitions. [2025-04-29 11:11:05,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 805 transitions, 8690 flow [2025-04-29 11:11:05,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 805 transitions, 8632 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-04-29 11:11:05,670 INFO L231 Difference]: Finished difference. Result has 183 places, 671 transitions, 7920 flow [2025-04-29 11:11:05,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=3078, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7920, PETRI_PLACES=183, PETRI_TRANSITIONS=671} [2025-04-29 11:11:05,671 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 81 predicate places. [2025-04-29 11:11:05,671 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 671 transitions, 7920 flow [2025-04-29 11:11:05,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:05,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:05,672 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:05,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:11:05,672 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:05,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:05,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1470577801, now seen corresponding path program 2 times [2025-04-29 11:11:05,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:05,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910808312] [2025-04-29 11:11:05,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:11:05,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:05,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:05,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:05,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:11:05,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:06,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:06,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910808312] [2025-04-29 11:11:06,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910808312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:06,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:06,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:06,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613203874] [2025-04-29 11:11:06,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:06,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:06,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:06,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:06,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:06,477 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-04-29 11:11:06,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 671 transitions, 7920 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:06,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:06,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-04-29 11:11:06,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:08,402 INFO L116 PetriNetUnfolderBase]: 4544/10348 cut-off events. [2025-04-29 11:11:08,402 INFO L117 PetriNetUnfolderBase]: For 56563/57121 co-relation queries the response was YES. [2025-04-29 11:11:08,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52457 conditions, 10348 events. 4544/10348 cut-off events. For 56563/57121 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 88687 event pairs, 327 based on Foata normal form. 179/10197 useless extension candidates. Maximal degree in co-relation 51344. Up to 4300 conditions per place. [2025-04-29 11:11:08,475 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 557 selfloop transitions, 371 changer transitions 0/1000 dead transitions. [2025-04-29 11:11:08,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1000 transitions, 14068 flow [2025-04-29 11:11:08,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:11:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:11:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1429 transitions. [2025-04-29 11:11:08,479 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6804761904761905 [2025-04-29 11:11:08,479 INFO L175 Difference]: Start difference. First operand has 183 places, 671 transitions, 7920 flow. Second operand 21 states and 1429 transitions. [2025-04-29 11:11:08,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1000 transitions, 14068 flow [2025-04-29 11:11:08,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1000 transitions, 13844 flow, removed 106 selfloop flow, removed 6 redundant places. [2025-04-29 11:11:08,709 INFO L231 Difference]: Finished difference. Result has 204 places, 894 transitions, 12467 flow [2025-04-29 11:11:08,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=7696, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12467, PETRI_PLACES=204, PETRI_TRANSITIONS=894} [2025-04-29 11:11:08,710 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 102 predicate places. [2025-04-29 11:11:08,711 INFO L485 AbstractCegarLoop]: Abstraction has has 204 places, 894 transitions, 12467 flow [2025-04-29 11:11:08,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:08,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:08,712 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:08,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:11:08,712 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:08,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash -933869799, now seen corresponding path program 3 times [2025-04-29 11:11:08,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:08,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474765752] [2025-04-29 11:11:08,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:11:08,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:08,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 3 equivalence classes. [2025-04-29 11:11:08,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:08,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:11:08,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:09,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474765752] [2025-04-29 11:11:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474765752] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:09,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699020328] [2025-04-29 11:11:09,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:11:09,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:09,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:09,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:11:09,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:11:09,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 3 equivalence classes. [2025-04-29 11:11:09,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:09,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:11:09,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:09,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:11:09,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:09,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:11:09,441 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:11:09,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:11:09,519 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:11:09,530 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:11:09,543 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:09,543 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 40 treesize of output 42 [2025-04-29 11:11:09,558 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:09,558 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 52 treesize of output 57 [2025-04-29 11:11:09,629 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 56 treesize of output 45 [2025-04-29 11:11:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:09,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:14,984 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_315 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_315 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_315 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))))))) is different from false [2025-04-29 11:11:14,999 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_315 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_315 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))) (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_315 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_315) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))))))) is different from false [2025-04-29 11:11:20,505 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:20,506 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 51 treesize of output 67 [2025-04-29 11:11:20,517 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:20,518 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 115 treesize of output 35 [2025-04-29 11:11:20,524 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:20,524 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 51 treesize of output 1 [2025-04-29 11:11:20,528 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:20,528 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 50 treesize of output 1 [2025-04-29 11:11:20,532 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:20,532 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 51 treesize of output 1 [2025-04-29 11:11:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699020328] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:11:20,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:11:20,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 13] total 32 [2025-04-29 11:11:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962299592] [2025-04-29 11:11:20,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:11:20,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-29 11:11:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:20,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-29 11:11:20,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=771, Unknown=58, NotChecked=118, Total=1056 [2025-04-29 11:11:20,896 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 100 [2025-04-29 11:11:20,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 894 transitions, 12467 flow. Second operand has 33 states, 33 states have (on average 38.42424242424242) internal successors, (1268), 33 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:20,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:20,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 100 [2025-04-29 11:11:20,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:25,130 INFO L116 PetriNetUnfolderBase]: 9549/20016 cut-off events. [2025-04-29 11:11:25,130 INFO L117 PetriNetUnfolderBase]: For 142283/143249 co-relation queries the response was YES. [2025-04-29 11:11:25,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102020 conditions, 20016 events. 9549/20016 cut-off events. For 142283/143249 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 182043 event pairs, 2267 based on Foata normal form. 266/19264 useless extension candidates. Maximal degree in co-relation 100168. Up to 12080 conditions per place. [2025-04-29 11:11:25,292 INFO L140 encePairwiseOnDemand]: 69/100 looper letters, 741 selfloop transitions, 361 changer transitions 1/1146 dead transitions. [2025-04-29 11:11:25,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1146 transitions, 18146 flow [2025-04-29 11:11:25,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:11:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-29 11:11:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1091 transitions. [2025-04-29 11:11:25,295 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45458333333333334 [2025-04-29 11:11:25,295 INFO L175 Difference]: Start difference. First operand has 204 places, 894 transitions, 12467 flow. Second operand 24 states and 1091 transitions. [2025-04-29 11:11:25,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 1146 transitions, 18146 flow [2025-04-29 11:11:25,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 1146 transitions, 17850 flow, removed 127 selfloop flow, removed 12 redundant places. [2025-04-29 11:11:25,837 INFO L231 Difference]: Finished difference. Result has 221 places, 1034 transitions, 16285 flow [2025-04-29 11:11:25,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=12177, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=16285, PETRI_PLACES=221, PETRI_TRANSITIONS=1034} [2025-04-29 11:11:25,837 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 119 predicate places. [2025-04-29 11:11:25,837 INFO L485 AbstractCegarLoop]: Abstraction has has 221 places, 1034 transitions, 16285 flow [2025-04-29 11:11:25,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 38.42424242424242) internal successors, (1268), 33 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:25,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:25,838 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:25,844 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:11:26,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 11:11:26,039 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:26,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:26,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1045933731, now seen corresponding path program 4 times [2025-04-29 11:11:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:26,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90408831] [2025-04-29 11:11:26,039 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:11:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:26,048 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:11:26,059 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:26,059 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:11:26,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:26,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:26,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90408831] [2025-04-29 11:11:26,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90408831] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:26,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974351824] [2025-04-29 11:11:26,374 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:11:26,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:26,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:26,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:11:26,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:11:26,418 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:11:26,474 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:26,474 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:11:26,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:26,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:11:26,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:26,480 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:11:26,487 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:11:26,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:11:26,514 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:11:26,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:11:26,541 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:26,542 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 40 treesize of output 42 [2025-04-29 11:11:26,555 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:26,555 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 52 treesize of output 57 [2025-04-29 11:11:26,580 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 56 treesize of output 45 [2025-04-29 11:11:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:26,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:26,649 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)))) (forall ((v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))))))) is different from false [2025-04-29 11:11:26,662 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))))))) is different from false [2025-04-29 11:11:26,677 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_378 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_378 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4))))))) is different from false [2025-04-29 11:11:26,722 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_378 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_378 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_378 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_378 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_378) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet6#1|)))))) is different from false [2025-04-29 11:11:26,737 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:26,738 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 50 treesize of output 66 [2025-04-29 11:11:26,741 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:26,742 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 113 treesize of output 34 [2025-04-29 11:11:26,748 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:26,748 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 51 treesize of output 1 [2025-04-29 11:11:26,752 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:26,752 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 51 treesize of output 1 [2025-04-29 11:11:26,756 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:26,757 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 51 treesize of output 1 [2025-04-29 11:11:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:26,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974351824] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:11:26,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:11:26,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-04-29 11:11:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057377152] [2025-04-29 11:11:26,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:11:26,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:11:26,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:26,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:11:26,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=223, Unknown=15, NotChecked=132, Total=420 [2025-04-29 11:11:26,837 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-04-29 11:11:26,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 1034 transitions, 16285 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:26,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:26,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-04-29 11:11:26,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:31,110 INFO L116 PetriNetUnfolderBase]: 10158/21572 cut-off events. [2025-04-29 11:11:31,111 INFO L117 PetriNetUnfolderBase]: For 190998/191988 co-relation queries the response was YES. [2025-04-29 11:11:31,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118239 conditions, 21572 events. 10158/21572 cut-off events. For 190998/191988 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 201213 event pairs, 2092 based on Foata normal form. 392/20971 useless extension candidates. Maximal degree in co-relation 116512. Up to 11548 conditions per place. [2025-04-29 11:11:31,253 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 788 selfloop transitions, 628 changer transitions 1/1470 dead transitions. [2025-04-29 11:11:31,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 1470 transitions, 26247 flow [2025-04-29 11:11:31,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:11:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-29 11:11:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1169 transitions. [2025-04-29 11:11:31,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5845 [2025-04-29 11:11:31,255 INFO L175 Difference]: Start difference. First operand has 221 places, 1034 transitions, 16285 flow. Second operand 20 states and 1169 transitions. [2025-04-29 11:11:31,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 1470 transitions, 26247 flow [2025-04-29 11:11:32,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 1470 transitions, 26130 flow, removed 25 selfloop flow, removed 17 redundant places. [2025-04-29 11:11:32,099 INFO L231 Difference]: Finished difference. Result has 229 places, 1323 transitions, 23953 flow [2025-04-29 11:11:32,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=16168, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=376, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=23953, PETRI_PLACES=229, PETRI_TRANSITIONS=1323} [2025-04-29 11:11:32,100 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 127 predicate places. [2025-04-29 11:11:32,100 INFO L485 AbstractCegarLoop]: Abstraction has has 229 places, 1323 transitions, 23953 flow [2025-04-29 11:11:32,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:32,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:32,101 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:32,108 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:11:32,301 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,SelfDestructingSolverStorable13 [2025-04-29 11:11:32,301 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:32,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1594682845, now seen corresponding path program 5 times [2025-04-29 11:11:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:32,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074794919] [2025-04-29 11:11:32,302 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:11:32,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:32,309 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 3 equivalence classes. [2025-04-29 11:11:32,316 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:32,316 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-29 11:11:32,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:32,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:32,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074794919] [2025-04-29 11:11:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074794919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:32,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662332641] [2025-04-29 11:11:32,654 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:11:32,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:32,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:32,656 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:11:32,658 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:11:32,700 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 3 equivalence classes. [2025-04-29 11:11:32,717 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:32,717 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-29 11:11:32,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:32,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:11:32,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:32,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:11:32,751 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:11:32,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:11:32,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:11:32,787 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:11:32,799 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:32,799 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 40 treesize of output 42 [2025-04-29 11:11:32,847 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:32,847 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 52 treesize of output 57 [2025-04-29 11:11:32,872 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 56 treesize of output 45 [2025-04-29 11:11:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:32,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:32,899 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))))) is different from false [2025-04-29 11:11:32,922 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))))))) is different from false [2025-04-29 11:11:32,964 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet6#1|)))))) is different from false [2025-04-29 11:11:32,977 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 2)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)))) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1)))))))) is different from false [2025-04-29 11:11:32,997 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 1)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_441 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_441) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4)))))))) is different from false [2025-04-29 11:11:33,010 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:33,010 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 51 treesize of output 67 [2025-04-29 11:11:33,016 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:33,016 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 93 treesize of output 31 [2025-04-29 11:11:33,022 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:33,022 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 51 treesize of output 1 [2025-04-29 11:11:33,026 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:33,026 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 51 treesize of output 1 [2025-04-29 11:11:33,030 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:33,030 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 50 treesize of output 1 [2025-04-29 11:11:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:33,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662332641] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:11:33,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:11:33,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-04-29 11:11:33,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673058475] [2025-04-29 11:11:33,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:11:33,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:11:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:33,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:11:33,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=206, Unknown=5, NotChecked=160, Total=420 [2025-04-29 11:11:33,132 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-04-29 11:11:33,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 1323 transitions, 23953 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:33,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:33,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-04-29 11:11:33,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:38,720 INFO L116 PetriNetUnfolderBase]: 10554/22710 cut-off events. [2025-04-29 11:11:38,720 INFO L117 PetriNetUnfolderBase]: For 281579/283372 co-relation queries the response was YES. [2025-04-29 11:11:38,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135760 conditions, 22710 events. 10554/22710 cut-off events. For 281579/283372 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 215970 event pairs, 2269 based on Foata normal form. 538/22206 useless extension candidates. Maximal degree in co-relation 134027. Up to 13009 conditions per place. [2025-04-29 11:11:38,960 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 945 selfloop transitions, 592 changer transitions 1/1591 dead transitions. [2025-04-29 11:11:38,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 1591 transitions, 31747 flow [2025-04-29 11:11:38,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:11:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-29 11:11:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1167 transitions. [2025-04-29 11:11:38,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5835 [2025-04-29 11:11:38,962 INFO L175 Difference]: Start difference. First operand has 229 places, 1323 transitions, 23953 flow. Second operand 20 states and 1167 transitions. [2025-04-29 11:11:38,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 1591 transitions, 31747 flow [2025-04-29 11:11:40,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 1591 transitions, 30956 flow, removed 367 selfloop flow, removed 12 redundant places. [2025-04-29 11:11:40,060 INFO L231 Difference]: Finished difference. Result has 241 places, 1473 transitions, 29075 flow [2025-04-29 11:11:40,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=23278, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=462, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=29075, PETRI_PLACES=241, PETRI_TRANSITIONS=1473} [2025-04-29 11:11:40,061 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 139 predicate places. [2025-04-29 11:11:40,061 INFO L485 AbstractCegarLoop]: Abstraction has has 241 places, 1473 transitions, 29075 flow [2025-04-29 11:11:40,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:40,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:40,062 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:40,067 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:11:40,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:40,262 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:40,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:40,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1992748825, now seen corresponding path program 6 times [2025-04-29 11:11:40,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:40,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163857926] [2025-04-29 11:11:40,263 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:11:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:40,269 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 4 equivalence classes. [2025-04-29 11:11:40,279 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:40,280 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-29 11:11:40,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:40,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163857926] [2025-04-29 11:11:40,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163857926] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:40,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670754536] [2025-04-29 11:11:40,521 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:11:40,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:40,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:40,523 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:11:40,525 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:11:40,567 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 4 equivalence classes. [2025-04-29 11:11:40,615 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:40,615 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-29 11:11:40,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:40,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:11:40,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:40,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:11:40,629 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:11:40,629 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:11:40,656 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:11:40,662 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:11:40,688 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:40,688 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 40 treesize of output 42 [2025-04-29 11:11:40,698 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:40,698 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 52 treesize of output 57 [2025-04-29 11:11:40,716 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 56 treesize of output 45 [2025-04-29 11:11:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:40,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:40,740 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))) (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))))) is different from false [2025-04-29 11:11:40,769 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)))) (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))))))) is different from false [2025-04-29 11:11:40,782 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))))))) is different from false [2025-04-29 11:11:40,822 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))) (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)))) (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))))))) is different from false [2025-04-29 11:11:40,837 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))) (forall ((v_ArrVal_504 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_504) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet6#1|)))))) is different from false [2025-04-29 11:11:40,849 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:40,850 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 50 treesize of output 66 [2025-04-29 11:11:40,854 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:40,854 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 113 treesize of output 34 [2025-04-29 11:11:40,860 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:40,860 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 51 treesize of output 1 [2025-04-29 11:11:40,864 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:40,864 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 51 treesize of output 1 [2025-04-29 11:11:40,868 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:40,868 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 51 treesize of output 1 [2025-04-29 11:11:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670754536] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:11:40,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:11:40,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-04-29 11:11:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785119282] [2025-04-29 11:11:40,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:11:40,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:11:40,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:40,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:11:40,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=207, Unknown=5, NotChecked=160, Total=420 [2025-04-29 11:11:40,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-04-29 11:11:40,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 1473 transitions, 29075 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:40,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:40,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-04-29 11:11:40,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:47,001 INFO L116 PetriNetUnfolderBase]: 10594/22989 cut-off events. [2025-04-29 11:11:47,001 INFO L117 PetriNetUnfolderBase]: For 307192/308633 co-relation queries the response was YES. [2025-04-29 11:11:47,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142506 conditions, 22989 events. 10594/22989 cut-off events. For 307192/308633 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 220266 event pairs, 1994 based on Foata normal form. 473/22436 useless extension candidates. Maximal degree in co-relation 140758. Up to 12554 conditions per place. [2025-04-29 11:11:47,550 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 957 selfloop transitions, 759 changer transitions 1/1770 dead transitions. [2025-04-29 11:11:47,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 1770 transitions, 38041 flow [2025-04-29 11:11:47,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:11:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-29 11:11:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1168 transitions. [2025-04-29 11:11:47,552 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.584 [2025-04-29 11:11:47,552 INFO L175 Difference]: Start difference. First operand has 241 places, 1473 transitions, 29075 flow. Second operand 20 states and 1168 transitions. [2025-04-29 11:11:47,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 1770 transitions, 38041 flow [2025-04-29 11:11:48,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 1770 transitions, 37314 flow, removed 283 selfloop flow, removed 14 redundant places. [2025-04-29 11:11:48,608 INFO L231 Difference]: Finished difference. Result has 251 places, 1643 transitions, 34938 flow [2025-04-29 11:11:48,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=28522, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=610, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=34938, PETRI_PLACES=251, PETRI_TRANSITIONS=1643} [2025-04-29 11:11:48,609 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 149 predicate places. [2025-04-29 11:11:48,609 INFO L485 AbstractCegarLoop]: Abstraction has has 251 places, 1643 transitions, 34938 flow [2025-04-29 11:11:48,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:48,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:48,609 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:48,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:11:48,810 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,SelfDestructingSolverStorable15 [2025-04-29 11:11:48,810 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:48,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash 377852581, now seen corresponding path program 7 times [2025-04-29 11:11:48,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:48,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312225458] [2025-04-29 11:11:48,811 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:11:48,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:48,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:48,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:48,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:48,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:49,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:49,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312225458] [2025-04-29 11:11:49,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312225458] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:49,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971298112] [2025-04-29 11:11:49,225 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:11:49,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:49,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:49,227 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:11:49,227 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:11:49,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:49,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:49,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:49,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:49,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:11:49,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:49,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:11:49,319 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:11:49,319 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:11:49,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:11:49,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:11:49,361 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:49,361 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 40 treesize of output 42 [2025-04-29 11:11:49,403 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:49,404 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 52 treesize of output 57 [2025-04-29 11:11:49,420 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 56 treesize of output 45 [2025-04-29 11:11:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:49,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:49,486 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet6#1|)))))) is different from false [2025-04-29 11:11:49,523 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))))))) is different from false [2025-04-29 11:11:49,535 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))))))) is different from false [2025-04-29 11:11:49,547 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 2)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1)))))))) is different from false [2025-04-29 11:11:49,557 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet6#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet6#1|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet6#1|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet6#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_567) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4))))))) is different from false [2025-04-29 11:11:49,565 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:49,565 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 51 treesize of output 67 [2025-04-29 11:11:49,568 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:49,568 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 93 treesize of output 31 [2025-04-29 11:11:49,573 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:49,573 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 50 treesize of output 1 [2025-04-29 11:11:49,577 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:49,577 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 51 treesize of output 1 [2025-04-29 11:11:49,580 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:11:49,581 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 51 treesize of output 1 [2025-04-29 11:11:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:49,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971298112] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:11:49,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:11:49,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-04-29 11:11:49,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682296881] [2025-04-29 11:11:49,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:11:49,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:11:49,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:49,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:11:49,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=226, Unknown=14, NotChecked=170, Total=462 [2025-04-29 11:11:49,616 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-04-29 11:11:49,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 1643 transitions, 34938 flow. Second operand has 22 states, 22 states have (on average 49.04545454545455) internal successors, (1079), 22 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:49,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:49,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-04-29 11:11:49,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:55,840 INFO L116 PetriNetUnfolderBase]: 11126/24392 cut-off events. [2025-04-29 11:11:55,840 INFO L117 PetriNetUnfolderBase]: For 366404/368526 co-relation queries the response was YES. [2025-04-29 11:11:56,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157507 conditions, 24392 events. 11126/24392 cut-off events. For 366404/368526 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 238125 event pairs, 2298 based on Foata normal form. 712/23994 useless extension candidates. Maximal degree in co-relation 155754. Up to 13818 conditions per place. [2025-04-29 11:11:56,134 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 1073 selfloop transitions, 796 changer transitions 0/1922 dead transitions. [2025-04-29 11:11:56,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1922 transitions, 44487 flow [2025-04-29 11:11:56,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:11:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-29 11:11:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1096 transitions. [2025-04-29 11:11:56,135 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5768421052631579 [2025-04-29 11:11:56,135 INFO L175 Difference]: Start difference. First operand has 251 places, 1643 transitions, 34938 flow. Second operand 19 states and 1096 transitions. [2025-04-29 11:11:56,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1922 transitions, 44487 flow [2025-04-29 11:11:57,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 1922 transitions, 44145 flow, removed 116 selfloop flow, removed 13 redundant places. [2025-04-29 11:11:57,452 INFO L231 Difference]: Finished difference. Result has 263 places, 1837 transitions, 42815 flow [2025-04-29 11:11:57,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=34599, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=619, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=933, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=42815, PETRI_PLACES=263, PETRI_TRANSITIONS=1837} [2025-04-29 11:11:57,454 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 161 predicate places. [2025-04-29 11:11:57,454 INFO L485 AbstractCegarLoop]: Abstraction has has 263 places, 1837 transitions, 42815 flow [2025-04-29 11:11:57,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 49.04545454545455) internal successors, (1079), 22 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:57,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:57,455 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:57,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:11:57,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:11:57,656 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:57,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:57,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1493411627, now seen corresponding path program 8 times [2025-04-29 11:11:57,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:57,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610539780] [2025-04-29 11:11:57,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:11:57,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:57,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:11:57,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:57,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:11:57,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:57,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:57,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610539780] [2025-04-29 11:11:57,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610539780] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:57,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753969587] [2025-04-29 11:11:57,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:11:57,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:57,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:57,915 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:11:57,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:11:57,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-29 11:11:57,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:57,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:11:57,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:57,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:11:57,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:58,210 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:11:58,361 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:11:58,406 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:58,406 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-04-29 11:11:58,457 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:58,457 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-04-29 11:11:58,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:58,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:58,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:58,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:58,526 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:58,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-04-29 11:11:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:58,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... Killed by 15