./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b00ba58edbbf9092a3bbde4865c9e14ef534546a29b4ba514bb7ebaf27fc72c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:31:56,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:31:56,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:31:56,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:31:56,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:31:56,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:31:56,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:31:56,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:31:56,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:31:56,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:31:56,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:31:56,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:31:56,866 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:31:56,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:31:56,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:31:56,867 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:31:56,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:31:56,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:31:56,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:31:56,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:31:56,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:31:56,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:31:56,870 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:31:56,870 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:31:56,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:31:56,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:31:56,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:31:56,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:31:56,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:31:56,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:31:56,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:31:56,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:31:56,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:31:56,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:31:56,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:31:56,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:31:56,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:31:56,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:31:56,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:31:56,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:31:56,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:31:56,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:31:56,872 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-jdk21/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 -> b00ba58edbbf9092a3bbde4865c9e14ef534546a29b4ba514bb7ebaf27fc72c0 [2025-02-08 05:31:57,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:31:57,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:31:57,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:31:57,147 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:31:57,147 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:31:57,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i [2025-02-08 05:31:58,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15f0d5766/2998cea08c634a16b343e80bd6aba38a/FLAG41afd680e [2025-02-08 05:31:58,988 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:31:58,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i [2025-02-08 05:31:59,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15f0d5766/2998cea08c634a16b343e80bd6aba38a/FLAG41afd680e [2025-02-08 05:31:59,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15f0d5766/2998cea08c634a16b343e80bd6aba38a [2025-02-08 05:31:59,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:31:59,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:31:59,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:31:59,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:31:59,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:31:59,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c488a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59, skipping insertion in model container [2025-02-08 05:31:59,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:31:59,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:31:59,499 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:31:59,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:31:59,637 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:31:59,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59 WrapperNode [2025-02-08 05:31:59,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:31:59,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:31:59,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:31:59,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:31:59,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,686 INFO L138 Inliner]: procedures = 368, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 207 [2025-02-08 05:31:59,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:31:59,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:31:59,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:31:59,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:31:59,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:31:59,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:31:59,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:31:59,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:31:59,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (1/1) ... [2025-02-08 05:31:59,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:31:59,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:59,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:31:59,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:31:59,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:31:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:31:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:31:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:31:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:31:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:31:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:31:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:31:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:31:59,805 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:31:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:31:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:31:59,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:31:59,807 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:31:59,940 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:31:59,942 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:32:00,430 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:32:00,433 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:32:00,468 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:32:00,469 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:32:00,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:00 BoogieIcfgContainer [2025-02-08 05:32:00,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:32:00,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:32:00,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:32:00,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:32:00,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:31:59" (1/3) ... [2025-02-08 05:32:00,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1a9f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:00, skipping insertion in model container [2025-02-08 05:32:00,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:59" (2/3) ... [2025-02-08 05:32:00,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1a9f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:00, skipping insertion in model container [2025-02-08 05:32:00,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:00" (3/3) ... [2025-02-08 05:32:00,479 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_05-ptra_rc.i [2025-02-08 05:32:00,492 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:32:00,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_05-ptra_rc.i that has 2 procedures, 241 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-02-08 05:32:00,494 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:32:00,613 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:32:00,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 240 transitions, 484 flow [2025-02-08 05:32:00,770 INFO L124 PetriNetUnfolderBase]: 0/239 cut-off events. [2025-02-08 05:32:00,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:00,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 239 events. 0/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-02-08 05:32:00,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 240 transitions, 484 flow [2025-02-08 05:32:00,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 239 transitions, 481 flow [2025-02-08 05:32:00,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:32:00,809 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;@5caaf34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:32:00,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-08 05:32:00,819 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:32:00,819 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-02-08 05:32:00,820 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:00,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:00,820 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] [2025-02-08 05:32:00,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:00,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:00,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1139656318, now seen corresponding path program 1 times [2025-02-08 05:32:00,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:00,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5500967] [2025-02-08 05:32:00,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:00,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:32:00,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:32:00,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:00,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:01,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:01,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5500967] [2025-02-08 05:32:01,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5500967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:01,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:01,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:01,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906012572] [2025-02-08 05:32:01,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:01,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:01,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:01,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:02,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 240 [2025-02-08 05:32:02,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 239 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-02-08 05:32:02,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:02,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 240 [2025-02-08 05:32:02,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:02,552 INFO L124 PetriNetUnfolderBase]: 220/1062 cut-off events. [2025-02-08 05:32:02,552 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:02,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1062 events. 220/1062 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5484 event pairs, 220 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1401. Up to 493 conditions per place. [2025-02-08 05:32:02,565 INFO L140 encePairwiseOnDemand]: 222/240 looper letters, 52 selfloop transitions, 15 changer transitions 0/236 dead transitions. [2025-02-08 05:32:02,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 236 transitions, 609 flow [2025-02-08 05:32:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2025-02-08 05:32:02,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2025-02-08 05:32:02,591 INFO L175 Difference]: Start difference. First operand has 243 places, 239 transitions, 481 flow. Second operand 6 states and 1090 transitions. [2025-02-08 05:32:02,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 236 transitions, 609 flow [2025-02-08 05:32:02,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 236 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:02,603 INFO L231 Difference]: Finished difference. Result has 244 places, 236 transitions, 504 flow [2025-02-08 05:32:02,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=244, PETRI_TRANSITIONS=236} [2025-02-08 05:32:02,609 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 1 predicate places. [2025-02-08 05:32:02,610 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 236 transitions, 504 flow [2025-02-08 05:32:02,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-02-08 05:32:02,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:02,611 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] [2025-02-08 05:32:02,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:32:02,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:02,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2092819132, now seen corresponding path program 1 times [2025-02-08 05:32:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070443131] [2025-02-08 05:32:02,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:02,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:32:02,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:32:02,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:02,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:03,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:03,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070443131] [2025-02-08 05:32:03,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070443131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:03,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:03,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:03,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522426495] [2025-02-08 05:32:03,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:03,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:03,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:03,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:03,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:03,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 240 [2025-02-08 05:32:03,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 236 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-02-08 05:32:03,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:03,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 240 [2025-02-08 05:32:03,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:03,636 INFO L124 PetriNetUnfolderBase]: 220/1059 cut-off events. [2025-02-08 05:32:03,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:03,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 1059 events. 220/1059 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5464 event pairs, 220 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1426. Up to 493 conditions per place. [2025-02-08 05:32:03,646 INFO L140 encePairwiseOnDemand]: 222/240 looper letters, 52 selfloop transitions, 15 changer transitions 0/233 dead transitions. [2025-02-08 05:32:03,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 233 transitions, 632 flow [2025-02-08 05:32:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2025-02-08 05:32:03,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2025-02-08 05:32:03,652 INFO L175 Difference]: Start difference. First operand has 244 places, 236 transitions, 504 flow. Second operand 6 states and 1090 transitions. [2025-02-08 05:32:03,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 233 transitions, 632 flow [2025-02-08 05:32:03,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 233 transitions, 602 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:03,660 INFO L231 Difference]: Finished difference. Result has 241 places, 233 transitions, 498 flow [2025-02-08 05:32:03,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=241, PETRI_TRANSITIONS=233} [2025-02-08 05:32:03,663 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -2 predicate places. [2025-02-08 05:32:03,663 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 233 transitions, 498 flow [2025-02-08 05:32:03,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-02-08 05:32:03,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:03,664 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] [2025-02-08 05:32:03,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:32:03,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:03,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:03,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1873202314, now seen corresponding path program 1 times [2025-02-08 05:32:03,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:03,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308547419] [2025-02-08 05:32:03,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:03,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:03,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:32:03,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:32:03,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:03,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:03,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308547419] [2025-02-08 05:32:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308547419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:03,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:03,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:32:03,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549051985] [2025-02-08 05:32:03,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:03,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:03,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:03,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:03,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:03,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 240 [2025-02-08 05:32:03,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 233 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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-02-08 05:32:03,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:03,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 240 [2025-02-08 05:32:03,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:03,809 INFO L124 PetriNetUnfolderBase]: 16/368 cut-off events. [2025-02-08 05:32:03,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:03,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 368 events. 16/368 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 791 event pairs, 16 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 288. Up to 47 conditions per place. [2025-02-08 05:32:03,811 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 14 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2025-02-08 05:32:03,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 232 transitions, 528 flow [2025-02-08 05:32:03,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-02-08 05:32:03,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527777777777777 [2025-02-08 05:32:03,814 INFO L175 Difference]: Start difference. First operand has 241 places, 233 transitions, 498 flow. Second operand 3 states and 686 transitions. [2025-02-08 05:32:03,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 232 transitions, 528 flow [2025-02-08 05:32:03,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 232 transitions, 498 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:03,818 INFO L231 Difference]: Finished difference. Result has 237 places, 232 transitions, 470 flow [2025-02-08 05:32:03,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=237, PETRI_TRANSITIONS=232} [2025-02-08 05:32:03,819 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -6 predicate places. [2025-02-08 05:32:03,819 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 232 transitions, 470 flow [2025-02-08 05:32:03,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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-02-08 05:32:03,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:03,820 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] [2025-02-08 05:32:03,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:32:03,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:03,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1873701926, now seen corresponding path program 1 times [2025-02-08 05:32:03,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:03,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778488601] [2025-02-08 05:32:03,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:03,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:03,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:32:03,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:32:03,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:03,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:03,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778488601] [2025-02-08 05:32:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778488601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:03,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:03,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:32:03,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622873120] [2025-02-08 05:32:03,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:03,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:03,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:03,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:03,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 240 [2025-02-08 05:32:03,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 232 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-02-08 05:32:03,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:03,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 240 [2025-02-08 05:32:03,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:03,962 INFO L124 PetriNetUnfolderBase]: 24/445 cut-off events. [2025-02-08 05:32:03,962 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:03,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 445 events. 24/445 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1226 event pairs, 24 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 455. Up to 63 conditions per place. [2025-02-08 05:32:03,964 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 15 selfloop transitions, 1 changer transitions 0/227 dead transitions. [2025-02-08 05:32:03,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 227 transitions, 492 flow [2025-02-08 05:32:03,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 678 transitions. [2025-02-08 05:32:03,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2025-02-08 05:32:03,967 INFO L175 Difference]: Start difference. First operand has 237 places, 232 transitions, 470 flow. Second operand 3 states and 678 transitions. [2025-02-08 05:32:03,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 227 transitions, 492 flow [2025-02-08 05:32:03,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 227 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:32:03,971 INFO L231 Difference]: Finished difference. Result has 232 places, 227 transitions, 458 flow [2025-02-08 05:32:03,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=232, PETRI_TRANSITIONS=227} [2025-02-08 05:32:03,972 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -11 predicate places. [2025-02-08 05:32:03,972 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 227 transitions, 458 flow [2025-02-08 05:32:03,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-02-08 05:32:03,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:03,973 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] [2025-02-08 05:32:03,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:32:03,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:03,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:03,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2033230036, now seen corresponding path program 1 times [2025-02-08 05:32:03,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:03,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868250832] [2025-02-08 05:32:03,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:03,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:04,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:32:04,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:32:04,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:04,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:04,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:04,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868250832] [2025-02-08 05:32:04,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868250832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:04,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:04,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:04,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955467562] [2025-02-08 05:32:04,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:04,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:04,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:04,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:04,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:04,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 240 [2025-02-08 05:32:04,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 227 transitions, 458 flow. Second operand has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 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-02-08 05:32:04,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:04,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 240 [2025-02-08 05:32:04,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:04,998 INFO L124 PetriNetUnfolderBase]: 288/1198 cut-off events. [2025-02-08 05:32:04,998 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:05,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1198 events. 288/1198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6405 event pairs, 288 based on Foata normal form. 0/1137 useless extension candidates. Maximal degree in co-relation 1780. Up to 643 conditions per place. [2025-02-08 05:32:05,006 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 66 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2025-02-08 05:32:05,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 226 transitions, 598 flow [2025-02-08 05:32:05,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1080 transitions. [2025-02-08 05:32:05,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-02-08 05:32:05,009 INFO L175 Difference]: Start difference. First operand has 232 places, 227 transitions, 458 flow. Second operand 6 states and 1080 transitions. [2025-02-08 05:32:05,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 226 transitions, 598 flow [2025-02-08 05:32:05,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 226 transitions, 597 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:05,016 INFO L231 Difference]: Finished difference. Result has 235 places, 226 transitions, 465 flow [2025-02-08 05:32:05,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=235, PETRI_TRANSITIONS=226} [2025-02-08 05:32:05,018 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -8 predicate places. [2025-02-08 05:32:05,018 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 226 transitions, 465 flow [2025-02-08 05:32:05,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 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-02-08 05:32:05,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:05,020 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] [2025-02-08 05:32:05,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:32:05,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:05,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1627023198, now seen corresponding path program 1 times [2025-02-08 05:32:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476728902] [2025-02-08 05:32:05,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:05,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:32:05,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:32:05,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:05,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:05,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:05,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476728902] [2025-02-08 05:32:05,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476728902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:05,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:05,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:32:05,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798425424] [2025-02-08 05:32:05,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:05,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:05,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:05,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:05,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:05,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 240 [2025-02-08 05:32:05,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 226 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-02-08 05:32:05,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:05,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 240 [2025-02-08 05:32:05,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:05,167 INFO L124 PetriNetUnfolderBase]: 6/289 cut-off events. [2025-02-08 05:32:05,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:05,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 289 events. 6/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 402 event pairs, 6 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 263. Up to 23 conditions per place. [2025-02-08 05:32:05,169 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 10 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-02-08 05:32:05,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 225 transitions, 487 flow [2025-02-08 05:32:05,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-02-08 05:32:05,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9638888888888889 [2025-02-08 05:32:05,172 INFO L175 Difference]: Start difference. First operand has 235 places, 226 transitions, 465 flow. Second operand 3 states and 694 transitions. [2025-02-08 05:32:05,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 225 transitions, 487 flow [2025-02-08 05:32:05,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 225 transitions, 477 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:05,175 INFO L231 Difference]: Finished difference. Result has 231 places, 225 transitions, 457 flow [2025-02-08 05:32:05,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=231, PETRI_TRANSITIONS=225} [2025-02-08 05:32:05,176 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -12 predicate places. [2025-02-08 05:32:05,176 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 225 transitions, 457 flow [2025-02-08 05:32:05,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-02-08 05:32:05,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:05,177 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] [2025-02-08 05:32:05,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:32:05,178 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:05,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash 88940205, now seen corresponding path program 1 times [2025-02-08 05:32:05,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:05,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739659291] [2025-02-08 05:32:05,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:05,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:32:05,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:32:05,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:05,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:05,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:05,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739659291] [2025-02-08 05:32:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739659291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:05,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:05,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:32:05,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401043895] [2025-02-08 05:32:05,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:05,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:05,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:05,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:05,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:05,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 240 [2025-02-08 05:32:05,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 225 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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-02-08 05:32:05,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:05,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 240 [2025-02-08 05:32:05,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:05,279 INFO L124 PetriNetUnfolderBase]: 4/286 cut-off events. [2025-02-08 05:32:05,279 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:05,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 286 events. 4/286 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 263 event pairs, 4 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 250. Up to 15 conditions per place. [2025-02-08 05:32:05,280 INFO L140 encePairwiseOnDemand]: 238/240 looper letters, 7 selfloop transitions, 1 changer transitions 0/224 dead transitions. [2025-02-08 05:32:05,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 224 transitions, 471 flow [2025-02-08 05:32:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2025-02-08 05:32:05,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.975 [2025-02-08 05:32:05,282 INFO L175 Difference]: Start difference. First operand has 231 places, 225 transitions, 457 flow. Second operand 3 states and 702 transitions. [2025-02-08 05:32:05,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 224 transitions, 471 flow [2025-02-08 05:32:05,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 224 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:32:05,285 INFO L231 Difference]: Finished difference. Result has 230 places, 224 transitions, 453 flow [2025-02-08 05:32:05,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=230, PETRI_TRANSITIONS=224} [2025-02-08 05:32:05,286 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -13 predicate places. [2025-02-08 05:32:05,286 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 224 transitions, 453 flow [2025-02-08 05:32:05,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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-02-08 05:32:05,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:05,287 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] [2025-02-08 05:32:05,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:32:05,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:05,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash 191346417, now seen corresponding path program 1 times [2025-02-08 05:32:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117305011] [2025-02-08 05:32:05,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:05,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:05,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-08 05:32:05,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-08 05:32:05,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:05,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:05,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:05,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117305011] [2025-02-08 05:32:05,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117305011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:05,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:05,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:05,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981307777] [2025-02-08 05:32:05,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:05,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:05,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:05,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:05,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:06,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 240 [2025-02-08 05:32:06,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 224 transitions, 453 flow. Second operand has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 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-02-08 05:32:06,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:06,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 240 [2025-02-08 05:32:06,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:06,680 INFO L124 PetriNetUnfolderBase]: 316/1522 cut-off events. [2025-02-08 05:32:06,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:06,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 1522 events. 316/1522 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9241 event pairs, 36 based on Foata normal form. 0/1432 useless extension candidates. Maximal degree in co-relation 2192. Up to 388 conditions per place. [2025-02-08 05:32:06,688 INFO L140 encePairwiseOnDemand]: 212/240 looper letters, 107 selfloop transitions, 70 changer transitions 0/336 dead transitions. [2025-02-08 05:32:06,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 336 transitions, 1031 flow [2025-02-08 05:32:06,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1229 transitions. [2025-02-08 05:32:06,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8534722222222222 [2025-02-08 05:32:06,712 INFO L175 Difference]: Start difference. First operand has 230 places, 224 transitions, 453 flow. Second operand 6 states and 1229 transitions. [2025-02-08 05:32:06,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 336 transitions, 1031 flow [2025-02-08 05:32:06,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 336 transitions, 1030 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:06,722 INFO L231 Difference]: Finished difference. Result has 238 places, 294 transitions, 930 flow [2025-02-08 05:32:06,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=930, PETRI_PLACES=238, PETRI_TRANSITIONS=294} [2025-02-08 05:32:06,723 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -5 predicate places. [2025-02-08 05:32:06,724 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 294 transitions, 930 flow [2025-02-08 05:32:06,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 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-02-08 05:32:06,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:06,725 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] [2025-02-08 05:32:06,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:32:06,725 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:06,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash 233285000, now seen corresponding path program 1 times [2025-02-08 05:32:06,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:06,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071599615] [2025-02-08 05:32:06,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:06,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-08 05:32:06,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-08 05:32:06,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:06,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:07,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:07,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071599615] [2025-02-08 05:32:07,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071599615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:07,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:07,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:07,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113154300] [2025-02-08 05:32:07,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:07,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:07,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:07,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:07,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:07,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 240 [2025-02-08 05:32:07,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 294 transitions, 930 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-02-08 05:32:07,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:07,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 240 [2025-02-08 05:32:07,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:08,014 INFO L124 PetriNetUnfolderBase]: 588/2293 cut-off events. [2025-02-08 05:32:08,014 INFO L125 PetriNetUnfolderBase]: For 602/608 co-relation queries the response was YES. [2025-02-08 05:32:08,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4691 conditions, 2293 events. 588/2293 cut-off events. For 602/608 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 15211 event pairs, 222 based on Foata normal form. 0/2182 useless extension candidates. Maximal degree in co-relation 4619. Up to 1090 conditions per place. [2025-02-08 05:32:08,029 INFO L140 encePairwiseOnDemand]: 225/240 looper letters, 114 selfloop transitions, 48 changer transitions 0/345 dead transitions. [2025-02-08 05:32:08,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 345 transitions, 1426 flow [2025-02-08 05:32:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2025-02-08 05:32:08,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-02-08 05:32:08,032 INFO L175 Difference]: Start difference. First operand has 238 places, 294 transitions, 930 flow. Second operand 6 states and 1166 transitions. [2025-02-08 05:32:08,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 345 transitions, 1426 flow [2025-02-08 05:32:08,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 345 transitions, 1426 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:32:08,051 INFO L231 Difference]: Finished difference. Result has 248 places, 337 transitions, 1318 flow [2025-02-08 05:32:08,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1318, PETRI_PLACES=248, PETRI_TRANSITIONS=337} [2025-02-08 05:32:08,052 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 5 predicate places. [2025-02-08 05:32:08,052 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 337 transitions, 1318 flow [2025-02-08 05:32:08,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-02-08 05:32:08,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:08,053 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] [2025-02-08 05:32:08,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:32:08,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:08,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash -833216995, now seen corresponding path program 1 times [2025-02-08 05:32:08,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:08,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480809828] [2025-02-08 05:32:08,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:08,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:08,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 05:32:08,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 05:32:08,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:08,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:08,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480809828] [2025-02-08 05:32:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480809828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:08,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:08,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929548611] [2025-02-08 05:32:08,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:08,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:08,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:08,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:08,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:08,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 240 [2025-02-08 05:32:08,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 337 transitions, 1318 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-02-08 05:32:08,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:08,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 240 [2025-02-08 05:32:08,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:09,554 INFO L124 PetriNetUnfolderBase]: 754/2823 cut-off events. [2025-02-08 05:32:09,554 INFO L125 PetriNetUnfolderBase]: For 1640/1696 co-relation queries the response was YES. [2025-02-08 05:32:09,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2823 events. 754/2823 cut-off events. For 1640/1696 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19770 event pairs, 86 based on Foata normal form. 0/2729 useless extension candidates. Maximal degree in co-relation 6511. Up to 1017 conditions per place. [2025-02-08 05:32:09,575 INFO L140 encePairwiseOnDemand]: 217/240 looper letters, 136 selfloop transitions, 136 changer transitions 4/477 dead transitions. [2025-02-08 05:32:09,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 477 transitions, 2626 flow [2025-02-08 05:32:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1224 transitions. [2025-02-08 05:32:09,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-02-08 05:32:09,578 INFO L175 Difference]: Start difference. First operand has 248 places, 337 transitions, 1318 flow. Second operand 6 states and 1224 transitions. [2025-02-08 05:32:09,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 477 transitions, 2626 flow [2025-02-08 05:32:09,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 477 transitions, 2608 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-08 05:32:09,594 INFO L231 Difference]: Finished difference. Result has 258 places, 468 transitions, 2666 flow [2025-02-08 05:32:09,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2666, PETRI_PLACES=258, PETRI_TRANSITIONS=468} [2025-02-08 05:32:09,595 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 15 predicate places. [2025-02-08 05:32:09,595 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 468 transitions, 2666 flow [2025-02-08 05:32:09,596 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-02-08 05:32:09,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:09,596 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-02-08 05:32:09,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:32:09,596 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:09,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:09,597 INFO L85 PathProgramCache]: Analyzing trace with hash -794409332, now seen corresponding path program 1 times [2025-02-08 05:32:09,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:09,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530214762] [2025-02-08 05:32:09,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:09,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:09,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 05:32:09,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 05:32:09,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:09,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:10,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530214762] [2025-02-08 05:32:10,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530214762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:10,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:10,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:10,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677373942] [2025-02-08 05:32:10,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:10,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:10,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:10,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:10,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:10,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 240 [2025-02-08 05:32:10,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 468 transitions, 2666 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-02-08 05:32:10,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:10,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 240 [2025-02-08 05:32:10,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:10,904 INFO L124 PetriNetUnfolderBase]: 968/3386 cut-off events. [2025-02-08 05:32:10,904 INFO L125 PetriNetUnfolderBase]: For 3817/3888 co-relation queries the response was YES. [2025-02-08 05:32:10,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9627 conditions, 3386 events. 968/3386 cut-off events. For 3817/3888 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 24375 event pairs, 207 based on Foata normal form. 0/3298 useless extension candidates. Maximal degree in co-relation 9545. Up to 1565 conditions per place. [2025-02-08 05:32:10,929 INFO L140 encePairwiseOnDemand]: 225/240 looper letters, 239 selfloop transitions, 62 changer transitions 0/525 dead transitions. [2025-02-08 05:32:10,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 525 transitions, 3610 flow [2025-02-08 05:32:10,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2025-02-08 05:32:10,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-02-08 05:32:10,933 INFO L175 Difference]: Start difference. First operand has 258 places, 468 transitions, 2666 flow. Second operand 6 states and 1166 transitions. [2025-02-08 05:32:10,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 525 transitions, 3610 flow [2025-02-08 05:32:10,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 525 transitions, 3574 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-02-08 05:32:10,965 INFO L231 Difference]: Finished difference. Result has 268 places, 517 transitions, 3256 flow [2025-02-08 05:32:10,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3256, PETRI_PLACES=268, PETRI_TRANSITIONS=517} [2025-02-08 05:32:10,966 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 25 predicate places. [2025-02-08 05:32:10,966 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 517 transitions, 3256 flow [2025-02-08 05:32:10,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-02-08 05:32:10,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:10,967 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] [2025-02-08 05:32:10,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:32:10,968 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:10,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:10,969 INFO L85 PathProgramCache]: Analyzing trace with hash -910476167, now seen corresponding path program 1 times [2025-02-08 05:32:10,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:10,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028466007] [2025-02-08 05:32:10,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:10,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-08 05:32:11,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:32:11,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:11,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:11,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:11,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028466007] [2025-02-08 05:32:11,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028466007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:11,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:11,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 05:32:11,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086253294] [2025-02-08 05:32:11,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:11,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 05:32:11,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:11,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 05:32:11,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:32:13,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2025-02-08 05:32:13,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 517 transitions, 3256 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-02-08 05:32:13,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:13,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2025-02-08 05:32:13,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:14,821 INFO L124 PetriNetUnfolderBase]: 1524/5131 cut-off events. [2025-02-08 05:32:14,821 INFO L125 PetriNetUnfolderBase]: For 8753/8854 co-relation queries the response was YES. [2025-02-08 05:32:14,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16430 conditions, 5131 events. 1524/5131 cut-off events. For 8753/8854 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 41517 event pairs, 111 based on Foata normal form. 47/5076 useless extension candidates. Maximal degree in co-relation 16338. Up to 1002 conditions per place. [2025-02-08 05:32:14,861 INFO L140 encePairwiseOnDemand]: 211/240 looper letters, 478 selfloop transitions, 172 changer transitions 0/843 dead transitions. [2025-02-08 05:32:14,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 843 transitions, 7206 flow [2025-02-08 05:32:14,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 05:32:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 05:32:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3314 transitions. [2025-02-08 05:32:14,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7267543859649123 [2025-02-08 05:32:14,869 INFO L175 Difference]: Start difference. First operand has 268 places, 517 transitions, 3256 flow. Second operand 19 states and 3314 transitions. [2025-02-08 05:32:14,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 843 transitions, 7206 flow [2025-02-08 05:32:14,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 843 transitions, 7024 flow, removed 91 selfloop flow, removed 0 redundant places. [2025-02-08 05:32:14,982 INFO L231 Difference]: Finished difference. Result has 295 places, 640 transitions, 4992 flow [2025-02-08 05:32:14,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=3144, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4992, PETRI_PLACES=295, PETRI_TRANSITIONS=640} [2025-02-08 05:32:14,984 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 52 predicate places. [2025-02-08 05:32:14,985 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 640 transitions, 4992 flow [2025-02-08 05:32:14,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-02-08 05:32:14,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:14,986 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] [2025-02-08 05:32:14,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:32:14,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:14,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:14,987 INFO L85 PathProgramCache]: Analyzing trace with hash -966143385, now seen corresponding path program 2 times [2025-02-08 05:32:14,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:14,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410505041] [2025-02-08 05:32:14,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:32:14,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:15,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-02-08 05:32:15,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 149 of 151 statements. [2025-02-08 05:32:15,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:32:15,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:16,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:16,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410505041] [2025-02-08 05:32:16,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410505041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:16,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 05:32:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347312911] [2025-02-08 05:32:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:16,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 05:32:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:16,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 05:32:16,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:32:16,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2025-02-08 05:32:16,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 640 transitions, 4992 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-02-08 05:32:16,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:16,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2025-02-08 05:32:16,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:18,421 INFO L124 PetriNetUnfolderBase]: 2138/7193 cut-off events. [2025-02-08 05:32:18,422 INFO L125 PetriNetUnfolderBase]: For 17219/17439 co-relation queries the response was YES. [2025-02-08 05:32:18,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24652 conditions, 7193 events. 2138/7193 cut-off events. For 17219/17439 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 65516 event pairs, 198 based on Foata normal form. 57/7126 useless extension candidates. Maximal degree in co-relation 24547. Up to 2162 conditions per place. [2025-02-08 05:32:18,541 INFO L140 encePairwiseOnDemand]: 207/240 looper letters, 458 selfloop transitions, 189 changer transitions 1/841 dead transitions. [2025-02-08 05:32:18,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 841 transitions, 8174 flow [2025-02-08 05:32:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 05:32:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 05:32:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2614 transitions. [2025-02-08 05:32:18,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7261111111111112 [2025-02-08 05:32:18,548 INFO L175 Difference]: Start difference. First operand has 295 places, 640 transitions, 4992 flow. Second operand 15 states and 2614 transitions. [2025-02-08 05:32:18,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 841 transitions, 8174 flow [2025-02-08 05:32:18,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 841 transitions, 8119 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:18,636 INFO L231 Difference]: Finished difference. Result has 314 places, 736 transitions, 7002 flow [2025-02-08 05:32:18,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=4951, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7002, PETRI_PLACES=314, PETRI_TRANSITIONS=736} [2025-02-08 05:32:18,638 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 71 predicate places. [2025-02-08 05:32:18,638 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 736 transitions, 7002 flow [2025-02-08 05:32:18,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-02-08 05:32:18,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:18,639 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] [2025-02-08 05:32:18,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:32:18,639 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:18,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash 602291321, now seen corresponding path program 3 times [2025-02-08 05:32:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:18,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297570489] [2025-02-08 05:32:18,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:32:18,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:18,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 2 equivalence classes. [2025-02-08 05:32:18,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 149 of 151 statements. [2025-02-08 05:32:18,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:32:18,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297570489] [2025-02-08 05:32:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297570489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:19,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:19,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 05:32:19,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167960174] [2025-02-08 05:32:19,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:19,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 05:32:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:19,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 05:32:19,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:32:20,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2025-02-08 05:32:20,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 736 transitions, 7002 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-02-08 05:32:20,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:20,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2025-02-08 05:32:20,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:23,415 INFO L124 PetriNetUnfolderBase]: 3213/10760 cut-off events. [2025-02-08 05:32:23,415 INFO L125 PetriNetUnfolderBase]: For 35245/35596 co-relation queries the response was YES. [2025-02-08 05:32:23,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38860 conditions, 10760 events. 3213/10760 cut-off events. For 35245/35596 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 108762 event pairs, 300 based on Foata normal form. 116/10689 useless extension candidates. Maximal degree in co-relation 38744. Up to 2268 conditions per place. [2025-02-08 05:32:23,499 INFO L140 encePairwiseOnDemand]: 205/240 looper letters, 525 selfloop transitions, 374 changer transitions 2/1094 dead transitions. [2025-02-08 05:32:23,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1094 transitions, 12605 flow [2025-02-08 05:32:23,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 05:32:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 05:32:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3353 transitions. [2025-02-08 05:32:23,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7353070175438596 [2025-02-08 05:32:23,505 INFO L175 Difference]: Start difference. First operand has 314 places, 736 transitions, 7002 flow. Second operand 19 states and 3353 transitions. [2025-02-08 05:32:23,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1094 transitions, 12605 flow [2025-02-08 05:32:23,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 1094 transitions, 12570 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-02-08 05:32:23,711 INFO L231 Difference]: Finished difference. Result has 344 places, 884 transitions, 10755 flow [2025-02-08 05:32:23,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=6971, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10755, PETRI_PLACES=344, PETRI_TRANSITIONS=884} [2025-02-08 05:32:23,713 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 101 predicate places. [2025-02-08 05:32:23,713 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 884 transitions, 10755 flow [2025-02-08 05:32:23,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-02-08 05:32:23,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:23,715 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] [2025-02-08 05:32:23,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:32:23,715 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:23,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1769915901, now seen corresponding path program 4 times [2025-02-08 05:32:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:23,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694965277] [2025-02-08 05:32:23,717 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:32:23,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:23,741 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 151 statements into 2 equivalence classes. [2025-02-08 05:32:23,754 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 145 of 151 statements. [2025-02-08 05:32:23,755 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:32:23,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:24,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:24,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694965277] [2025-02-08 05:32:24,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694965277] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:24,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694266367] [2025-02-08 05:32:24,601 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:32:24,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:24,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:24,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:32:24,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:32:24,752 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 151 statements into 2 equivalence classes. [2025-02-08 05:32:24,819 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 145 of 151 statements. [2025-02-08 05:32:24,820 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:32:24,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:24,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 05:32:24,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:24,879 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-02-08 05:32:24,967 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 05:32:24,969 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-02-08 05:32:25,071 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:32:25,072 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-02-08 05:32:25,091 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-02-08 05:32:25,100 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 23 treesize of output 22 [2025-02-08 05:32:25,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:25,118 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-02-08 05:32:25,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:25,143 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-02-08 05:32:25,207 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-02-08 05:32:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:25,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:27,184 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-02-08 05:32:27,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 6)) (.cse2 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) .cse2) 0))))) is different from false [2025-02-08 05:32:29,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:29,132 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 37 treesize of output 53 [2025-02-08 05:32:29,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:29,142 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 66 treesize of output 36 [2025-02-08 05:32:29,155 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-02-08 05:32:29,156 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 4 case distinctions, treesize of input 37 treesize of output 1 [2025-02-08 05:32:29,163 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-02-08 05:32:29,163 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 4 case distinctions, treesize of input 37 treesize of output 1 [2025-02-08 05:32:29,170 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-02-08 05:32:29,170 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 4 case distinctions, treesize of input 37 treesize of output 1 [2025-02-08 05:32:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:29,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694266367] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:32:29,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:32:29,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2025-02-08 05:32:29,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203289836] [2025-02-08 05:32:29,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:32:29,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 05:32:29,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:29,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 05:32:29,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=205, Unknown=22, NotChecked=62, Total=342 [2025-02-08 05:32:29,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 240 [2025-02-08 05:32:29,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 884 transitions, 10755 flow. Second operand has 19 states, 19 states have (on average 129.42105263157896) internal successors, (2459), 19 states have internal predecessors, (2459), 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-02-08 05:32:29,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:29,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 240 [2025-02-08 05:32:29,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:34,194 INFO L124 PetriNetUnfolderBase]: 5368/15024 cut-off events. [2025-02-08 05:32:34,194 INFO L125 PetriNetUnfolderBase]: For 65728/66200 co-relation queries the response was YES. [2025-02-08 05:32:34,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60290 conditions, 15024 events. 5368/15024 cut-off events. For 65728/66200 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 146899 event pairs, 1097 based on Foata normal form. 42/14777 useless extension candidates. Maximal degree in co-relation 60152. Up to 5220 conditions per place. [2025-02-08 05:32:34,323 INFO L140 encePairwiseOnDemand]: 219/240 looper letters, 834 selfloop transitions, 215 changer transitions 0/1166 dead transitions. [2025-02-08 05:32:34,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1166 transitions, 15293 flow [2025-02-08 05:32:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 05:32:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 05:32:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2648 transitions. [2025-02-08 05:32:34,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5807017543859649 [2025-02-08 05:32:34,326 INFO L175 Difference]: Start difference. First operand has 344 places, 884 transitions, 10755 flow. Second operand 19 states and 2648 transitions. [2025-02-08 05:32:34,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 1166 transitions, 15293 flow [2025-02-08 05:32:34,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1166 transitions, 15202 flow, removed 43 selfloop flow, removed 3 redundant places. [2025-02-08 05:32:34,695 INFO L231 Difference]: Finished difference. Result has 368 places, 945 transitions, 12283 flow [2025-02-08 05:32:34,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=10664, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=12283, PETRI_PLACES=368, PETRI_TRANSITIONS=945} [2025-02-08 05:32:34,696 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 125 predicate places. [2025-02-08 05:32:34,696 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 945 transitions, 12283 flow [2025-02-08 05:32:34,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 129.42105263157896) internal successors, (2459), 19 states have internal predecessors, (2459), 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-02-08 05:32:34,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:34,697 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] [2025-02-08 05:32:34,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:32:34,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 05:32:34,898 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:34,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:34,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1402149683, now seen corresponding path program 1 times [2025-02-08 05:32:34,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:34,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103945657] [2025-02-08 05:32:34,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:34,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:34,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-08 05:32:34,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:32:34,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:34,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:36,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:36,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103945657] [2025-02-08 05:32:36,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103945657] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:36,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134678273] [2025-02-08 05:32:36,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:36,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:36,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:36,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:32:36,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:32:36,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-08 05:32:36,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:32:36,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:36,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:36,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 05:32:36,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:36,437 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-02-08 05:32:36,520 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 05:32:36,521 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-02-08 05:32:36,608 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:32:36,608 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-02-08 05:32:36,675 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-02-08 05:32:36,701 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-02-08 05:32:36,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:36,740 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-02-08 05:32:36,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:36,781 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-02-08 05:32:36,835 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-02-08 05:32:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:36,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:36,870 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|)))) is different from false [2025-02-08 05:32:36,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|))))) is different from false [2025-02-08 05:32:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:41,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134678273] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:32:41,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:32:41,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-02-08 05:32:41,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28550928] [2025-02-08 05:32:41,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:32:41,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 05:32:41,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:41,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 05:32:41,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=556, Unknown=19, NotChecked=98, Total=756 [2025-02-08 05:32:41,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 240 [2025-02-08 05:32:41,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 945 transitions, 12283 flow. Second operand has 28 states, 28 states have (on average 127.35714285714286) internal successors, (3566), 28 states have internal predecessors, (3566), 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-02-08 05:32:41,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:41,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 240 [2025-02-08 05:32:41,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:46,473 INFO L124 PetriNetUnfolderBase]: 5546/15179 cut-off events. [2025-02-08 05:32:46,473 INFO L125 PetriNetUnfolderBase]: For 82511/82869 co-relation queries the response was YES. [2025-02-08 05:32:46,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64016 conditions, 15179 events. 5546/15179 cut-off events. For 82511/82869 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 147695 event pairs, 1243 based on Foata normal form. 115/15026 useless extension candidates. Maximal degree in co-relation 63868. Up to 5456 conditions per place. [2025-02-08 05:32:46,705 INFO L140 encePairwiseOnDemand]: 218/240 looper letters, 853 selfloop transitions, 195 changer transitions 0/1162 dead transitions. [2025-02-08 05:32:46,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1162 transitions, 17111 flow [2025-02-08 05:32:46,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 05:32:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 05:32:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2084 transitions. [2025-02-08 05:32:46,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5788888888888889 [2025-02-08 05:32:46,708 INFO L175 Difference]: Start difference. First operand has 368 places, 945 transitions, 12283 flow. Second operand 15 states and 2084 transitions. [2025-02-08 05:32:46,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1162 transitions, 17111 flow [2025-02-08 05:32:47,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 1162 transitions, 16820 flow, removed 124 selfloop flow, removed 9 redundant places. [2025-02-08 05:32:47,107 INFO L231 Difference]: Finished difference. Result has 378 places, 963 transitions, 13063 flow [2025-02-08 05:32:47,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=12108, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13063, PETRI_PLACES=378, PETRI_TRANSITIONS=963} [2025-02-08 05:32:47,108 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 135 predicate places. [2025-02-08 05:32:47,108 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 963 transitions, 13063 flow [2025-02-08 05:32:47,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 127.35714285714286) internal successors, (3566), 28 states have internal predecessors, (3566), 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-02-08 05:32:47,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:47,109 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] [2025-02-08 05:32:47,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 05:32:47,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 05:32:47,310 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:47,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:47,311 INFO L85 PathProgramCache]: Analyzing trace with hash 984533089, now seen corresponding path program 5 times [2025-02-08 05:32:47,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:47,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791552485] [2025-02-08 05:32:47,312 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:32:47,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:47,336 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-02-08 05:32:47,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:32:47,353 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:32:47,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:48,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791552485] [2025-02-08 05:32:48,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791552485] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476334291] [2025-02-08 05:32:48,110 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:32:48,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:48,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:48,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:32:48,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 05:32:48,281 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-02-08 05:32:48,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:32:48,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:32:48,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:48,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 05:32:48,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:48,432 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-02-08 05:32:48,498 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 05:32:48,499 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-02-08 05:32:48,566 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:32:48,566 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-02-08 05:32:48,578 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-02-08 05:32:48,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 23 treesize of output 22 [2025-02-08 05:32:48,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:48,605 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-02-08 05:32:48,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:48,621 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-02-08 05:32:48,698 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-02-08 05:32:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:48,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:48,725 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 5)) 0))) is different from false [2025-02-08 05:32:50,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1969 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse1))) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-02-08 05:32:50,935 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 6)) (.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse2) 0))))) is different from false [2025-02-08 05:32:50,951 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 5)) (.cse1 (+ c_~A~0.offset 6)) (.cse3 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse3) 0))))) is different from false [2025-02-08 05:32:50,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:50,968 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 37 treesize of output 53 [2025-02-08 05:32:50,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:32:50,973 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 66 treesize of output 36 [2025-02-08 05:32:50,984 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-02-08 05:32:50,984 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 4 case distinctions, treesize of input 37 treesize of output 1 [2025-02-08 05:32:50,990 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-02-08 05:32:50,990 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 4 case distinctions, treesize of input 37 treesize of output 1 [2025-02-08 05:32:50,995 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-02-08 05:32:50,996 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 4 case distinctions, treesize of input 37 treesize of output 1 [2025-02-08 05:32:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:51,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476334291] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:32:51,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:32:51,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2025-02-08 05:32:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227401460] [2025-02-08 05:32:51,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:32:51,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 05:32:51,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:51,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 05:32:51,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=207, Unknown=25, NotChecked=132, Total=420 [2025-02-08 05:32:51,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 240 [2025-02-08 05:32:51,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 963 transitions, 13063 flow. Second operand has 21 states, 21 states have (on average 129.0952380952381) internal successors, (2711), 21 states have internal predecessors, (2711), 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-02-08 05:32:51,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:51,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 240 [2025-02-08 05:32:51,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:57,419 INFO L124 PetriNetUnfolderBase]: 7221/19965 cut-off events. [2025-02-08 05:32:57,419 INFO L125 PetriNetUnfolderBase]: For 117894/118475 co-relation queries the response was YES. [2025-02-08 05:32:57,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87549 conditions, 19965 events. 7221/19965 cut-off events. For 117894/118475 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 207628 event pairs, 1404 based on Foata normal form. 141/19748 useless extension candidates. Maximal degree in co-relation 87395. Up to 6113 conditions per place. [2025-02-08 05:32:57,702 INFO L140 encePairwiseOnDemand]: 207/240 looper letters, 909 selfloop transitions, 422 changer transitions 6/1455 dead transitions. [2025-02-08 05:32:57,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1455 transitions, 21295 flow [2025-02-08 05:32:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 05:32:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 05:32:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2885 transitions. [2025-02-08 05:32:57,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6010416666666667 [2025-02-08 05:32:57,704 INFO L175 Difference]: Start difference. First operand has 378 places, 963 transitions, 13063 flow. Second operand 20 states and 2885 transitions. [2025-02-08 05:32:57,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 1455 transitions, 21295 flow [2025-02-08 05:32:58,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1455 transitions, 21114 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 05:32:58,254 INFO L231 Difference]: Finished difference. Result has 399 places, 1078 transitions, 17159 flow [2025-02-08 05:32:58,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=12940, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=963, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=307, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=17159, PETRI_PLACES=399, PETRI_TRANSITIONS=1078} [2025-02-08 05:32:58,255 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 156 predicate places. [2025-02-08 05:32:58,255 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 1078 transitions, 17159 flow [2025-02-08 05:32:58,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 129.0952380952381) internal successors, (2711), 21 states have internal predecessors, (2711), 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-02-08 05:32:58,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:58,257 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] [2025-02-08 05:32:58,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 05:32:58,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:58,458 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:32:58,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1725520067, now seen corresponding path program 6 times [2025-02-08 05:32:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:58,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506279523] [2025-02-08 05:32:58,460 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:32:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:58,479 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 151 statements into 2 equivalence classes. [2025-02-08 05:32:58,501 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:32:58,501 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-08 05:32:58,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:32:59,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:59,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506279523] [2025-02-08 05:32:59,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506279523] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:59,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277037129] [2025-02-08 05:32:59,560 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:32:59,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:59,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:59,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:32:59,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 05:32:59,735 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 151 statements into 2 equivalence classes. [2025-02-08 05:33:00,164 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:33:00,164 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-08 05:33:00,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:00,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 05:33:00,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:33:00,382 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-02-08 05:33:00,416 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-02-08 05:33:00,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:00,497 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-02-08 05:33:00,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:00,534 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-02-08 05:33:00,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:33:00,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:33:00,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:33:00,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:33:00,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:00,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2025-02-08 05:33:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:00,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:33:05,642 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:33:05,644 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:33:05,647 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:33:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:05,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277037129] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:33:05,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:33:05,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 34 [2025-02-08 05:33:05,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110241781] [2025-02-08 05:33:05,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:33:05,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 05:33:05,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:05,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 05:33:05,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1020, Unknown=1, NotChecked=0, Total=1190 [2025-02-08 05:33:12,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]