./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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 ../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:45:44,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:45:44,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:45:44,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:45:44,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:45:44,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:45:44,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:45:44,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:45:44,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:45:44,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:45:44,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:45:44,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:45:44,416 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:45:44,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:45:44,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:45:44,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:44,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:45:44,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:45:44,421 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:45:44,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:45:44,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:45:44,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:45:44,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:45:44,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:45:44,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:45:44,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:45:44,421 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 -> 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 [2025-03-04 06:45:44,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:45:44,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:45:44,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:45:44,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:45:44,650 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:45:44,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2025-03-04 06:45:45,846 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32190b7f/9650e3c69b894b1fbbe9e01718bffc00/FLAG0d36cc5a5 [2025-03-04 06:45:46,136 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:45:46,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2025-03-04 06:45:46,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32190b7f/9650e3c69b894b1fbbe9e01718bffc00/FLAG0d36cc5a5 [2025-03-04 06:45:46,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32190b7f/9650e3c69b894b1fbbe9e01718bffc00 [2025-03-04 06:45:46,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:45:46,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:45:46,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:46,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:45:46,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:45:46,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333f7a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46, skipping insertion in model container [2025-03-04 06:45:46,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:45:46,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:46,520 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:45:46,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:46,609 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:45:46,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46 WrapperNode [2025-03-04 06:45:46,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:46,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:46,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:45:46,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:45:46,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,649 INFO L138 Inliner]: procedures = 368, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2025-03-04 06:45:46,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:46,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:45:46,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:45:46,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:45:46,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:45:46,690 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:45:46,690 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:45:46,690 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:45:46,691 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (1/1) ... [2025-03-04 06:45:46,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:46,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:46,718 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-03-04 06:45:46,721 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-03-04 06:45:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:45:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:45:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:45:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:45:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:45:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:45:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:45:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:45:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:45:46,738 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:45:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:45:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:45:46,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:45:46,739 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:45:46,843 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:45:46,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:45:47,217 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:45:47,217 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:45:47,246 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:45:47,246 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:45:47,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:47 BoogieIcfgContainer [2025-03-04 06:45:47,247 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:45:47,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:45:47,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:45:47,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:45:47,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:45:46" (1/3) ... [2025-03-04 06:45:47,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5cb579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:47, skipping insertion in model container [2025-03-04 06:45:47,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:46" (2/3) ... [2025-03-04 06:45:47,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5cb579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:47, skipping insertion in model container [2025-03-04 06:45:47,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:47" (3/3) ... [2025-03-04 06:45:47,256 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2025-03-04 06:45:47,267 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:45:47,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_03-list2_rc.i that has 2 procedures, 277 locations, 1 initial locations, 0 loop locations, and 28 error locations. [2025-03-04 06:45:47,269 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:45:47,338 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:45:47,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 276 transitions, 556 flow [2025-03-04 06:45:47,434 INFO L124 PetriNetUnfolderBase]: 0/275 cut-off events. [2025-03-04 06:45:47,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:47,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 275 events. 0/275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 186 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-04 06:45:47,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 276 transitions, 556 flow [2025-03-04 06:45:47,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 275 transitions, 553 flow [2025-03-04 06:45:47,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:45:47,460 INFO L333 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;@891edd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:45:47,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-03-04 06:45:47,468 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:45:47,468 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-04 06:45:47,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:47,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:47,470 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] [2025-03-04 06:45:47,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:47,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:47,474 INFO L85 PathProgramCache]: Analyzing trace with hash 568170434, now seen corresponding path program 1 times [2025-03-04 06:45:47,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:47,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715841443] [2025-03-04 06:45:47,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:47,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:47,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:45:47,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:45:47,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:47,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715841443] [2025-03-04 06:45:48,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715841443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:48,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:48,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:48,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770289963] [2025-03-04 06:45:48,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:48,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:48,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:48,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:48,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:48,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2025-03-04 06:45:48,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 275 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-03-04 06:45:48,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:48,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2025-03-04 06:45:48,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:49,025 INFO L124 PetriNetUnfolderBase]: 560/2328 cut-off events. [2025-03-04 06:45:49,025 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:49,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 2328 events. 560/2328 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14981 event pairs, 560 based on Foata normal form. 0/2119 useless extension candidates. Maximal degree in co-relation 3353. Up to 1193 conditions per place. [2025-03-04 06:45:49,042 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/272 dead transitions. [2025-03-04 06:45:49,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 272 transitions, 721 flow [2025-03-04 06:45:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2025-03-04 06:45:49,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-03-04 06:45:49,060 INFO L175 Difference]: Start difference. First operand has 279 places, 275 transitions, 553 flow. Second operand 6 states and 1206 transitions. [2025-03-04 06:45:49,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 272 transitions, 721 flow [2025-03-04 06:45:49,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 272 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:49,072 INFO L231 Difference]: Finished difference. Result has 280 places, 272 transitions, 576 flow [2025-03-04 06:45:49,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=280, PETRI_TRANSITIONS=272} [2025-03-04 06:45:49,078 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2025-03-04 06:45:49,079 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 272 transitions, 576 flow [2025-03-04 06:45:49,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-03-04 06:45:49,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:49,081 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-03-04 06:45:49,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:45:49,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:49,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash 362021852, now seen corresponding path program 1 times [2025-03-04 06:45:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:49,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852608649] [2025-03-04 06:45:49,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:49,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:45:49,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:45:49,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:49,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:49,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:49,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852608649] [2025-03-04 06:45:49,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852608649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:49,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:49,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:49,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459542206] [2025-03-04 06:45:49,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:49,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:49,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:49,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:49,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:49,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2025-03-04 06:45:49,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 272 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-03-04 06:45:49,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:49,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2025-03-04 06:45:49,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:50,024 INFO L124 PetriNetUnfolderBase]: 560/2325 cut-off events. [2025-03-04 06:45:50,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:50,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3552 conditions, 2325 events. 560/2325 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14927 event pairs, 560 based on Foata normal form. 0/2119 useless extension candidates. Maximal degree in co-relation 3394. Up to 1193 conditions per place. [2025-03-04 06:45:50,037 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/269 dead transitions. [2025-03-04 06:45:50,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 269 transitions, 744 flow [2025-03-04 06:45:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2025-03-04 06:45:50,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-03-04 06:45:50,040 INFO L175 Difference]: Start difference. First operand has 280 places, 272 transitions, 576 flow. Second operand 6 states and 1206 transitions. [2025-03-04 06:45:50,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 269 transitions, 744 flow [2025-03-04 06:45:50,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 269 transitions, 714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:45:50,048 INFO L231 Difference]: Finished difference. Result has 277 places, 269 transitions, 570 flow [2025-03-04 06:45:50,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=269} [2025-03-04 06:45:50,049 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -2 predicate places. [2025-03-04 06:45:50,049 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 269 transitions, 570 flow [2025-03-04 06:45:50,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-03-04 06:45:50,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:50,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:50,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:45:50,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:50,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1063909003, now seen corresponding path program 1 times [2025-03-04 06:45:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:50,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150394247] [2025-03-04 06:45:50,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:50,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:50,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:45:50,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:45:50,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:50,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:50,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150394247] [2025-03-04 06:45:50,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150394247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:50,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:50,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:45:50,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713632831] [2025-03-04 06:45:50,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:50,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:50,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:50,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:50,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:50,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2025-03-04 06:45:50,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 269 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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-03-04 06:45:50,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:50,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2025-03-04 06:45:50,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:50,193 INFO L124 PetriNetUnfolderBase]: 30/718 cut-off events. [2025-03-04 06:45:50,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:50,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 718 events. 30/718 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2656 event pairs, 30 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2025-03-04 06:45:50,196 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-03-04 06:45:50,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 268 transitions, 606 flow [2025-03-04 06:45:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-03-04 06:45:50,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2025-03-04 06:45:50,198 INFO L175 Difference]: Start difference. First operand has 277 places, 269 transitions, 570 flow. Second operand 3 states and 788 transitions. [2025-03-04 06:45:50,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 268 transitions, 606 flow [2025-03-04 06:45:50,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 268 transitions, 576 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:45:50,201 INFO L231 Difference]: Finished difference. Result has 273 places, 268 transitions, 542 flow [2025-03-04 06:45:50,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=273, PETRI_TRANSITIONS=268} [2025-03-04 06:45:50,202 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -6 predicate places. [2025-03-04 06:45:50,202 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 268 transitions, 542 flow [2025-03-04 06:45:50,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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-03-04 06:45:50,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:50,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:50,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:45:50,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:50,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:50,203 INFO L85 PathProgramCache]: Analyzing trace with hash -172935321, now seen corresponding path program 1 times [2025-03-04 06:45:50,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:50,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433838607] [2025-03-04 06:45:50,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:50,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 06:45:50,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 06:45:50,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:50,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:50,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:50,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433838607] [2025-03-04 06:45:50,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433838607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:50,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:50,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:45:50,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857348328] [2025-03-04 06:45:50,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:50,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:50,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:50,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:50,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:50,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2025-03-04 06:45:50,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 268 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-03-04 06:45:50,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:50,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2025-03-04 06:45:50,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:50,311 INFO L124 PetriNetUnfolderBase]: 36/750 cut-off events. [2025-03-04 06:45:50,311 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:50,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 750 events. 36/750 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3013 event pairs, 36 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 788. Up to 89 conditions per place. [2025-03-04 06:45:50,314 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/264 dead transitions. [2025-03-04 06:45:50,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 264 transitions, 570 flow [2025-03-04 06:45:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-04 06:45:50,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2025-03-04 06:45:50,315 INFO L175 Difference]: Start difference. First operand has 273 places, 268 transitions, 542 flow. Second operand 3 states and 784 transitions. [2025-03-04 06:45:50,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 264 transitions, 570 flow [2025-03-04 06:45:50,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 264 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:45:50,319 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 532 flow [2025-03-04 06:45:50,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=269, PETRI_TRANSITIONS=264} [2025-03-04 06:45:50,319 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -10 predicate places. [2025-03-04 06:45:50,320 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 532 flow [2025-03-04 06:45:50,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-03-04 06:45:50,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:50,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:50,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:45:50,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:50,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:50,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1900652836, now seen corresponding path program 1 times [2025-03-04 06:45:50,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:50,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702195207] [2025-03-04 06:45:50,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:50,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:50,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 06:45:50,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 06:45:50,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:50,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:50,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702195207] [2025-03-04 06:45:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702195207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:50,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:50,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:50,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501341931] [2025-03-04 06:45:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:50,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:50,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:50,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:50,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:50,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2025-03-04 06:45:50,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 264 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 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-03-04 06:45:50,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:50,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2025-03-04 06:45:50,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:51,221 INFO L124 PetriNetUnfolderBase]: 638/2519 cut-off events. [2025-03-04 06:45:51,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:51,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3891 conditions, 2519 events. 638/2519 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 16189 event pairs, 638 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 3822. Up to 1362 conditions per place. [2025-03-04 06:45:51,231 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/263 dead transitions. [2025-03-04 06:45:51,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 263 transitions, 710 flow [2025-03-04 06:45:51,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2025-03-04 06:45:51,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2025-03-04 06:45:51,235 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 532 flow. Second operand 6 states and 1201 transitions. [2025-03-04 06:45:51,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 263 transitions, 710 flow [2025-03-04 06:45:51,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 263 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:51,241 INFO L231 Difference]: Finished difference. Result has 272 places, 263 transitions, 539 flow [2025-03-04 06:45:51,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=272, PETRI_TRANSITIONS=263} [2025-03-04 06:45:51,243 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -7 predicate places. [2025-03-04 06:45:51,243 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 263 transitions, 539 flow [2025-03-04 06:45:51,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 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-03-04 06:45:51,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:51,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:51,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:45:51,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:51,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1480404944, now seen corresponding path program 1 times [2025-03-04 06:45:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93139193] [2025-03-04 06:45:51,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:51,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 06:45:51,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 06:45:51,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:51,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:51,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:51,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93139193] [2025-03-04 06:45:51,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93139193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:51,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:51,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:45:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992217849] [2025-03-04 06:45:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:51,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:51,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:51,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:51,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2025-03-04 06:45:51,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 263 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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-03-04 06:45:51,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:51,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2025-03-04 06:45:51,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:51,415 INFO L124 PetriNetUnfolderBase]: 30/706 cut-off events. [2025-03-04 06:45:51,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:51,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 706 events. 30/706 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2681 event pairs, 30 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 737. Up to 78 conditions per place. [2025-03-04 06:45:51,418 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2025-03-04 06:45:51,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 262 transitions, 575 flow [2025-03-04 06:45:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-03-04 06:45:51,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2025-03-04 06:45:51,420 INFO L175 Difference]: Start difference. First operand has 272 places, 263 transitions, 539 flow. Second operand 3 states and 788 transitions. [2025-03-04 06:45:51,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 262 transitions, 575 flow [2025-03-04 06:45:51,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 262 transitions, 565 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:45:51,423 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 531 flow [2025-03-04 06:45:51,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=268, PETRI_TRANSITIONS=262} [2025-03-04 06:45:51,424 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -11 predicate places. [2025-03-04 06:45:51,424 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 531 flow [2025-03-04 06:45:51,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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-03-04 06:45:51,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:51,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:51,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:45:51,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:51,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:51,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1807796098, now seen corresponding path program 1 times [2025-03-04 06:45:51,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:51,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209671772] [2025-03-04 06:45:51,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:51,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:51,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 06:45:51,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 06:45:51,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:51,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209671772] [2025-03-04 06:45:51,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209671772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:51,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:51,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:45:51,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322753139] [2025-03-04 06:45:51,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:51,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:51,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:51,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:51,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:51,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2025-03-04 06:45:51,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 262 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-03-04 06:45:51,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:51,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2025-03-04 06:45:51,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:51,570 INFO L124 PetriNetUnfolderBase]: 36/734 cut-off events. [2025-03-04 06:45:51,571 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:51,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 734 events. 36/734 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2915 event pairs, 36 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 774. Up to 89 conditions per place. [2025-03-04 06:45:51,575 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2025-03-04 06:45:51,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 258 transitions, 559 flow [2025-03-04 06:45:51,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-04 06:45:51,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2025-03-04 06:45:51,577 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 531 flow. Second operand 3 states and 784 transitions. [2025-03-04 06:45:51,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 258 transitions, 559 flow [2025-03-04 06:45:51,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 258 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:45:51,581 INFO L231 Difference]: Finished difference. Result has 264 places, 258 transitions, 521 flow [2025-03-04 06:45:51,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=264, PETRI_TRANSITIONS=258} [2025-03-04 06:45:51,581 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -15 predicate places. [2025-03-04 06:45:51,582 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 258 transitions, 521 flow [2025-03-04 06:45:51,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-03-04 06:45:51,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:51,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:51,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:45:51,583 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash 148805048, now seen corresponding path program 1 times [2025-03-04 06:45:51,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:51,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841997139] [2025-03-04 06:45:51,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:51,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 06:45:51,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 06:45:51,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:51,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:45:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841997139] [2025-03-04 06:45:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841997139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:51,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:51,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362794025] [2025-03-04 06:45:51,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:51,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:51,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:51,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:52,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2025-03-04 06:45:52,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 258 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 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-03-04 06:45:52,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:52,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2025-03-04 06:45:52,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:52,556 INFO L124 PetriNetUnfolderBase]: 638/2432 cut-off events. [2025-03-04 06:45:52,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:52,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 2432 events. 638/2432 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15366 event pairs, 638 based on Foata normal form. 0/2287 useless extension candidates. Maximal degree in co-relation 3737. Up to 1362 conditions per place. [2025-03-04 06:45:52,563 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/257 dead transitions. [2025-03-04 06:45:52,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 257 transitions, 699 flow [2025-03-04 06:45:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2025-03-04 06:45:52,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2025-03-04 06:45:52,565 INFO L175 Difference]: Start difference. First operand has 264 places, 258 transitions, 521 flow. Second operand 6 states and 1201 transitions. [2025-03-04 06:45:52,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 257 transitions, 699 flow [2025-03-04 06:45:52,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 257 transitions, 698 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:52,568 INFO L231 Difference]: Finished difference. Result has 267 places, 257 transitions, 528 flow [2025-03-04 06:45:52,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=528, PETRI_PLACES=267, PETRI_TRANSITIONS=257} [2025-03-04 06:45:52,569 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -12 predicate places. [2025-03-04 06:45:52,569 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 257 transitions, 528 flow [2025-03-04 06:45:52,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 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-03-04 06:45:52,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:52,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:45:52,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:45:52,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:52,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:52,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1139430091, now seen corresponding path program 1 times [2025-03-04 06:45:52,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:52,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378148654] [2025-03-04 06:45:52,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:52,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:52,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 06:45:52,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:45:52,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:52,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:45:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:52,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378148654] [2025-03-04 06:45:52,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378148654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:52,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:52,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952776512] [2025-03-04 06:45:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:52,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:52,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:52,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:52,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:53,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2025-03-04 06:45:53,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 257 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-03-04 06:45:53,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:53,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2025-03-04 06:45:53,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:53,612 INFO L124 PetriNetUnfolderBase]: 232/1787 cut-off events. [2025-03-04 06:45:53,612 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:53,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 1787 events. 232/1787 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11405 event pairs, 20 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 2277. Up to 305 conditions per place. [2025-03-04 06:45:53,618 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 100 selfloop transitions, 38 changer transitions 0/331 dead transitions. [2025-03-04 06:45:53,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 331 transitions, 952 flow [2025-03-04 06:45:53,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2025-03-04 06:45:53,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526570048309179 [2025-03-04 06:45:53,621 INFO L175 Difference]: Start difference. First operand has 267 places, 257 transitions, 528 flow. Second operand 6 states and 1412 transitions. [2025-03-04 06:45:53,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 331 transitions, 952 flow [2025-03-04 06:45:53,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 331 transitions, 942 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:45:53,626 INFO L231 Difference]: Finished difference. Result has 271 places, 293 transitions, 776 flow [2025-03-04 06:45:53,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=271, PETRI_TRANSITIONS=293} [2025-03-04 06:45:53,627 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -8 predicate places. [2025-03-04 06:45:53,627 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 293 transitions, 776 flow [2025-03-04 06:45:53,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-03-04 06:45:53,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:53,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:45:53,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:45:53,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:53,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:53,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1005740338, now seen corresponding path program 1 times [2025-03-04 06:45:53,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:53,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364833986] [2025-03-04 06:45:53,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:53,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:53,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 06:45:53,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 06:45:53,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:53,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:45:54,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:54,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364833986] [2025-03-04 06:45:54,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364833986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:54,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:54,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:54,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023935400] [2025-03-04 06:45:54,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:54,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:54,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:54,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:54,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:54,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2025-03-04 06:45:54,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 293 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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-03-04 06:45:54,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:54,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2025-03-04 06:45:54,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:54,615 INFO L124 PetriNetUnfolderBase]: 185/1591 cut-off events. [2025-03-04 06:45:54,615 INFO L125 PetriNetUnfolderBase]: For 206/211 co-relation queries the response was YES. [2025-03-04 06:45:54,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 1591 events. 185/1591 cut-off events. For 206/211 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9985 event pairs, 75 based on Foata normal form. 0/1473 useless extension candidates. Maximal degree in co-relation 2293. Up to 354 conditions per place. [2025-03-04 06:45:54,622 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 96 selfloop transitions, 5 changer transitions 0/308 dead transitions. [2025-03-04 06:45:54,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 308 transitions, 1008 flow [2025-03-04 06:45:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-03-04 06:45:54,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2025-03-04 06:45:54,626 INFO L175 Difference]: Start difference. First operand has 271 places, 293 transitions, 776 flow. Second operand 6 states and 1382 transitions. [2025-03-04 06:45:54,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 308 transitions, 1008 flow [2025-03-04 06:45:54,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 308 transitions, 1008 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:54,633 INFO L231 Difference]: Finished difference. Result has 275 places, 292 transitions, 784 flow [2025-03-04 06:45:54,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=275, PETRI_TRANSITIONS=292} [2025-03-04 06:45:54,634 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -4 predicate places. [2025-03-04 06:45:54,634 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 292 transitions, 784 flow [2025-03-04 06:45:54,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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-03-04 06:45:54,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:54,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:45:54,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:45:54,635 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:54,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:54,636 INFO L85 PathProgramCache]: Analyzing trace with hash -374121002, now seen corresponding path program 1 times [2025-03-04 06:45:54,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:54,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702397136] [2025-03-04 06:45:54,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:54,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:54,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 06:45:54,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 06:45:54,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:54,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:45:54,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:54,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702397136] [2025-03-04 06:45:54,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702397136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:54,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:54,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:54,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079115464] [2025-03-04 06:45:54,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:54,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:54,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:54,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:54,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:55,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 276 [2025-03-04 06:45:55,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 292 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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-03-04 06:45:55,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:55,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 276 [2025-03-04 06:45:55,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:55,624 INFO L124 PetriNetUnfolderBase]: 583/2948 cut-off events. [2025-03-04 06:45:55,624 INFO L125 PetriNetUnfolderBase]: For 706/713 co-relation queries the response was YES. [2025-03-04 06:45:55,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 2948 events. 583/2948 cut-off events. For 706/713 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21799 event pairs, 69 based on Foata normal form. 0/2762 useless extension candidates. Maximal degree in co-relation 4953. Up to 795 conditions per place. [2025-03-04 06:45:55,632 INFO L140 encePairwiseOnDemand]: 254/276 looper letters, 111 selfloop transitions, 72 changer transitions 0/381 dead transitions. [2025-03-04 06:45:55,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 381 transitions, 1520 flow [2025-03-04 06:45:55,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2025-03-04 06:45:55,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8387681159420289 [2025-03-04 06:45:55,635 INFO L175 Difference]: Start difference. First operand has 275 places, 292 transitions, 784 flow. Second operand 6 states and 1389 transitions. [2025-03-04 06:45:55,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 381 transitions, 1520 flow [2025-03-04 06:45:55,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 381 transitions, 1502 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:45:55,640 INFO L231 Difference]: Finished difference. Result has 280 places, 362 transitions, 1440 flow [2025-03-04 06:45:55,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1440, PETRI_PLACES=280, PETRI_TRANSITIONS=362} [2025-03-04 06:45:55,641 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2025-03-04 06:45:55,641 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 362 transitions, 1440 flow [2025-03-04 06:45:55,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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-03-04 06:45:55,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:55,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:45:55,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:45:55,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:55,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:55,642 INFO L85 PathProgramCache]: Analyzing trace with hash 131184466, now seen corresponding path program 1 times [2025-03-04 06:45:55,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:55,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960321915] [2025-03-04 06:45:55,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:55,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 06:45:55,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 06:45:55,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:55,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:45:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:55,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960321915] [2025-03-04 06:45:55,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960321915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:55,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:55,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:55,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024457623] [2025-03-04 06:45:55,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:55,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:55,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:55,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:55,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:56,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2025-03-04 06:45:56,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 362 transitions, 1440 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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-03-04 06:45:56,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:56,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2025-03-04 06:45:56,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:56,819 INFO L124 PetriNetUnfolderBase]: 1657/5695 cut-off events. [2025-03-04 06:45:56,819 INFO L125 PetriNetUnfolderBase]: For 3355/3415 co-relation queries the response was YES. [2025-03-04 06:45:56,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12784 conditions, 5695 events. 1657/5695 cut-off events. For 3355/3415 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 46018 event pairs, 861 based on Foata normal form. 0/5367 useless extension candidates. Maximal degree in co-relation 12709. Up to 3147 conditions per place. [2025-03-04 06:45:56,846 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 201 selfloop transitions, 89 changer transitions 0/462 dead transitions. [2025-03-04 06:45:56,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 462 transitions, 2424 flow [2025-03-04 06:45:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2025-03-04 06:45:56,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2025-03-04 06:45:56,849 INFO L175 Difference]: Start difference. First operand has 280 places, 362 transitions, 1440 flow. Second operand 6 states and 1302 transitions. [2025-03-04 06:45:56,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 462 transitions, 2424 flow [2025-03-04 06:45:56,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 462 transitions, 2424 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:56,861 INFO L231 Difference]: Finished difference. Result has 290 places, 446 transitions, 2242 flow [2025-03-04 06:45:56,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2242, PETRI_PLACES=290, PETRI_TRANSITIONS=446} [2025-03-04 06:45:56,861 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 11 predicate places. [2025-03-04 06:45:56,861 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 446 transitions, 2242 flow [2025-03-04 06:45:56,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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-03-04 06:45:56,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:56,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:45:56,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:45:56,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:56,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2000809424, now seen corresponding path program 1 times [2025-03-04 06:45:56,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:56,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019866560] [2025-03-04 06:45:56,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:56,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 06:45:56,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 06:45:56,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:56,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:45:56,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:56,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019866560] [2025-03-04 06:45:56,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019866560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:56,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:56,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:45:56,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257328256] [2025-03-04 06:45:56,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:56,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:56,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:56,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:56,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:56,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 276 [2025-03-04 06:45:56,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 446 transitions, 2242 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 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-03-04 06:45:56,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:56,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 276 [2025-03-04 06:45:56,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:57,154 INFO L124 PetriNetUnfolderBase]: 300/1955 cut-off events. [2025-03-04 06:45:57,154 INFO L125 PetriNetUnfolderBase]: For 1127/1190 co-relation queries the response was YES. [2025-03-04 06:45:57,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 1955 events. 300/1955 cut-off events. For 1127/1190 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13407 event pairs, 31 based on Foata normal form. 4/1879 useless extension candidates. Maximal degree in co-relation 4002. Up to 312 conditions per place. [2025-03-04 06:45:57,163 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 10 selfloop transitions, 6 changer transitions 0/386 dead transitions. [2025-03-04 06:45:57,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 386 transitions, 1710 flow [2025-03-04 06:45:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-03-04 06:45:57,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9855072463768116 [2025-03-04 06:45:57,166 INFO L175 Difference]: Start difference. First operand has 290 places, 446 transitions, 2242 flow. Second operand 3 states and 816 transitions. [2025-03-04 06:45:57,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 386 transitions, 1710 flow [2025-03-04 06:45:57,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 386 transitions, 1622 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:57,179 INFO L231 Difference]: Finished difference. Result has 293 places, 384 transitions, 1612 flow [2025-03-04 06:45:57,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1612, PETRI_PLACES=293, PETRI_TRANSITIONS=384} [2025-03-04 06:45:57,180 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 14 predicate places. [2025-03-04 06:45:57,180 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 384 transitions, 1612 flow [2025-03-04 06:45:57,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 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-03-04 06:45:57,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:57,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:45:57,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:45:57,182 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:57,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1542430266, now seen corresponding path program 1 times [2025-03-04 06:45:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890159999] [2025-03-04 06:45:57,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:57,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 06:45:57,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 06:45:57,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:57,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:45:57,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:57,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890159999] [2025-03-04 06:45:57,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890159999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:57,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:57,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:57,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955252392] [2025-03-04 06:45:57,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:57,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:57,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:57,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:57,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:57,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2025-03-04 06:45:57,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 384 transitions, 1612 flow. Second operand has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 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-03-04 06:45:57,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:57,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2025-03-04 06:45:57,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:58,252 INFO L124 PetriNetUnfolderBase]: 695/3124 cut-off events. [2025-03-04 06:45:58,253 INFO L125 PetriNetUnfolderBase]: For 3052/3252 co-relation queries the response was YES. [2025-03-04 06:45:58,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7481 conditions, 3124 events. 695/3124 cut-off events. For 3052/3252 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 24042 event pairs, 52 based on Foata normal form. 20/3033 useless extension candidates. Maximal degree in co-relation 7398. Up to 741 conditions per place. [2025-03-04 06:45:58,265 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 184 selfloop transitions, 124 changer transitions 4/542 dead transitions. [2025-03-04 06:45:58,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 542 transitions, 3203 flow [2025-03-04 06:45:58,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1430 transitions. [2025-03-04 06:45:58,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635265700483091 [2025-03-04 06:45:58,268 INFO L175 Difference]: Start difference. First operand has 293 places, 384 transitions, 1612 flow. Second operand 6 states and 1430 transitions. [2025-03-04 06:45:58,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 542 transitions, 3203 flow [2025-03-04 06:45:58,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 542 transitions, 3180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:58,282 INFO L231 Difference]: Finished difference. Result has 301 places, 486 transitions, 2988 flow [2025-03-04 06:45:58,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2988, PETRI_PLACES=301, PETRI_TRANSITIONS=486} [2025-03-04 06:45:58,283 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 22 predicate places. [2025-03-04 06:45:58,284 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 486 transitions, 2988 flow [2025-03-04 06:45:58,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 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-03-04 06:45:58,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:58,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:45:58,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:45:58,284 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:58,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash 779856701, now seen corresponding path program 1 times [2025-03-04 06:45:58,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:58,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449082910] [2025-03-04 06:45:58,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:58,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:58,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 06:45:58,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 06:45:58,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:58,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:45:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449082910] [2025-03-04 06:45:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449082910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:58,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707711128] [2025-03-04 06:45:58,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:58,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:58,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:58,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:59,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2025-03-04 06:45:59,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 486 transitions, 2988 flow. Second operand has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 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-03-04 06:45:59,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:59,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2025-03-04 06:45:59,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:59,436 INFO L124 PetriNetUnfolderBase]: 608/2916 cut-off events. [2025-03-04 06:45:59,436 INFO L125 PetriNetUnfolderBase]: For 5526/5740 co-relation queries the response was YES. [2025-03-04 06:45:59,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7892 conditions, 2916 events. 608/2916 cut-off events. For 5526/5740 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22172 event pairs, 92 based on Foata normal form. 18/2878 useless extension candidates. Maximal degree in co-relation 7806. Up to 810 conditions per place. [2025-03-04 06:45:59,447 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 218 selfloop transitions, 17 changer transitions 0/501 dead transitions. [2025-03-04 06:45:59,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 501 transitions, 3512 flow [2025-03-04 06:45:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-03-04 06:45:59,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2025-03-04 06:45:59,450 INFO L175 Difference]: Start difference. First operand has 301 places, 486 transitions, 2988 flow. Second operand 6 states and 1382 transitions. [2025-03-04 06:45:59,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 501 transitions, 3512 flow [2025-03-04 06:45:59,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 501 transitions, 3494 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:59,466 INFO L231 Difference]: Finished difference. Result has 305 places, 485 transitions, 3002 flow [2025-03-04 06:45:59,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3002, PETRI_PLACES=305, PETRI_TRANSITIONS=485} [2025-03-04 06:45:59,468 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 26 predicate places. [2025-03-04 06:45:59,468 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 485 transitions, 3002 flow [2025-03-04 06:45:59,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 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-03-04 06:45:59,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:59,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:45:59,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:45:59,469 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:45:59,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:59,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1315990079, now seen corresponding path program 1 times [2025-03-04 06:45:59,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:59,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211592075] [2025-03-04 06:45:59,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:59,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:59,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 06:45:59,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 06:45:59,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:59,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:45:59,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211592075] [2025-03-04 06:45:59,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211592075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:59,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:59,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:59,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532135034] [2025-03-04 06:45:59,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:59,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:59,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:59,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:59,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2025-03-04 06:45:59,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 485 transitions, 3002 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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-03-04 06:45:59,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:59,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2025-03-04 06:45:59,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:00,580 INFO L124 PetriNetUnfolderBase]: 1547/5155 cut-off events. [2025-03-04 06:46:00,580 INFO L125 PetriNetUnfolderBase]: For 7547/7627 co-relation queries the response was YES. [2025-03-04 06:46:00,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15130 conditions, 5155 events. 1547/5155 cut-off events. For 7547/7627 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 41341 event pairs, 582 based on Foata normal form. 1/5002 useless extension candidates. Maximal degree in co-relation 15043. Up to 2881 conditions per place. [2025-03-04 06:46:00,601 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 304 selfloop transitions, 103 changer transitions 8/591 dead transitions. [2025-03-04 06:46:00,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 591 transitions, 4442 flow [2025-03-04 06:46:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:46:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:46:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2025-03-04 06:46:00,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2025-03-04 06:46:00,603 INFO L175 Difference]: Start difference. First operand has 305 places, 485 transitions, 3002 flow. Second operand 6 states and 1302 transitions. [2025-03-04 06:46:00,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 591 transitions, 4442 flow [2025-03-04 06:46:00,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 591 transitions, 4408 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:46:00,628 INFO L231 Difference]: Finished difference. Result has 310 places, 571 transitions, 3986 flow [2025-03-04 06:46:00,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3986, PETRI_PLACES=310, PETRI_TRANSITIONS=571} [2025-03-04 06:46:00,628 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 31 predicate places. [2025-03-04 06:46:00,628 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 571 transitions, 3986 flow [2025-03-04 06:46:00,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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-03-04 06:46:00,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:00,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:46:00,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:46:00,629 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:46:00,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1067566672, now seen corresponding path program 1 times [2025-03-04 06:46:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:00,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147251769] [2025-03-04 06:46:00,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:00,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 06:46:00,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:46:00,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:00,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:01,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147251769] [2025-03-04 06:46:01,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147251769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743502071] [2025-03-04 06:46:01,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:01,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:01,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:01,718 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-03-04 06:46:01,719 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-03-04 06:46:01,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 06:46:01,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:46:01,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:01,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:01,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 06:46:01,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:01,959 INFO L378 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-03-04 06:46:02,009 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 06:46:02,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 06:46:02,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 06:46:02,158 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-03-04 06:46:02,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-03-04 06:46:02,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:46:02,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:46:02,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:46:02,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2025-03-04 06:46:02,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:46:02,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 06:46:02,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:02,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 06:46:02,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:02,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 06:46:02,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-03-04 06:46:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:02,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:02,559 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|))) is different from false [2025-03-04 06:46:02,579 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet36|)))) (and (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) |c_t_funThread1of1ForFork0_#t~nondet36|))))) is different from false [2025-03-04 06:46:02,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) (.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse2 |c_t_funThread1of1ForFork0_#t~nondet36|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet36|)))) (and (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse2) |c_t_funThread1of1ForFork0_#t~nondet36|))))) is different from false [2025-03-04 06:46:04,595 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2014 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2014) c_~B~0.base v_ArrVal_2015) c_~A~0.base) (+ c_~A~0.offset 4)) c_~B~0.base))) is different from false [2025-03-04 06:46:04,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:04,725 INFO L378 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 1 case distinctions, treesize of input 23 treesize of output 24 [2025-03-04 06:46:04,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-04 06:46:04,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 06:46:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:04,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743502071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:04,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:04,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 32 [2025-03-04 06:46:04,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527715238] [2025-03-04 06:46:04,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:04,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 06:46:04,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:04,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 06:46:04,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=696, Unknown=23, NotChecked=228, Total=1056 [2025-03-04 06:46:05,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 276 [2025-03-04 06:46:05,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 571 transitions, 3986 flow. Second operand has 33 states, 33 states have (on average 112.12121212121212) internal successors, (3700), 33 states have internal predecessors, (3700), 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-03-04 06:46:05,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:05,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 276 [2025-03-04 06:46:05,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:07,590 INFO L124 PetriNetUnfolderBase]: 2472/6988 cut-off events. [2025-03-04 06:46:07,590 INFO L125 PetriNetUnfolderBase]: For 12295/12320 co-relation queries the response was YES. [2025-03-04 06:46:07,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23213 conditions, 6988 events. 2472/6988 cut-off events. For 12295/12320 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 55411 event pairs, 326 based on Foata normal form. 19/6950 useless extension candidates. Maximal degree in co-relation 23101. Up to 2994 conditions per place. [2025-03-04 06:46:07,618 INFO L140 encePairwiseOnDemand]: 245/276 looper letters, 619 selfloop transitions, 101 changer transitions 28/843 dead transitions. [2025-03-04 06:46:07,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 843 transitions, 7364 flow [2025-03-04 06:46:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 06:46:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 06:46:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3295 transitions. [2025-03-04 06:46:07,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.426371635610766 [2025-03-04 06:46:07,623 INFO L175 Difference]: Start difference. First operand has 310 places, 571 transitions, 3986 flow. Second operand 28 states and 3295 transitions. [2025-03-04 06:46:07,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 843 transitions, 7364 flow [2025-03-04 06:46:07,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 843 transitions, 7160 flow, removed 102 selfloop flow, removed 0 redundant places. [2025-03-04 06:46:07,672 INFO L231 Difference]: Finished difference. Result has 347 places, 607 transitions, 4466 flow [2025-03-04 06:46:07,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=3838, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4466, PETRI_PLACES=347, PETRI_TRANSITIONS=607} [2025-03-04 06:46:07,673 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 68 predicate places. [2025-03-04 06:46:07,673 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 607 transitions, 4466 flow [2025-03-04 06:46:07,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 112.12121212121212) internal successors, (3700), 33 states have internal predecessors, (3700), 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-03-04 06:46:07,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:07,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:46:07,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 06:46:07,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 06:46:07,879 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:46:07,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1951234751, now seen corresponding path program 1 times [2025-03-04 06:46:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:07,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304737037] [2025-03-04 06:46:07,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:07,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 06:46:07,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:46:07,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:07,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:08,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:08,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304737037] [2025-03-04 06:46:08,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304737037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:08,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202939671] [2025-03-04 06:46:08,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:08,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:08,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:08,930 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-03-04 06:46:08,932 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-03-04 06:46:09,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 06:46:09,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:46:09,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:09,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:09,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 06:46:09,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:09,128 INFO L378 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-03-04 06:46:09,171 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 06:46:09,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 06:46:09,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 06:46:09,273 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-03-04 06:46:09,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-03-04 06:46:09,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:46:09,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:46:09,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:46:09,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 06:46:09,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 06:46:09,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:09,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-04 06:46:09,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:09,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-04 06:46:09,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2025-03-04 06:46:09,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 06:46:09,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 06:46:09,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 06:46:09,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 06:46:09,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 06:46:09,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 06:46:09,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 06:46:09,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 06:46:09,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 06:46:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:09,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:09,844 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 7 c_~B~0.offset)) 0))) is different from false [2025-03-04 06:46:09,874 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)))) is different from false [2025-03-04 06:46:09,913 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-03-04 06:46:09,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))))) is different from false [2025-03-04 06:46:09,941 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 c_~B~0.offset)) (.cse3 (+ 6 c_~B~0.offset)) (.cse4 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse2 0) .cse3 0) .cse4 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse4) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-03-04 06:46:09,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:09,955 INFO L378 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 46 treesize of output 62 [2025-03-04 06:46:09,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:09,959 INFO L378 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 206 treesize of output 170 [2025-03-04 06:46:09,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-03-04 06:46:09,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-03-04 06:46:09,982 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-04 06:46:09,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-04 06:46:09,986 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-04 06:46:09,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-04 06:46:09,990 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-04 06:46:09,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-04 06:46:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202939671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:10,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:10,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 33 [2025-03-04 06:46:10,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867592643] [2025-03-04 06:46:10,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:10,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:46:10,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:10,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:46:10,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=716, Unknown=13, NotChecked=290, Total=1122 [2025-03-04 06:46:10,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2025-03-04 06:46:10,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 607 transitions, 4466 flow. Second operand has 34 states, 34 states have (on average 113.3529411764706) internal successors, (3854), 34 states have internal predecessors, (3854), 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-03-04 06:46:10,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:10,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2025-03-04 06:46:10,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:13,593 INFO L124 PetriNetUnfolderBase]: 2857/8071 cut-off events. [2025-03-04 06:46:13,593 INFO L125 PetriNetUnfolderBase]: For 18510/18517 co-relation queries the response was YES. [2025-03-04 06:46:13,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28464 conditions, 8071 events. 2857/8071 cut-off events. For 18510/18517 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 66751 event pairs, 384 based on Foata normal form. 12/8000 useless extension candidates. Maximal degree in co-relation 28335. Up to 2077 conditions per place. [2025-03-04 06:46:13,626 INFO L140 encePairwiseOnDemand]: 240/276 looper letters, 775 selfloop transitions, 150 changer transitions 24/1046 dead transitions. [2025-03-04 06:46:13,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 1046 transitions, 9554 flow [2025-03-04 06:46:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 06:46:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 06:46:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3218 transitions. [2025-03-04 06:46:13,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4484392419175028 [2025-03-04 06:46:13,629 INFO L175 Difference]: Start difference. First operand has 347 places, 607 transitions, 4466 flow. Second operand 26 states and 3218 transitions. [2025-03-04 06:46:13,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 1046 transitions, 9554 flow [2025-03-04 06:46:13,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 1046 transitions, 9430 flow, removed 51 selfloop flow, removed 10 redundant places. [2025-03-04 06:46:13,709 INFO L231 Difference]: Finished difference. Result has 373 places, 683 transitions, 5852 flow [2025-03-04 06:46:13,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=4384, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5852, PETRI_PLACES=373, PETRI_TRANSITIONS=683} [2025-03-04 06:46:13,709 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 94 predicate places. [2025-03-04 06:46:13,709 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 683 transitions, 5852 flow [2025-03-04 06:46:13,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 113.3529411764706) internal successors, (3854), 34 states have internal predecessors, (3854), 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-03-04 06:46:13,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:13,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:46:13,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 06:46:13,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 06:46:13,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:46:13,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:13,912 INFO L85 PathProgramCache]: Analyzing trace with hash 292131217, now seen corresponding path program 2 times [2025-03-04 06:46:13,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:13,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986701805] [2025-03-04 06:46:13,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:46:13,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:13,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-04 06:46:14,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:46:14,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:46:14,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:15,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:15,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986701805] [2025-03-04 06:46:15,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986701805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:15,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369320243] [2025-03-04 06:46:15,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:46:15,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:15,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:15,338 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-03-04 06:46:15,340 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-03-04 06:46:15,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-04 06:46:16,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:46:16,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:46:16,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:16,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-04 06:46:16,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:16,625 INFO L378 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-03-04 06:46:16,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:46:16,857 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:46:16,857 INFO L378 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-03-04 06:46:17,032 INFO L378 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 16 treesize of output 11 [2025-03-04 06:46:17,079 INFO L378 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 16 treesize of output 11 [2025-03-04 06:46:17,144 INFO L378 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 16 treesize of output 11 [2025-03-04 06:46:17,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-04 06:46:17,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:46:17,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 06:46:17,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:17,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 06:46:17,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:17,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 06:46:17,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:17,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-04 06:46:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:17,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:17,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2743 (Array Int Int))) (not (= (+ 4 c_~B~0.offset) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2743) c_~B~0.base v_ArrVal_2744) c_~A~0.base) .cse0)))) (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2743 (Array Int Int))) (not (= (+ 5 c_~B~0.offset) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2743) c_~B~0.base v_ArrVal_2744) c_~A~0.base) .cse0)))))) is different from false [2025-03-04 06:46:18,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_2744 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2744) c_~A~0.base) .cse0) (+ 5 |c_ULTIMATE.start_main_#t~malloc48#1.offset|)))) (forall ((v_ArrVal_2744 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2744) c_~A~0.base) .cse0) (+ 4 |c_ULTIMATE.start_main_#t~malloc48#1.offset|)))))) is different from false [2025-03-04 06:46:18,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:18,212 INFO L378 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 1 case distinctions, treesize of input 23 treesize of output 24 [2025-03-04 06:46:18,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-04 06:46:18,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 06:46:18,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:18,228 INFO L378 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 1 case distinctions, treesize of input 23 treesize of output 24 [2025-03-04 06:46:18,229 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:18,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 06:46:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:18,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369320243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:18,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:18,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 48 [2025-03-04 06:46:18,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426231946] [2025-03-04 06:46:18,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:18,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 06:46:18,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:18,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 06:46:18,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1943, Unknown=27, NotChecked=182, Total=2352 [2025-03-04 06:46:18,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2025-03-04 06:46:18,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 683 transitions, 5852 flow. Second operand has 49 states, 49 states have (on average 113.51020408163265) internal successors, (5562), 49 states have internal predecessors, (5562), 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-03-04 06:46:18,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:18,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2025-03-04 06:46:18,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:23,202 INFO L124 PetriNetUnfolderBase]: 3299/9227 cut-off events. [2025-03-04 06:46:23,202 INFO L125 PetriNetUnfolderBase]: For 27740/27769 co-relation queries the response was YES. [2025-03-04 06:46:23,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35014 conditions, 9227 events. 3299/9227 cut-off events. For 27740/27769 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 78481 event pairs, 517 based on Foata normal form. 17/9150 useless extension candidates. Maximal degree in co-relation 34872. Up to 1316 conditions per place. [2025-03-04 06:46:23,251 INFO L140 encePairwiseOnDemand]: 238/276 looper letters, 906 selfloop transitions, 215 changer transitions 19/1237 dead transitions. [2025-03-04 06:46:23,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1237 transitions, 12113 flow [2025-03-04 06:46:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 06:46:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 06:46:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 4485 transitions. [2025-03-04 06:46:23,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4391891891891892 [2025-03-04 06:46:23,254 INFO L175 Difference]: Start difference. First operand has 373 places, 683 transitions, 5852 flow. Second operand 37 states and 4485 transitions. [2025-03-04 06:46:23,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 1237 transitions, 12113 flow [2025-03-04 06:46:23,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 1237 transitions, 12049 flow, removed 20 selfloop flow, removed 11 redundant places. [2025-03-04 06:46:23,430 INFO L231 Difference]: Finished difference. Result has 413 places, 780 transitions, 7512 flow [2025-03-04 06:46:23,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=5814, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=7512, PETRI_PLACES=413, PETRI_TRANSITIONS=780} [2025-03-04 06:46:23,430 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 134 predicate places. [2025-03-04 06:46:23,431 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 780 transitions, 7512 flow [2025-03-04 06:46:23,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 113.51020408163265) internal successors, (5562), 49 states have internal predecessors, (5562), 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-03-04 06:46:23,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:23,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:46:23,443 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-03-04 06:46:23,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:23,633 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:46:23,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:23,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2003591993, now seen corresponding path program 3 times [2025-03-04 06:46:23,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:23,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067076840] [2025-03-04 06:46:23,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:46:23,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:23,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 188 statements into 4 equivalence classes. [2025-03-04 06:46:23,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:46:23,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 06:46:23,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:28,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:28,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067076840] [2025-03-04 06:46:28,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067076840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:28,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164817299] [2025-03-04 06:46:28,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:46:28,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:28,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:28,090 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-03-04 06:46:28,091 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-03-04 06:46:28,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 188 statements into 4 equivalence classes. [2025-03-04 06:46:33,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:46:33,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 06:46:33,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:33,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-04 06:46:33,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:33,480 INFO L378 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-03-04 06:46:33,577 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 06:46:33,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 06:46:33,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:46:33,776 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-04 06:46:33,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 06:46:33,967 INFO L378 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 16 treesize of output 11 [2025-03-04 06:46:34,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 06:46:34,088 INFO L378 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 17 treesize of output 12 [2025-03-04 06:46:34,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:46:34,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 06:46:34,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 06:46:34,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2025-03-04 06:46:34,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 06:46:34,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 06:46:34,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 06:46:34,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 06:46:34,572 INFO L378 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 30 treesize of output 21 [2025-03-04 06:46:34,578 INFO L378 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 30 treesize of output 21 [2025-03-04 06:46:34,587 INFO L378 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 30 treesize of output 21 [2025-03-04 06:46:34,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-04 06:46:34,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-03-04 06:46:34,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-03-04 06:46:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:34,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:34,716 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3123 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3123 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3123 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3123 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) (+ 7 c_~B~0.offset)) 0))) is different from false [2025-03-04 06:46:34,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3119) c_~B~0.base) .cse0 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3119) c_~B~0.base) .cse0 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) .cse0) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3119) c_~B~0.base) .cse0 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3119) c_~B~0.base) .cse0 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)))) is different from false [2025-03-04 06:46:34,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3116))) (store .cse0 c_~B~0.base (store (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3119) c_~B~0.base) .cse1 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) (+ 6 c_~B~0.offset)))) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= 0 (select (select (store (let ((.cse2 (store |c_#race| c_~A~0.base v_ArrVal_3116))) (store .cse2 c_~B~0.base (store (select (store .cse2 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3119) c_~B~0.base) .cse1 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) .cse1))) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| c_~A~0.base v_ArrVal_3116))) (store .cse3 c_~B~0.base (store (select (store .cse3 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3119) c_~B~0.base) .cse1 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_~A~0.base v_ArrVal_3116))) (store .cse4 c_~B~0.base (store (select (store .cse4 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3119) c_~B~0.base) .cse1 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3123) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)))) is different from false [2025-03-04 06:46:34,908 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_~B~0.offset)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3116))) (store .cse0 c_~B~0.base (store (select (store .cse0 .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0))) .cse1 v_ArrVal_3123) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| c_~A~0.base v_ArrVal_3116))) (store .cse3 c_~B~0.base (store (select (store .cse3 .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0))) .cse1 v_ArrVal_3123) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_~A~0.base v_ArrVal_3116))) (store .cse4 c_~B~0.base (store (select (store .cse4 .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0))) .cse1 v_ArrVal_3123) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_3116))) (store .cse5 c_~B~0.base (store (select (store .cse5 .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0))) .cse1 v_ArrVal_3123) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)))) is different from false [2025-03-04 06:46:34,948 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 6 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4))) (.cse2 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3116) c_~B~0.base (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3116) .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0)) .cse1 v_ArrVal_3123) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3116) c_~B~0.base (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3116) .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0)) .cse1 v_ArrVal_3123) c_~B~0.base) (+ 5 c_~B~0.offset)))) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3116) c_~B~0.base (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3116) .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0)) .cse1 v_ArrVal_3123) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3116) c_~B~0.base (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3116) .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0)) .cse1 v_ArrVal_3123) c_~B~0.base) .cse2) 0))))) is different from false [2025-03-04 06:46:34,960 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 5 c_~B~0.offset)) (.cse3 (+ 6 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse4 0) .cse3 0))) (.cse2 (+ 7 c_~B~0.offset)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3116) c_~B~0.base (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3116) .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0)) .cse1 v_ArrVal_3123) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3116) c_~B~0.base (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3116) .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0)) .cse1 v_ArrVal_3123) c_~B~0.base) .cse4) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3116) c_~B~0.base (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3116) .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0)) .cse1 v_ArrVal_3123) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3116) c_~B~0.base (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3116) .cse1 v_ArrVal_3119) c_~B~0.base) .cse2 0)) .cse1 v_ArrVal_3123) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-03-04 06:46:34,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 06:46:34,970 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:34,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:34,976 INFO L378 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 3 case distinctions, treesize of input 41 treesize of output 52 [2025-03-04 06:46:34,978 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:34,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:34,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 56 treesize of output 32 [2025-03-04 06:46:34,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 06:46:34,986 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:34,987 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:34,990 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2025-03-04 06:46:34,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 1 [2025-03-04 06:46:34,993 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:34,995 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:34,998 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2025-03-04 06:46:34,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 1 [2025-03-04 06:46:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:35,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164817299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:35,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 18] total 62 [2025-03-04 06:46:35,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113631058] [2025-03-04 06:46:35,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:35,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 06:46:35,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:35,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 06:46:35,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2976, Unknown=25, NotChecked=690, Total=3906 [2025-03-04 06:46:35,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2025-03-04 06:46:35,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 780 transitions, 7512 flow. Second operand has 63 states, 63 states have (on average 112.36507936507937) internal successors, (7079), 63 states have internal predecessors, (7079), 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-03-04 06:46:35,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:35,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2025-03-04 06:46:35,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:42,374 INFO L124 PetriNetUnfolderBase]: 4004/11195 cut-off events. [2025-03-04 06:46:42,375 INFO L125 PetriNetUnfolderBase]: For 44194/44226 co-relation queries the response was YES. [2025-03-04 06:46:42,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45217 conditions, 11195 events. 4004/11195 cut-off events. For 44194/44226 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 100333 event pairs, 701 based on Foata normal form. 25/11095 useless extension candidates. Maximal degree in co-relation 45056. Up to 2698 conditions per place. [2025-03-04 06:46:42,439 INFO L140 encePairwiseOnDemand]: 233/276 looper letters, 931 selfloop transitions, 245 changer transitions 21/1294 dead transitions. [2025-03-04 06:46:42,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 1294 transitions, 14150 flow [2025-03-04 06:46:42,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 06:46:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-04 06:46:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4251 transitions. [2025-03-04 06:46:42,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4400621118012422 [2025-03-04 06:46:42,442 INFO L175 Difference]: Start difference. First operand has 413 places, 780 transitions, 7512 flow. Second operand 35 states and 4251 transitions. [2025-03-04 06:46:42,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 1294 transitions, 14150 flow [2025-03-04 06:46:42,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 1294 transitions, 14002 flow, removed 41 selfloop flow, removed 13 redundant places. [2025-03-04 06:46:42,665 INFO L231 Difference]: Finished difference. Result has 446 places, 870 transitions, 9765 flow [2025-03-04 06:46:42,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=7386, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=9765, PETRI_PLACES=446, PETRI_TRANSITIONS=870} [2025-03-04 06:46:42,666 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 167 predicate places. [2025-03-04 06:46:42,666 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 870 transitions, 9765 flow [2025-03-04 06:46:42,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 112.36507936507937) internal successors, (7079), 63 states have internal predecessors, (7079), 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-03-04 06:46:42,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:42,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:46:42,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:46:42,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:42,869 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:46:42,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:42,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1483926319, now seen corresponding path program 4 times [2025-03-04 06:46:42,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:42,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585891384] [2025-03-04 06:46:42,870 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:46:42,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:42,888 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 188 statements into 2 equivalence classes. [2025-03-04 06:46:42,898 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 182 of 188 statements. [2025-03-04 06:46:42,898 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:46:42,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:43,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585891384] [2025-03-04 06:46:43,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585891384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:43,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838727126] [2025-03-04 06:46:43,854 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:46:43,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:43,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:43,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:46:43,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 06:46:44,015 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 188 statements into 2 equivalence classes. [2025-03-04 06:46:44,064 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 182 of 188 statements. [2025-03-04 06:46:44,064 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:46:44,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:44,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 06:46:44,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:44,073 INFO L378 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-03-04 06:46:44,097 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 06:46:44,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 06:46:44,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 06:46:44,176 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-03-04 06:46:44,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-03-04 06:46:44,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:46:44,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:46:44,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:46:44,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 06:46:44,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 06:46:44,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2025-03-04 06:46:44,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-03-04 06:46:44,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-03-04 06:46:44,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-03-04 06:46:44,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-03-04 06:46:44,410 INFO L378 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 27 treesize of output 20 [2025-03-04 06:46:44,415 INFO L378 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 27 treesize of output 20 [2025-03-04 06:46:44,420 INFO L378 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 27 treesize of output 20 [2025-03-04 06:46:44,426 INFO L378 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 27 treesize of output 20 [2025-03-04 06:46:44,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:44,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-04 06:46:44,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:44,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-04 06:46:44,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 06:46:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:44,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:44,495 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))) is different from false [2025-03-04 06:46:44,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))))) is different from false [2025-03-04 06:46:44,594 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 6 c_~B~0.offset)) (.cse1 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) .cse0) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)))) is different from false [2025-03-04 06:46:44,648 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse0 c_~B~0.base (store (store (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse3 c_~B~0.base (store (store (select (store .cse3 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse4 c_~B~0.base (store (store (select (store .cse4 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse5 c_~B~0.base (store (store (select (store .cse5 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) .cse2) 0)))) is different from false [2025-03-04 06:46:44,682 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 7 c_~B~0.offset)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4))) (.cse2 (+ 6 c_~B~0.offset))) (and (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse0 c_~B~0.base (store (store (select (store .cse0 .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0))) .cse1 v_ArrVal_3493) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse4 c_~B~0.base (store (store (select (store .cse4 .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0))) .cse1 v_ArrVal_3493) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse5 c_~B~0.base (store (store (select (store .cse5 .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0))) .cse1 v_ArrVal_3493) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse6 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse6 c_~B~0.base (store (store (select (store .cse6 .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0))) .cse1 v_ArrVal_3493) c_~B~0.base) .cse2) 0)))) is different from false [2025-03-04 06:46:44,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 5 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse4 0))) (.cse2 (+ 6 c_~B~0.offset)) (.cse3 (+ 7 c_~B~0.offset)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3485) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3485) .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_3493) c_~B~0.base) .cse4) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3485) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3485) .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_3493) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3485) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3485) .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_3493) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3485) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3485) .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_3493) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-03-04 06:46:44,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:44,723 INFO L378 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 2 case distinctions, treesize of input 65 treesize of output 70 [2025-03-04 06:46:44,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 98 [2025-03-04 06:46:44,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 06:46:44,733 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:44,733 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:44,737 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-03-04 06:46:44,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 1 [2025-03-04 06:46:44,738 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:44,738 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:44,739 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:44,740 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:45,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838727126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:45,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:45,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 32 [2025-03-04 06:46:45,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470767168] [2025-03-04 06:46:45,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:45,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 06:46:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:45,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 06:46:45,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=613, Unknown=22, NotChecked=330, Total=1056 [2025-03-04 06:46:45,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 276 [2025-03-04 06:46:45,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 870 transitions, 9765 flow. Second operand has 33 states, 33 states have (on average 114.24242424242425) internal successors, (3770), 33 states have internal predecessors, (3770), 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-03-04 06:46:45,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:45,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 276 [2025-03-04 06:46:45,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:49,497 INFO L124 PetriNetUnfolderBase]: 4502/12634 cut-off events. [2025-03-04 06:46:49,497 INFO L125 PetriNetUnfolderBase]: For 61390/61425 co-relation queries the response was YES. [2025-03-04 06:46:49,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53320 conditions, 12634 events. 4502/12634 cut-off events. For 61390/61425 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 116575 event pairs, 800 based on Foata normal form. 17/12504 useless extension candidates. Maximal degree in co-relation 53145. Up to 3349 conditions per place. [2025-03-04 06:46:49,575 INFO L140 encePairwiseOnDemand]: 243/276 looper letters, 915 selfloop transitions, 246 changer transitions 13/1275 dead transitions. [2025-03-04 06:46:49,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 1275 transitions, 16103 flow [2025-03-04 06:46:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 06:46:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 06:46:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3217 transitions. [2025-03-04 06:46:49,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4482998885172798 [2025-03-04 06:46:49,578 INFO L175 Difference]: Start difference. First operand has 446 places, 870 transitions, 9765 flow. Second operand 26 states and 3217 transitions. [2025-03-04 06:46:49,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 1275 transitions, 16103 flow [2025-03-04 06:46:49,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 1275 transitions, 16006 flow, removed 18 selfloop flow, removed 17 redundant places. [2025-03-04 06:46:49,948 INFO L231 Difference]: Finished difference. Result has 462 places, 960 transitions, 12292 flow [2025-03-04 06:46:49,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=9682, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=12292, PETRI_PLACES=462, PETRI_TRANSITIONS=960} [2025-03-04 06:46:49,949 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 183 predicate places. [2025-03-04 06:46:49,949 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 960 transitions, 12292 flow [2025-03-04 06:46:49,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 114.24242424242425) internal successors, (3770), 33 states have internal predecessors, (3770), 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-03-04 06:46:49,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:49,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:46:49,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 06:46:50,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:50,154 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:46:50,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:50,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2070771737, now seen corresponding path program 5 times [2025-03-04 06:46:50,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:50,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799065491] [2025-03-04 06:46:50,155 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:46:50,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:50,173 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 5 equivalence classes. [2025-03-04 06:46:50,200 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:46:50,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 06:46:50,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:51,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:51,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799065491] [2025-03-04 06:46:51,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799065491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:51,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198973508] [2025-03-04 06:46:51,714 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:46:51,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:51,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:51,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:46:51,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 06:46:51,887 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 5 equivalence classes. [2025-03-04 06:46:53,446 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:46:53,447 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 06:46:53,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:53,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-04 06:46:53,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:53,462 INFO L378 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-03-04 06:46:53,524 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 06:46:53,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 06:46:53,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 06:46:53,734 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2025-03-04 06:46:53,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2025-03-04 06:46:53,872 INFO L378 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 17 treesize of output 12 [2025-03-04 06:46:53,923 INFO L378 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 17 treesize of output 12 [2025-03-04 06:46:53,970 INFO L378 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 17 treesize of output 12 [2025-03-04 06:46:54,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:46:54,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2025-03-04 06:46:54,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 06:46:54,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 06:46:54,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 06:46:54,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 06:46:54,253 INFO L378 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 16 treesize of output 11 [2025-03-04 06:46:54,258 INFO L378 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 16 treesize of output 11 [2025-03-04 06:46:54,264 INFO L378 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 16 treesize of output 11 [2025-03-04 06:46:54,269 INFO L378 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 16 treesize of output 11 [2025-03-04 06:46:54,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 06:46:54,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 06:46:54,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-04 06:46:54,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-03-04 06:46:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:54,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:54,416 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3863 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3863 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3863 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) (+ 4 c_~B~0.offset)))) (forall ((v_ArrVal_3863 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) (+ 7 c_~B~0.offset)) 0))) is different from false [2025-03-04 06:46:54,500 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 c_~B~0.offset)) (.cse1 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_3863 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3863 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3863 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3863 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) .cse2) 0))))) is different from false [2025-03-04 06:46:54,507 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 c_~B~0.offset)) (.cse1 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_3863 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3863 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3863 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_3863 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) .cse3) 0))))) is different from false [2025-03-04 06:46:54,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 c_~B~0.offset)) (.cse1 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3858) c_~B~0.base) .cse0 0) .cse1 0) .cse2 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3858) c_~B~0.base) .cse0 0) .cse1 0) .cse2 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) .cse0) 0)) (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3858) c_~B~0.base) .cse0 0) .cse1 0) .cse2 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3858) c_~B~0.base) .cse0 0) .cse1 0) .cse2 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) .cse2) 0)))) is different from false [2025-03-04 06:46:54,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 c_~B~0.offset)) (.cse2 (+ 6 c_~B~0.offset)) (.cse3 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3854))) (store .cse0 c_~B~0.base (store (store (store (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3858) c_~B~0.base) .cse1 0) .cse2 0) .cse3 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) .cse2))) (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_~A~0.base v_ArrVal_3854))) (store .cse4 c_~B~0.base (store (store (store (select (store .cse4 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3858) c_~B~0.base) .cse1 0) .cse2 0) .cse3 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_3854))) (store .cse5 c_~B~0.base (store (store (store (select (store .cse5 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3858) c_~B~0.base) .cse1 0) .cse2 0) .cse3 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= (select (select (store (let ((.cse6 (store |c_#race| c_~A~0.base v_ArrVal_3854))) (store .cse6 c_~B~0.base (store (store (store (select (store .cse6 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3858) c_~B~0.base) .cse1 0) .cse2 0) .cse3 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3863) c_~B~0.base) .cse3) 0)))) is different from false [2025-03-04 06:46:54,609 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 c_~B~0.offset)) (.cse4 (+ 7 c_~B~0.offset)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4))) (.cse3 (+ 6 c_~B~0.offset))) (and (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3854))) (store .cse0 c_~B~0.base (store (store (store (select (store .cse0 .cse1 v_ArrVal_3858) c_~B~0.base) .cse2 0) .cse3 0) .cse4 0))) .cse1 v_ArrVal_3863) c_~B~0.base) .cse4) 0)) (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_3854))) (store .cse5 c_~B~0.base (store (store (store (select (store .cse5 .cse1 v_ArrVal_3858) c_~B~0.base) .cse2 0) .cse3 0) .cse4 0))) .cse1 v_ArrVal_3863) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= 0 (select (select (store (let ((.cse6 (store |c_#race| c_~A~0.base v_ArrVal_3854))) (store .cse6 c_~B~0.base (store (store (store (select (store .cse6 .cse1 v_ArrVal_3858) c_~B~0.base) .cse2 0) .cse3 0) .cse4 0))) .cse1 v_ArrVal_3863) c_~B~0.base) .cse2))) (forall ((v_ArrVal_3863 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (= (select (select (store (let ((.cse7 (store |c_#race| c_~A~0.base v_ArrVal_3854))) (store .cse7 c_~B~0.base (store (store (store (select (store .cse7 .cse1 v_ArrVal_3858) c_~B~0.base) .cse2 0) .cse3 0) .cse4 0))) .cse1 v_ArrVal_3863) c_~B~0.base) .cse3) 0)))) is different from false [2025-03-04 06:46:54,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 06:46:54,616 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:54,618 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:54,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:54,620 INFO L378 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 1 case distinctions, treesize of input 31 treesize of output 32 [2025-03-04 06:46:54,621 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:54,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 36 treesize of output 24 [2025-03-04 06:46:54,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 06:46:54,625 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:54,625 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 06:46:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:46:55,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198973508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:55,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:55,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 18] total 52 [2025-03-04 06:46:55,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985800732] [2025-03-04 06:46:55,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:55,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-04 06:46:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:55,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-04 06:46:55,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1961, Unknown=25, NotChecked=570, Total=2756 [2025-03-04 06:46:55,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 276 [2025-03-04 06:46:55,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 960 transitions, 12292 flow. Second operand has 53 states, 53 states have (on average 113.52830188679245) internal successors, (6017), 53 states have internal predecessors, (6017), 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-03-04 06:46:55,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:55,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 276 [2025-03-04 06:46:55,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:01,764 INFO L124 PetriNetUnfolderBase]: 5296/14823 cut-off events. [2025-03-04 06:47:01,764 INFO L125 PetriNetUnfolderBase]: For 90446/90501 co-relation queries the response was YES. [2025-03-04 06:47:01,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64366 conditions, 14823 events. 5296/14823 cut-off events. For 90446/90501 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 142312 event pairs, 1121 based on Foata normal form. 18/14652 useless extension candidates. Maximal degree in co-relation 64183. Up to 3311 conditions per place. [2025-03-04 06:47:01,875 INFO L140 encePairwiseOnDemand]: 237/276 looper letters, 993 selfloop transitions, 301 changer transitions 17/1412 dead transitions. [2025-03-04 06:47:01,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 1412 transitions, 19896 flow [2025-03-04 06:47:01,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 06:47:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 06:47:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3792 transitions. [2025-03-04 06:47:01,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4431977559607293 [2025-03-04 06:47:01,878 INFO L175 Difference]: Start difference. First operand has 462 places, 960 transitions, 12292 flow. Second operand 31 states and 3792 transitions. [2025-03-04 06:47:01,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 1412 transitions, 19896 flow [2025-03-04 06:47:02,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 1412 transitions, 19713 flow, removed 50 selfloop flow, removed 12 redundant places. [2025-03-04 06:47:02,450 INFO L231 Difference]: Finished difference. Result has 491 places, 1052 transitions, 15539 flow [2025-03-04 06:47:02,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=12138, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=15539, PETRI_PLACES=491, PETRI_TRANSITIONS=1052} [2025-03-04 06:47:02,451 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 212 predicate places. [2025-03-04 06:47:02,451 INFO L471 AbstractCegarLoop]: Abstraction has has 491 places, 1052 transitions, 15539 flow [2025-03-04 06:47:02,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 113.52830188679245) internal successors, (6017), 53 states have internal predecessors, (6017), 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-03-04 06:47:02,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:02,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 06:47:02,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 06:47:02,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:02,654 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-04 06:47:02,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:02,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1851721489, now seen corresponding path program 1 times [2025-03-04 06:47:02,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:02,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821965225] [2025-03-04 06:47:02,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:02,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:02,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 06:47:02,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 06:47:02,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:02,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:47:03,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:03,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821965225] [2025-03-04 06:47:03,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821965225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:03,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066218911] [2025-03-04 06:47:03,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:03,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:03,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:03,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:03,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 06:47:03,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 06:47:03,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 06:47:03,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:03,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:03,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 06:47:03,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:03,774 INFO L378 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-03-04 06:47:03,797 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 06:47:03,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 06:47:03,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 06:47:03,893 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-03-04 06:47:03,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-03-04 06:47:03,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:47:03,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:47:04,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 06:47:04,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2025-03-04 06:47:04,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 06:47:04,138 INFO L378 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 18 treesize of output 13 [2025-03-04 06:47:04,143 INFO L378 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 18 treesize of output 13 [2025-03-04 06:47:04,147 INFO L378 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 18 treesize of output 13 [2025-03-04 06:47:04,152 INFO L378 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 18 treesize of output 13 [2025-03-04 06:47:04,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 06:47:04,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:47:04,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 34 [2025-03-04 06:47:04,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:47:04,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-04 06:47:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:47:04,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:04,206 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4236 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_4236) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) is different from false [2025-03-04 06:47:04,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:47:04,222 INFO L378 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 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-04 06:47:04,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-03-04 06:47:04,368 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4230 (Array Int Int)) (v_ArrVal_4229 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_4229) c_~B~0.base v_ArrVal_4230) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2025-03-04 06:47:04,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:47:04,461 INFO L378 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 1 case distinctions, treesize of input 23 treesize of output 24 [2025-03-04 06:47:04,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-04 06:47:04,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 06:47:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:47:04,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066218911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:04,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:04,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 29 [2025-03-04 06:47:04,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935158062] [2025-03-04 06:47:04,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:04,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 06:47:04,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:04,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 06:47:04,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=657, Unknown=13, NotChecked=106, Total=870 [2025-03-04 06:47:04,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2025-03-04 06:47:04,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 1052 transitions, 15539 flow. Second operand has 30 states, 30 states have (on average 114.9) internal successors, (3447), 30 states have internal predecessors, (3447), 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-03-04 06:47:04,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:04,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2025-03-04 06:47:04,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand