./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3ac8edf9cc34df23835297b42f3eb24b0fecd781f1d2abb112aaac7f99695b4 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:29:54,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:29:54,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:29:54,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:29:54,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:29:54,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:29:54,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:29:54,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:29:54,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:29:54,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:29:54,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:29:54,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:29:54,778 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:29:54,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:29:54,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:29:54,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:29:54,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:29:54,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:29:54,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:29:54,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:29:54,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:29:54,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:29:54,779 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:29:54,779 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:29:54,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:29:54,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:29:54,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:29:54,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:29:54,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:29:54,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:29:54,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:29:54,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:54,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:29:54,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:29:54,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:29:54,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:54,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:29:54,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:29:54,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:29:54,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:29:54,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:29:54,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:29:54,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:29:54,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:29:54,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:29:54,781 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 -> c3ac8edf9cc34df23835297b42f3eb24b0fecd781f1d2abb112aaac7f99695b4 [2025-04-30 10:29:55,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:29:55,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:29:55,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:29:55,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:29:55,045 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:29:55,046 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.i [2025-04-30 10:29:56,386 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2043dbbc/2efd793e6a934e59bc0e6e0100a911e7/FLAGf7065c2db [2025-04-30 10:29:56,638 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:29:56,641 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array-race.i [2025-04-30 10:29:56,652 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2043dbbc/2efd793e6a934e59bc0e6e0100a911e7/FLAGf7065c2db [2025-04-30 10:29:57,436 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2043dbbc/2efd793e6a934e59bc0e6e0100a911e7 [2025-04-30 10:29:57,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:29:57,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:29:57,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:29:57,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:29:57,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:29:57,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bdfecd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57, skipping insertion in model container [2025-04-30 10:29:57,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:29:57,803 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:29:57,808 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:29:57,870 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:29:57,909 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:29:57,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57 WrapperNode [2025-04-30 10:29:57,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:29:57,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:29:57,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:29:57,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:29:57,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,954 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-04-30 10:29:57,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:29:57,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:29:57,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:29:57,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:29:57,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,977 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:57,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:29:57,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:29:57,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:29:57,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:29:57,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (1/1) ... [2025-04-30 10:29:58,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:58,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:29:58,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:29:58,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:29:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:29:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:29:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:29:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:29:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:29:58,044 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:29:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:29:58,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:29:58,045 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:29:58,147 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:29:58,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:29:58,310 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:29:58,310 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:29:58,318 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:29:58,319 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:29:58,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:29:58 BoogieIcfgContainer [2025-04-30 10:29:58,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:29:58,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:29:58,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:29:58,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:29:58,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:29:57" (1/3) ... [2025-04-30 10:29:58,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10755c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:29:58, skipping insertion in model container [2025-04-30 10:29:58,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:57" (2/3) ... [2025-04-30 10:29:58,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10755c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:29:58, skipping insertion in model container [2025-04-30 10:29:58,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:29:58" (3/3) ... [2025-04-30 10:29:58,328 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array-race.i [2025-04-30 10:29:58,338 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:29:58,341 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-in-array-race.i that has 2 procedures, 80 locations, 81 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-30 10:29:58,341 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:29:58,396 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:29:58,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 171 flow [2025-04-30 10:29:58,470 INFO L116 PetriNetUnfolderBase]: 2/112 cut-off events. [2025-04-30 10:29:58,471 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:29:58,473 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 6. Compared 190 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-30 10:29:58,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 171 flow [2025-04-30 10:29:58,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 171 flow [2025-04-30 10:29:58,482 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:29:58,493 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;@3e94d3e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:29:58,495 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-30 10:29:58,506 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:29:58,506 INFO L116 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-04-30 10:29:58,506 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:29:58,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:58,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:58,509 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-30 10:29:58,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash 99710370, now seen corresponding path program 1 times [2025-04-30 10:29:58,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:58,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740982743] [2025-04-30 10:29:58,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:58,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:58,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:29:58,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:29:58,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:58,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:58,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:58,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740982743] [2025-04-30 10:29:58,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740982743] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:58,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:58,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344273135] [2025-04-30 10:29:58,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:58,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:29:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:58,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:29:58,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:29:58,926 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 82 [2025-04-30 10:29:58,928 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-30 10:29:58,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:58,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 82 [2025-04-30 10:29:58,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:58,975 INFO L116 PetriNetUnfolderBase]: 1/118 cut-off events. [2025-04-30 10:29:58,975 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:29:58,975 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-30 10:29:58,976 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 11 selfloop transitions, 2 changer transitions 6/86 dead transitions. [2025-04-30 10:29:58,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 86 transitions, 215 flow [2025-04-30 10:29:58,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 428 transitions. [2025-04-30 10:29:58,985 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8699186991869918 [2025-04-30 10:29:58,986 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 171 flow. Second operand 6 states and 428 transitions. [2025-04-30 10:29:58,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 86 transitions, 215 flow [2025-04-30 10:29:58,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:58,991 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 185 flow [2025-04-30 10:29:58,992 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-30 10:29:58,994 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2025-04-30 10:29:58,994 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 185 flow [2025-04-30 10:29:58,994 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-30 10:29:58,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:58,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:58,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:29:58,995 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-30 10:29:58,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:58,995 INFO L85 PathProgramCache]: Analyzing trace with hash -376679316, now seen corresponding path program 1 times [2025-04-30 10:29:58,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:58,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110789206] [2025-04-30 10:29:58,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:58,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:59,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:29:59,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:29:59,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:59,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:59,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:59,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110789206] [2025-04-30 10:29:59,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110789206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:59,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:59,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:59,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060964378] [2025-04-30 10:29:59,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:59,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:59,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:59,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:59,466 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 82 [2025-04-30 10:29:59,467 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-30 10:29:59,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:59,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 82 [2025-04-30 10:29:59,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:59,602 INFO L116 PetriNetUnfolderBase]: 70/349 cut-off events. [2025-04-30 10:29:59,603 INFO L117 PetriNetUnfolderBase]: For 25/28 co-relation queries the response was YES. [2025-04-30 10:29:59,604 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 1668 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-30 10:29:59,606 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 23 selfloop transitions, 22 changer transitions 0/101 dead transitions. [2025-04-30 10:29:59,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 101 transitions, 317 flow [2025-04-30 10:29:59,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 388 transitions. [2025-04-30 10:29:59,610 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7886178861788617 [2025-04-30 10:29:59,610 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 185 flow. Second operand 6 states and 388 transitions. [2025-04-30 10:29:59,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 101 transitions, 317 flow [2025-04-30 10:29:59,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 101 transitions, 303 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-30 10:29:59,614 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 321 flow [2025-04-30 10:29:59,614 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-30 10:29:59,614 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2025-04-30 10:29:59,615 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 321 flow [2025-04-30 10:29:59,615 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-30 10:29:59,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:59,615 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-30 10:29:59,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:29:59,615 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-30 10:29:59,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1081544479, now seen corresponding path program 1 times [2025-04-30 10:29:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:59,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563474648] [2025-04-30 10:29:59,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:59,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:29:59,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:29:59,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:59,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:59,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:59,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563474648] [2025-04-30 10:29:59,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563474648] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:59,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:59,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:59,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344323695] [2025-04-30 10:29:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:59,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:59,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:59,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:59,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:59,949 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 82 [2025-04-30 10:29:59,949 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-30 10:29:59,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:59,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 82 [2025-04-30 10:29:59,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:00,111 INFO L116 PetriNetUnfolderBase]: 130/477 cut-off events. [2025-04-30 10:30:00,113 INFO L117 PetriNetUnfolderBase]: For 138/150 co-relation queries the response was YES. [2025-04-30 10:30:00,115 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 2453 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-30 10:30:00,118 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 33 selfloop transitions, 48 changer transitions 8/144 dead transitions. [2025-04-30 10:30:00,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 144 transitions, 639 flow [2025-04-30 10:30:00,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2025-04-30 10:30:00,120 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8719512195121951 [2025-04-30 10:30:00,120 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 321 flow. Second operand 6 states and 429 transitions. [2025-04-30 10:30:00,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 144 transitions, 639 flow [2025-04-30 10:30:00,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 639 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:00,127 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 693 flow [2025-04-30 10:30:00,128 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-30 10:30:00,128 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2025-04-30 10:30:00,129 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 693 flow [2025-04-30 10:30:00,129 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-30 10:30:00,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:00,129 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-30 10:30:00,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:30:00,130 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-30 10:30:00,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:00,130 INFO L85 PathProgramCache]: Analyzing trace with hash 873078197, now seen corresponding path program 1 times [2025-04-30 10:30:00,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:00,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222269783] [2025-04-30 10:30:00,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:00,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:00,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:30:00,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:30:00,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:00,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:00,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:00,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222269783] [2025-04-30 10:30:00,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222269783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:00,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:00,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331707165] [2025-04-30 10:30:00,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:00,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:00,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:00,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:00,515 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 82 [2025-04-30 10:30:00,516 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-30 10:30:00,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:00,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 82 [2025-04-30 10:30:00,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:00,646 INFO L116 PetriNetUnfolderBase]: 142/505 cut-off events. [2025-04-30 10:30:00,646 INFO L117 PetriNetUnfolderBase]: For 464/492 co-relation queries the response was YES. [2025-04-30 10:30:00,648 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 2808 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-30 10:30:00,651 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 73 selfloop transitions, 25 changer transitions 13/164 dead transitions. [2025-04-30 10:30:00,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1076 flow [2025-04-30 10:30:00,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2025-04-30 10:30:00,652 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.806910569105691 [2025-04-30 10:30:00,653 INFO L175 Difference]: Start difference. First operand has 103 places, 136 transitions, 693 flow. Second operand 6 states and 397 transitions. [2025-04-30 10:30:00,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1076 flow [2025-04-30 10:30:00,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 164 transitions, 1058 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:00,683 INFO L231 Difference]: Finished difference. Result has 105 places, 151 transitions, 910 flow [2025-04-30 10:30:00,683 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-30 10:30:00,683 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2025-04-30 10:30:00,683 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 151 transitions, 910 flow [2025-04-30 10:30:00,684 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-30 10:30:00,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:00,684 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-30 10:30:00,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:30:00,684 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-30 10:30:00,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash -587557824, now seen corresponding path program 1 times [2025-04-30 10:30:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:00,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845148391] [2025-04-30 10:30:00,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:00,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:00,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:30:00,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:30:00,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:00,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:00,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:30:00,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:30:00,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:30:00,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:00,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:00,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:30:00,739 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:30:00,739 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-30 10:30:00,740 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-30 10:30:00,740 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-30 10:30:00,741 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-30 10:30:00,741 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-30 10:30:00,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:30:00,741 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-30 10:30:00,743 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:30:00,743 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:30:00,762 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:30:00,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 100 transitions, 216 flow [2025-04-30 10:30:00,778 INFO L116 PetriNetUnfolderBase]: 4/192 cut-off events. [2025-04-30 10:30:00,778 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-30 10:30:00,779 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 7. Compared 409 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-30 10:30:00,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 100 transitions, 216 flow [2025-04-30 10:30:00,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 100 transitions, 216 flow [2025-04-30 10:30:00,782 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:00,782 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;@3e94d3e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:00,782 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-30 10:30:00,785 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:00,785 INFO L116 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-04-30 10:30:00,785 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:00,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:00,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:00,785 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-30 10:30:00,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1989298822, now seen corresponding path program 1 times [2025-04-30 10:30:00,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:00,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042976589] [2025-04-30 10:30:00,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:00,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:30:00,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:30:00,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:00,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:00,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:00,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042976589] [2025-04-30 10:30:00,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042976589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:00,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:00,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:00,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695458275] [2025-04-30 10:30:00,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:00,841 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:30:00,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:00,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:30:00,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:30:00,910 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 100 [2025-04-30 10:30:00,910 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-30 10:30:00,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:00,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 100 [2025-04-30 10:30:00,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:00,949 INFO L116 PetriNetUnfolderBase]: 3/198 cut-off events. [2025-04-30 10:30:00,950 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-30 10:30:00,950 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-30 10:30:00,950 INFO L140 encePairwiseOnDemand]: 91/100 looper letters, 14 selfloop transitions, 2 changer transitions 6/105 dead transitions. [2025-04-30 10:30:00,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 268 flow [2025-04-30 10:30:00,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2025-04-30 10:30:00,952 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2025-04-30 10:30:00,952 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 216 flow. Second operand 6 states and 527 transitions. [2025-04-30 10:30:00,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 268 flow [2025-04-30 10:30:00,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:00,954 INFO L231 Difference]: Finished difference. Result has 111 places, 99 transitions, 234 flow [2025-04-30 10:30:00,954 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-30 10:30:00,954 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 9 predicate places. [2025-04-30 10:30:00,954 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 99 transitions, 234 flow [2025-04-30 10:30:00,957 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-30 10:30:00,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:00,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:00,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:30:00,958 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-30 10:30:00,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1512909136, now seen corresponding path program 1 times [2025-04-30 10:30:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:00,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974476901] [2025-04-30 10:30:00,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:00,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:30:00,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:30:00,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:00,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:01,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:01,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974476901] [2025-04-30 10:30:01,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974476901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:01,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:01,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632970693] [2025-04-30 10:30:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:01,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:01,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:01,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:01,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:01,248 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 100 [2025-04-30 10:30:01,248 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-30 10:30:01,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:01,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 100 [2025-04-30 10:30:01,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:01,557 INFO L116 PetriNetUnfolderBase]: 902/2602 cut-off events. [2025-04-30 10:30:01,557 INFO L117 PetriNetUnfolderBase]: For 180/186 co-relation queries the response was YES. [2025-04-30 10:30:01,565 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 19736 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-30 10:30:01,575 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 31 selfloop transitions, 38 changer transitions 0/137 dead transitions. [2025-04-30 10:30:01,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 453 flow [2025-04-30 10:30:01,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 483 transitions. [2025-04-30 10:30:01,577 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.805 [2025-04-30 10:30:01,578 INFO L175 Difference]: Start difference. First operand has 111 places, 99 transitions, 234 flow. Second operand 6 states and 483 transitions. [2025-04-30 10:30:01,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 453 flow [2025-04-30 10:30:01,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 137 transitions, 441 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-30 10:30:01,585 INFO L231 Difference]: Finished difference. Result has 113 places, 136 transitions, 476 flow [2025-04-30 10:30:01,585 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-30 10:30:01,587 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 11 predicate places. [2025-04-30 10:30:01,587 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 136 transitions, 476 flow [2025-04-30 10:30:01,587 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-30 10:30:01,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:01,587 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-30 10:30:01,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:30:01,587 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-30 10:30:01,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash 431444149, now seen corresponding path program 1 times [2025-04-30 10:30:01,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:01,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515987800] [2025-04-30 10:30:01,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:01,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:30:01,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:30:01,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:01,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:01,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:01,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515987800] [2025-04-30 10:30:01,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515987800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:01,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:01,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:01,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341666321] [2025-04-30 10:30:01,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:01,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:01,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:01,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:01,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:01,834 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 100 [2025-04-30 10:30:01,835 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-30 10:30:01,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:01,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 100 [2025-04-30 10:30:01,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:02,284 INFO L116 PetriNetUnfolderBase]: 1866/4576 cut-off events. [2025-04-30 10:30:02,285 INFO L117 PetriNetUnfolderBase]: For 1538/1632 co-relation queries the response was YES. [2025-04-30 10:30:02,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10732 conditions, 4576 events. 1866/4576 cut-off events. For 1538/1632 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 35776 event pairs, 434 based on Foata normal form. 0/4276 useless extension candidates. Maximal degree in co-relation 8528. Up to 2580 conditions per place. [2025-04-30 10:30:02,310 INFO L140 encePairwiseOnDemand]: 81/100 looper letters, 63 selfloop transitions, 92 changer transitions 0/231 dead transitions. [2025-04-30 10:30:02,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 231 transitions, 1222 flow [2025-04-30 10:30:02,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-04-30 10:30:02,312 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-04-30 10:30:02,312 INFO L175 Difference]: Start difference. First operand has 113 places, 136 transitions, 476 flow. Second operand 6 states and 531 transitions. [2025-04-30 10:30:02,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 231 transitions, 1222 flow [2025-04-30 10:30:02,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 1222 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:02,320 INFO L231 Difference]: Finished difference. Result has 123 places, 223 transitions, 1312 flow [2025-04-30 10:30:02,320 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-30 10:30:02,321 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2025-04-30 10:30:02,321 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 223 transitions, 1312 flow [2025-04-30 10:30:02,321 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-30 10:30:02,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:02,321 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-30 10:30:02,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:30:02,322 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-30 10:30:02,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1837979195, now seen corresponding path program 1 times [2025-04-30 10:30:02,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:02,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380256391] [2025-04-30 10:30:02,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:02,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:02,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:30:02,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:30:02,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:02,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:02,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:02,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380256391] [2025-04-30 10:30:02,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380256391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:02,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:02,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:02,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602205755] [2025-04-30 10:30:02,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:02,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:02,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:02,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:02,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:02,599 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 100 [2025-04-30 10:30:02,600 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-30 10:30:02,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:02,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 100 [2025-04-30 10:30:02,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:03,135 INFO L116 PetriNetUnfolderBase]: 2323/5525 cut-off events. [2025-04-30 10:30:03,135 INFO L117 PetriNetUnfolderBase]: For 5276/5433 co-relation queries the response was YES. [2025-04-30 10:30:03,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17450 conditions, 5525 events. 2323/5525 cut-off events. For 5276/5433 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 44220 event pairs, 290 based on Foata normal form. 2/5296 useless extension candidates. Maximal degree in co-relation 13995. Up to 3131 conditions per place. [2025-04-30 10:30:03,180 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 145 selfloop transitions, 76 changer transitions 0/296 dead transitions. [2025-04-30 10:30:03,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 296 transitions, 2246 flow [2025-04-30 10:30:03,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-04-30 10:30:03,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8233333333333334 [2025-04-30 10:30:03,182 INFO L175 Difference]: Start difference. First operand has 123 places, 223 transitions, 1312 flow. Second operand 6 states and 494 transitions. [2025-04-30 10:30:03,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 296 transitions, 2246 flow [2025-04-30 10:30:03,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 296 transitions, 2228 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:03,222 INFO L231 Difference]: Finished difference. Result has 133 places, 294 transitions, 2152 flow [2025-04-30 10:30:03,223 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-30 10:30:03,224 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2025-04-30 10:30:03,225 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2152 flow [2025-04-30 10:30:03,226 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-30 10:30:03,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:03,226 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-30 10:30:03,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:30:03,226 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-30 10:30:03,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash -553442824, now seen corresponding path program 1 times [2025-04-30 10:30:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:03,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435047681] [2025-04-30 10:30:03,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:03,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:30:03,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:30:03,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:03,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:03,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:03,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435047681] [2025-04-30 10:30:03,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435047681] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:03,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:03,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-30 10:30:03,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237460928] [2025-04-30 10:30:03,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:03,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:30:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:03,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:30:03,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:30:04,139 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-04-30 10:30:04,140 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-30 10:30:04,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:04,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-04-30 10:30:04,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:05,312 INFO L116 PetriNetUnfolderBase]: 3293/7899 cut-off events. [2025-04-30 10:30:05,313 INFO L117 PetriNetUnfolderBase]: For 12923/13227 co-relation queries the response was YES. [2025-04-30 10:30:05,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27623 conditions, 7899 events. 3293/7899 cut-off events. For 12923/13227 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 67153 event pairs, 332 based on Foata normal form. 84/7676 useless extension candidates. Maximal degree in co-relation 23481. Up to 3814 conditions per place. [2025-04-30 10:30:05,361 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 229 selfloop transitions, 135 changer transitions 0/427 dead transitions. [2025-04-30 10:30:05,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 427 transitions, 3993 flow [2025-04-30 10:30:05,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:30:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-30 10:30:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1151 transitions. [2025-04-30 10:30:05,366 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6770588235294117 [2025-04-30 10:30:05,366 INFO L175 Difference]: Start difference. First operand has 133 places, 294 transitions, 2152 flow. Second operand 17 states and 1151 transitions. [2025-04-30 10:30:05,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 427 transitions, 3993 flow [2025-04-30 10:30:05,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 427 transitions, 3849 flow, removed 72 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:05,408 INFO L231 Difference]: Finished difference. Result has 157 places, 353 transitions, 3118 flow [2025-04-30 10:30:05,409 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-30 10:30:05,410 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 55 predicate places. [2025-04-30 10:30:05,410 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 353 transitions, 3118 flow [2025-04-30 10:30:05,411 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-30 10:30:05,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:05,411 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-30 10:30:05,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:30:05,411 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-30 10:30:05,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1442050683, now seen corresponding path program 1 times [2025-04-30 10:30:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:05,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353360211] [2025-04-30 10:30:05,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:05,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:30:05,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:30:05,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:05,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:05,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:05,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353360211] [2025-04-30 10:30:05,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353360211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:05,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:05,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-30 10:30:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889228265] [2025-04-30 10:30:05,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:05,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:30:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:05,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:30:05,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:30:06,119 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 100 [2025-04-30 10:30:06,120 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-30 10:30:06,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:06,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 100 [2025-04-30 10:30:06,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:07,646 INFO L116 PetriNetUnfolderBase]: 3990/9019 cut-off events. [2025-04-30 10:30:07,646 INFO L117 PetriNetUnfolderBase]: For 20881/21508 co-relation queries the response was YES. [2025-04-30 10:30:07,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36290 conditions, 9019 events. 3990/9019 cut-off events. For 20881/21508 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 76332 event pairs, 273 based on Foata normal form. 292/9059 useless extension candidates. Maximal degree in co-relation 31647. Up to 3195 conditions per place. [2025-04-30 10:30:07,723 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 366 selfloop transitions, 366 changer transitions 1/805 dead transitions. [2025-04-30 10:30:07,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 805 transitions, 8690 flow [2025-04-30 10:30:07,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:30:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-30 10:30:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1662 transitions. [2025-04-30 10:30:07,730 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7226086956521739 [2025-04-30 10:30:07,730 INFO L175 Difference]: Start difference. First operand has 157 places, 353 transitions, 3118 flow. Second operand 23 states and 1662 transitions. [2025-04-30 10:30:07,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 805 transitions, 8690 flow [2025-04-30 10:30:07,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 805 transitions, 8632 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-04-30 10:30:07,816 INFO L231 Difference]: Finished difference. Result has 183 places, 671 transitions, 7920 flow [2025-04-30 10:30:07,817 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-30 10:30:07,817 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 81 predicate places. [2025-04-30 10:30:07,818 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 671 transitions, 7920 flow [2025-04-30 10:30:07,819 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-30 10:30:07,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:07,819 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-30 10:30:07,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:30:07,819 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-30 10:30:07,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:07,820 INFO L85 PathProgramCache]: Analyzing trace with hash 388131602, now seen corresponding path program 2 times [2025-04-30 10:30:07,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:07,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017194957] [2025-04-30 10:30:07,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:30:07,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:07,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:30:07,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:30:07,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:30:07,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:08,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:08,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017194957] [2025-04-30 10:30:08,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017194957] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:08,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:08,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-30 10:30:08,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455734563] [2025-04-30 10:30:08,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:08,203 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:30:08,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:08,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:30:08,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:30:08,689 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-04-30 10:30:08,690 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-30 10:30:08,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:08,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-04-30 10:30:08,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:10,492 INFO L116 PetriNetUnfolderBase]: 4543/10351 cut-off events. [2025-04-30 10:30:10,492 INFO L117 PetriNetUnfolderBase]: For 56664/57190 co-relation queries the response was YES. [2025-04-30 10:30:10,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52457 conditions, 10351 events. 4543/10351 cut-off events. For 56664/57190 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 88731 event pairs, 327 based on Foata normal form. 185/10207 useless extension candidates. Maximal degree in co-relation 51344. Up to 4299 conditions per place. [2025-04-30 10:30:10,562 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 557 selfloop transitions, 371 changer transitions 0/1000 dead transitions. [2025-04-30 10:30:10,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1000 transitions, 14068 flow [2025-04-30 10:30:10,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:30:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:30:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1429 transitions. [2025-04-30 10:30:10,567 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6804761904761905 [2025-04-30 10:30:10,567 INFO L175 Difference]: Start difference. First operand has 183 places, 671 transitions, 7920 flow. Second operand 21 states and 1429 transitions. [2025-04-30 10:30:10,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1000 transitions, 14068 flow [2025-04-30 10:30:10,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1000 transitions, 13844 flow, removed 106 selfloop flow, removed 6 redundant places. [2025-04-30 10:30:10,794 INFO L231 Difference]: Finished difference. Result has 204 places, 894 transitions, 12467 flow [2025-04-30 10:30:10,795 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-30 10:30:10,796 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 102 predicate places. [2025-04-30 10:30:10,796 INFO L485 AbstractCegarLoop]: Abstraction has has 204 places, 894 transitions, 12467 flow [2025-04-30 10:30:10,797 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-30 10:30:10,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:10,797 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-30 10:30:10,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:30:10,798 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-30 10:30:10,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -967998056, now seen corresponding path program 3 times [2025-04-30 10:30:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:10,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131593162] [2025-04-30 10:30:10,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:30:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:10,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 3 equivalence classes. [2025-04-30 10:30:10,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:30:10,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:30:10,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:11,365 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-30 10:30:11,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:11,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131593162] [2025-04-30 10:30:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131593162] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:30:11,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353732117] [2025-04-30 10:30:11,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:30:11,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:30:11,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:30:11,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:30:11,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:30:11,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 3 equivalence classes. [2025-04-30 10:30:11,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:30:11,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:30:11,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:11,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:30:11,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:30:11,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:30:11,570 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:30:11,570 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:30:11,657 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-30 10:30:11,666 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-30 10:30:11,680 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:11,680 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-30 10:30:11,700 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:11,700 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-30 10:30:11,772 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-30 10:30:11,781 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-30 10:30:11,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:30:11,854 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_316 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))) (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2025-04-30 10:30:11,900 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_316 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2025-04-30 10:30:11,915 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~nondet9#1|)))) (and (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_316 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_316 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_316) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:15,861 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:15,863 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-30 10:30:15,872 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:15,872 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-30 10:30:15,880 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:15,880 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-30 10:30:15,885 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:15,885 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-30 10:30:15,890 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:15,891 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-30 10:30:15,970 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-30 10:30:15,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353732117] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:30:15,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:30:15,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 31 [2025-04-30 10:30:15,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043651798] [2025-04-30 10:30:15,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:30:15,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:30:15,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:15,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:30:15,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=701, Unknown=34, NotChecked=168, Total=992 [2025-04-30 10:30:15,984 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 100 [2025-04-30 10:30:15,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 894 transitions, 12467 flow. Second operand has 32 states, 32 states have (on average 38.4375) internal successors, (1230), 32 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:15,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:15,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 100 [2025-04-30 10:30:15,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:22,905 INFO L116 PetriNetUnfolderBase]: 14598/29816 cut-off events. [2025-04-30 10:30:22,905 INFO L117 PetriNetUnfolderBase]: For 224450/227323 co-relation queries the response was YES. [2025-04-30 10:30:23,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157152 conditions, 29816 events. 14598/29816 cut-off events. For 224450/227323 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 284770 event pairs, 2396 based on Foata normal form. 558/28874 useless extension candidates. Maximal degree in co-relation 154670. Up to 12171 conditions per place. [2025-04-30 10:30:23,178 INFO L140 encePairwiseOnDemand]: 64/100 looper letters, 1125 selfloop transitions, 639 changer transitions 1/1808 dead transitions. [2025-04-30 10:30:23,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 1808 transitions, 30102 flow [2025-04-30 10:30:23,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-30 10:30:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-30 10:30:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 1690 transitions. [2025-04-30 10:30:23,181 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2025-04-30 10:30:23,181 INFO L175 Difference]: Start difference. First operand has 204 places, 894 transitions, 12467 flow. Second operand 36 states and 1690 transitions. [2025-04-30 10:30:23,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 1808 transitions, 30102 flow [2025-04-30 10:30:23,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 1808 transitions, 29574 flow, removed 243 selfloop flow, removed 12 redundant places. [2025-04-30 10:30:23,973 INFO L231 Difference]: Finished difference. Result has 242 places, 1311 transitions, 22401 flow [2025-04-30 10:30:23,974 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=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=22401, PETRI_PLACES=242, PETRI_TRANSITIONS=1311} [2025-04-30 10:30:23,974 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 140 predicate places. [2025-04-30 10:30:23,974 INFO L485 AbstractCegarLoop]: Abstraction has has 242 places, 1311 transitions, 22401 flow [2025-04-30 10:30:23,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 38.4375) internal successors, (1230), 32 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:23,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:23,975 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-30 10:30:23,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:30:24,175 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-30 10:30:24,176 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-30 10:30:24,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash -674310436, now seen corresponding path program 4 times [2025-04-30 10:30:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:24,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183659711] [2025-04-30 10:30:24,176 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:30:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:24,185 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-30 10:30:24,193 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:30:24,193 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:30:24,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:24,549 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-30 10:30:24,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:24,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183659711] [2025-04-30 10:30:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183659711] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:30:24,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825561885] [2025-04-30 10:30:24,550 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:30:24,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:30:24,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:30:24,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:30:24,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:30:24,606 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-30 10:30:24,642 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:30:24,643 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:30:24,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:24,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-30 10:30:24,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:30:24,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:30:24,662 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:30:24,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:30:24,701 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-30 10:30:24,728 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-30 10:30:24,741 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:24,741 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-30 10:30:24,758 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:24,759 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-30 10:30:24,794 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-30 10:30:24,803 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-30 10:30:24,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:30:24,825 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_381 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)))) (forall ((v_ArrVal_381 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_381 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))) (forall ((v_ArrVal_381 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))))) is different from false [2025-04-30 10:30:24,854 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~nondet9#1|)))) (and (forall ((v_ArrVal_381 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_381 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)))) (forall ((v_ArrVal_381 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_381 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:24,874 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~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_381 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_381 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_381 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_381 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:24,895 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse1 (+ |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|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_381 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_381 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_381 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_381 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:24,953 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.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 (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_381 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_381 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))) (forall ((v_ArrVal_381 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_381 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_381) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:24,968 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:24,969 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-30 10:30:24,975 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:24,976 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-30 10:30:24,984 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:24,985 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-30 10:30:24,994 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:24,994 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-30 10:30:25,001 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:25,001 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-30 10:30:25,052 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-30 10:30:25,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825561885] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:30:25,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:30:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-04-30 10:30:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737258456] [2025-04-30 10:30:25,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:30:25,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:30:25,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:25,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:30:25,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=206, Unknown=5, NotChecked=160, Total=420 [2025-04-30 10:30:25,109 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-04-30 10:30:25,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 1311 transitions, 22401 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-30 10:30:25,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:25,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-04-30 10:30:25,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:32,660 INFO L116 PetriNetUnfolderBase]: 15977/33569 cut-off events. [2025-04-30 10:30:32,660 INFO L117 PetriNetUnfolderBase]: For 340225/342425 co-relation queries the response was YES. [2025-04-30 10:30:32,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194580 conditions, 33569 events. 15977/33569 cut-off events. For 340225/342425 co-relation queries the response was YES. Maximal size of possible extension queue 1236. Compared 333993 event pairs, 3140 based on Foata normal form. 680/32690 useless extension candidates. Maximal degree in co-relation 192256. Up to 17737 conditions per place. [2025-04-30 10:30:33,064 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 818 selfloop transitions, 973 changer transitions 1/1846 dead transitions. [2025-04-30 10:30:33,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 1846 transitions, 35625 flow [2025-04-30 10:30:33,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:30:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-30 10:30:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1169 transitions. [2025-04-30 10:30:33,066 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5845 [2025-04-30 10:30:33,066 INFO L175 Difference]: Start difference. First operand has 242 places, 1311 transitions, 22401 flow. Second operand 20 states and 1169 transitions. [2025-04-30 10:30:33,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 1846 transitions, 35625 flow [2025-04-30 10:30:34,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 1846 transitions, 35358 flow, removed 96 selfloop flow, removed 16 redundant places. [2025-04-30 10:30:34,766 INFO L231 Difference]: Finished difference. Result has 251 places, 1695 transitions, 33355 flow [2025-04-30 10:30:34,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=22134, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=630, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=33355, PETRI_PLACES=251, PETRI_TRANSITIONS=1695} [2025-04-30 10:30:34,768 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 149 predicate places. [2025-04-30 10:30:34,768 INFO L485 AbstractCegarLoop]: Abstraction has has 251 places, 1695 transitions, 33355 flow [2025-04-30 10:30:34,768 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-30 10:30:34,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:34,768 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-30 10:30:34,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:30:34,969 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-30 10:30:34,969 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-30 10:30:34,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:34,970 INFO L85 PathProgramCache]: Analyzing trace with hash 882343260, now seen corresponding path program 5 times [2025-04-30 10:30:34,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:34,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229117515] [2025-04-30 10:30:34,970 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:30:34,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:34,982 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 3 equivalence classes. [2025-04-30 10:30:34,992 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:30:34,992 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-30 10:30:34,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:35,364 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-30 10:30:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:35,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229117515] [2025-04-30 10:30:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229117515] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:30:35,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94851626] [2025-04-30 10:30:35,364 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:30:35,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:30:35,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:30:35,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:30:35,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:30:35,421 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 3 equivalence classes. [2025-04-30 10:30:35,438 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:30:35,438 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-30 10:30:35,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:35,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:30:35,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:30:35,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:30:35,454 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:30:35,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:30:35,484 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-30 10:30:35,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-30 10:30:35,502 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:35,502 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-30 10:30:35,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:35,548 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-30 10:30:35,574 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-30 10:30:35,582 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-30 10:30:35,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:30:35,602 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2025-04-30 10:30:35,625 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~nondet9#1|)))) (and (forall ((v_ArrVal_445 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)))) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))))))) is different from false [2025-04-30 10:30:35,674 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~nondet9#1|)))) (and (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:35,689 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~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_445 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:35,705 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse1 (+ |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|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_445 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3))) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_445) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:35,718 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:35,718 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-30 10:30:35,723 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:35,724 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-30 10:30:35,734 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:35,734 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-30 10:30:35,738 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:35,738 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-30 10:30:35,742 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:35,742 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-30 10:30:35,800 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-30 10:30:35,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94851626] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:30:35,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:30:35,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-04-30 10:30:35,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823430813] [2025-04-30 10:30:35,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:30:35,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:30:35,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:35,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:30:35,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=206, Unknown=5, NotChecked=160, Total=420 [2025-04-30 10:30:35,843 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-04-30 10:30:35,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 1695 transitions, 33355 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-30 10:30:35,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:35,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-04-30 10:30:35,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:45,776 INFO L116 PetriNetUnfolderBase]: 16817/35924 cut-off events. [2025-04-30 10:30:45,776 INFO L117 PetriNetUnfolderBase]: For 489175/492459 co-relation queries the response was YES. [2025-04-30 10:30:46,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226794 conditions, 35924 events. 16817/35924 cut-off events. For 489175/492459 co-relation queries the response was YES. Maximal size of possible extension queue 1380. Compared 366752 event pairs, 3679 based on Foata normal form. 920/35181 useless extension candidates. Maximal degree in co-relation 224464. Up to 20649 conditions per place. [2025-04-30 10:30:46,276 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 959 selfloop transitions, 1003 changer transitions 1/2017 dead transitions. [2025-04-30 10:30:46,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 2017 transitions, 43596 flow [2025-04-30 10:30:46,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:30:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-30 10:30:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1167 transitions. [2025-04-30 10:30:46,278 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5835 [2025-04-30 10:30:46,278 INFO L175 Difference]: Start difference. First operand has 251 places, 1695 transitions, 33355 flow. Second operand 20 states and 1167 transitions. [2025-04-30 10:30:46,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 2017 transitions, 43596 flow [2025-04-30 10:30:48,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 2017 transitions, 42637 flow, removed 449 selfloop flow, removed 12 redundant places. [2025-04-30 10:30:48,499 INFO L231 Difference]: Finished difference. Result has 263 places, 1900 transitions, 41420 flow [2025-04-30 10:30:48,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=32512, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=818, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=804, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=41420, PETRI_PLACES=263, PETRI_TRANSITIONS=1900} [2025-04-30 10:30:48,500 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 161 predicate places. [2025-04-30 10:30:48,500 INFO L485 AbstractCegarLoop]: Abstraction has has 263 places, 1900 transitions, 41420 flow [2025-04-30 10:30:48,501 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-30 10:30:48,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:48,501 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-30 10:30:48,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:30:48,701 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-30 10:30:48,702 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-30 10:30:48,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash -463958784, now seen corresponding path program 6 times [2025-04-30 10:30:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:48,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844758165] [2025-04-30 10:30:48,702 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:30:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:48,710 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 3 equivalence classes. [2025-04-30 10:30:48,724 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:30:48,724 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-30 10:30:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:49,265 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-30 10:30:49,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:49,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844758165] [2025-04-30 10:30:49,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844758165] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:30:49,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695760498] [2025-04-30 10:30:49,266 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:30:49,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:30:49,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:30:49,268 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:30:49,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:30:49,315 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 3 equivalence classes. [2025-04-30 10:30:49,366 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:30:49,367 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-30 10:30:49,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:49,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:30:49,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:30:49,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:30:49,415 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:30:49,415 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:30:49,481 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-30 10:30:49,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-30 10:30:49,520 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:49,520 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-30 10:30:49,534 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:49,535 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-30 10:30:49,561 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-30 10:30:49,569 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-30 10:30:49,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:30:49,588 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))) (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))) (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2025-04-30 10:30:49,609 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~nondet9#1|)))) (and (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)))) (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:49,623 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse1 (+ |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|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)))) (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:49,686 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~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))) (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:49,700 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 1)) (.cse4 (+ |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 (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_509 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_509) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-04-30 10:30:49,714 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:49,714 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-30 10:30:49,720 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:30:49,720 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-30 10:30:49,728 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:49,729 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-30 10:30:49,734 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:49,734 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-30 10:30:49,740 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:30:49,740 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-30 10:30:49,808 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-30 10:30:49,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695760498] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:30:49,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:30:49,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 31 [2025-04-30 10:30:49,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606260681] [2025-04-30 10:30:49,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:30:49,809 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:30:49,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:49,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:30:49,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=640, Unknown=5, NotChecked=270, Total=992 [2025-04-30 10:30:49,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 100 [2025-04-30 10:30:49,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1900 transitions, 41420 flow. Second operand has 32 states, 32 states have (on average 38.4375) internal successors, (1230), 32 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:49,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:49,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 100 [2025-04-30 10:30:49,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15