./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_18-nested_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_18-nested_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf117fc0bf8ae8b9ef4bb89156c7168763fcd2ba3d8567cd686924f85ad04dca --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:36:58,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:36:58,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:36:58,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:36:58,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:36:58,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:36:58,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:36:58,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:36:58,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:36:58,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:36:58,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:36:58,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:36:58,709 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:36:58,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:36:58,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:36:58,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:36:58,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:36:58,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:36:58,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:36:58,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:36:58,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:36:58,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:36:58,711 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:36:58,711 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:36:58,711 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:36:58,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:36:58,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:36:58,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:36:58,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:36:58,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:36:58,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:36:58,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:36:58,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:36:58,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:36:58,712 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:36:58,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:36:58,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:36:58,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:36:58,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:36:58,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:36:58,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:36:58,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:36:58,713 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf117fc0bf8ae8b9ef4bb89156c7168763fcd2ba3d8567cd686924f85ad04dca [2025-03-14 01:36:58,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:36:58,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:36:58,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:36:58,964 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:36:58,964 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:36:58,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_18-nested_rc.i [2025-03-14 01:37:00,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a2ab619/19b67cbef71b42978667236d16826136/FLAG58221602b [2025-03-14 01:37:00,793 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:37:00,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_18-nested_rc.i [2025-03-14 01:37:00,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a2ab619/19b67cbef71b42978667236d16826136/FLAG58221602b [2025-03-14 01:37:00,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a2ab619/19b67cbef71b42978667236d16826136 [2025-03-14 01:37:00,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:37:00,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:37:00,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:37:00,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:37:00,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:37:00,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:37:00" (1/1) ... [2025-03-14 01:37:00,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4209afc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:00, skipping insertion in model container [2025-03-14 01:37:00,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:37:00" (1/1) ... [2025-03-14 01:37:00,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:37:01,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:37:01,400 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:37:01,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:37:01,504 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:37:01,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01 WrapperNode [2025-03-14 01:37:01,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:37:01,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:37:01,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:37:01,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:37:01,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (1/1) ... [2025-03-14 01:37:01,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (1/1) ... [2025-03-14 01:37:01,556 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 286 [2025-03-14 01:37:01,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:37:01,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:37:01,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:37:01,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:37:01,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (1/1) ... [2025-03-14 01:37:01,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (1/1) ... [2025-03-14 01:37:01,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (1/1) ... [2025-03-14 01:37:01,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (1/1) ... [2025-03-14 01:37:01,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (1/1) ... [2025-03-14 01:37:01,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (1/1) ... [2025-03-14 01:37:01,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (1/1) ... [2025-03-14 01:37:01,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (1/1) ... [2025-03-14 01:37:01,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:37:01,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:37:01,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:37:01,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:37:01,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (1/1) ... [2025-03-14 01:37:01,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:37:01,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:01,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:37:01,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:37:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:37:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 01:37:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:37:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:37:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:37:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:37:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:37:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:37:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:37:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:37:01,646 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:37:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:37:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:37:01,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:37:01,647 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:37:01,756 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:37:01,757 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:37:02,182 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:37:02,183 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:37:02,183 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:37:02,207 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:37:02,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:37:02 BoogieIcfgContainer [2025-03-14 01:37:02,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:37:02,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:37:02,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:37:02,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:37:02,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:37:00" (1/3) ... [2025-03-14 01:37:02,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323a9f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:37:02, skipping insertion in model container [2025-03-14 01:37:02,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:01" (2/3) ... [2025-03-14 01:37:02,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323a9f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:37:02, skipping insertion in model container [2025-03-14 01:37:02,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:37:02" (3/3) ... [2025-03-14 01:37:02,215 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_18-nested_rc.i [2025-03-14 01:37:02,226 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:37:02,228 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_18-nested_rc.i that has 2 procedures, 328 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-03-14 01:37:02,228 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:37:02,312 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:37:02,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 330 transitions, 664 flow [2025-03-14 01:37:02,447 INFO L124 PetriNetUnfolderBase]: 3/329 cut-off events. [2025-03-14 01:37:02,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:02,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 329 events. 3/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 129 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 201. Up to 2 conditions per place. [2025-03-14 01:37:02,457 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 330 transitions, 664 flow [2025-03-14 01:37:02,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 329 transitions, 661 flow [2025-03-14 01:37:02,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:37:02,482 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;@36c6ae0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:37:02,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-14 01:37:02,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:37:02,503 INFO L124 PetriNetUnfolderBase]: 2/102 cut-off events. [2025-03-14 01:37:02,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:02,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:02,504 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] [2025-03-14 01:37:02,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:02,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash 537805159, now seen corresponding path program 1 times [2025-03-14 01:37:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:02,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501100958] [2025-03-14 01:37:02,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:02,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:02,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-14 01:37:02,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:37:02,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:02,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:02,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501100958] [2025-03-14 01:37:02,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501100958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:02,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:37:02,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089862565] [2025-03-14 01:37:02,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:02,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:37:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:02,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:37:02,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:37:02,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 330 [2025-03-14 01:37:02,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 329 transitions, 661 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:02,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:02,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 330 [2025-03-14 01:37:02,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:03,046 INFO L124 PetriNetUnfolderBase]: 7/407 cut-off events. [2025-03-14 01:37:03,047 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:37:03,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 407 events. 7/407 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 418 event pairs, 6 based on Foata normal form. 5/382 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-03-14 01:37:03,049 INFO L140 encePairwiseOnDemand]: 325/330 looper letters, 10 selfloop transitions, 2 changer transitions 1/328 dead transitions. [2025-03-14 01:37:03,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 328 transitions, 683 flow [2025-03-14 01:37:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:37:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:37:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-03-14 01:37:03,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9757575757575757 [2025-03-14 01:37:03,060 INFO L175 Difference]: Start difference. First operand has 330 places, 329 transitions, 661 flow. Second operand 3 states and 966 transitions. [2025-03-14 01:37:03,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 328 transitions, 683 flow [2025-03-14 01:37:03,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 328 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:03,072 INFO L231 Difference]: Finished difference. Result has 332 places, 327 transitions, 666 flow [2025-03-14 01:37:03,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=332, PETRI_TRANSITIONS=327} [2025-03-14 01:37:03,076 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 2 predicate places. [2025-03-14 01:37:03,076 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 327 transitions, 666 flow [2025-03-14 01:37:03,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:03,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:03,077 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] [2025-03-14 01:37:03,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:37:03,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:03,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:03,078 INFO L85 PathProgramCache]: Analyzing trace with hash -795116495, now seen corresponding path program 1 times [2025-03-14 01:37:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532402553] [2025-03-14 01:37:03,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:03,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-14 01:37:03,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-14 01:37:03,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:03,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:03,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:03,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532402553] [2025-03-14 01:37:03,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532402553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:03,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635331955] [2025-03-14 01:37:03,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:03,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:03,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:03,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:03,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:37:03,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-14 01:37:03,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-14 01:37:03,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:03,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:03,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:37:03,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:03,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:03,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635331955] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:03,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:03,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:37:03,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871867888] [2025-03-14 01:37:03,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:03,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:37:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:03,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:37:03,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:37:03,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-03-14 01:37:03,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 327 transitions, 666 flow. Second operand has 10 states, 10 states have (on average 315.8) internal successors, (3158), 10 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:03,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:03,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-03-14 01:37:03,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:03,686 INFO L124 PetriNetUnfolderBase]: 7/413 cut-off events. [2025-03-14 01:37:03,686 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:37:03,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 413 events. 7/413 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 413 event pairs, 6 based on Foata normal form. 2/386 useless extension candidates. Maximal degree in co-relation 377. Up to 24 conditions per place. [2025-03-14 01:37:03,687 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 14 selfloop transitions, 9 changer transitions 0/335 dead transitions. [2025-03-14 01:37:03,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 335 transitions, 730 flow [2025-03-14 01:37:03,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:37:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:37:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2851 transitions. [2025-03-14 01:37:03,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95993265993266 [2025-03-14 01:37:03,697 INFO L175 Difference]: Start difference. First operand has 332 places, 327 transitions, 666 flow. Second operand 9 states and 2851 transitions. [2025-03-14 01:37:03,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 335 transitions, 730 flow [2025-03-14 01:37:03,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 335 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:03,705 INFO L231 Difference]: Finished difference. Result has 341 places, 333 transitions, 714 flow [2025-03-14 01:37:03,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=714, PETRI_PLACES=341, PETRI_TRANSITIONS=333} [2025-03-14 01:37:03,708 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 11 predicate places. [2025-03-14 01:37:03,708 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 333 transitions, 714 flow [2025-03-14 01:37:03,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 315.8) internal successors, (3158), 10 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:03,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:03,710 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:03,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:37:03,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:03,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:03,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:03,913 INFO L85 PathProgramCache]: Analyzing trace with hash 859256305, now seen corresponding path program 2 times [2025-03-14 01:37:03,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:03,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660635933] [2025-03-14 01:37:03,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:03,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:03,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-03-14 01:37:03,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 95 of 110 statements. [2025-03-14 01:37:03,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:03,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-14 01:37:04,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:04,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660635933] [2025-03-14 01:37:04,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660635933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:04,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:04,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:04,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791980649] [2025-03-14 01:37:04,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:04,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:04,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:04,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:04,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 330 [2025-03-14 01:37:04,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 333 transitions, 714 flow. Second operand has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:04,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:04,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 330 [2025-03-14 01:37:04,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:05,240 INFO L124 PetriNetUnfolderBase]: 365/1697 cut-off events. [2025-03-14 01:37:05,241 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:37:05,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 1697 events. 365/1697 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9289 event pairs, 364 based on Foata normal form. 0/1572 useless extension candidates. Maximal degree in co-relation 2428. Up to 800 conditions per place. [2025-03-14 01:37:05,252 INFO L140 encePairwiseOnDemand]: 318/330 looper letters, 71 selfloop transitions, 10 changer transitions 0/331 dead transitions. [2025-03-14 01:37:05,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 331 transitions, 872 flow [2025-03-14 01:37:05,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-03-14 01:37:05,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843434343434343 [2025-03-14 01:37:05,288 INFO L175 Difference]: Start difference. First operand has 341 places, 333 transitions, 714 flow. Second operand 6 states and 1553 transitions. [2025-03-14 01:37:05,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 331 transitions, 872 flow [2025-03-14 01:37:05,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 331 transitions, 866 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:05,293 INFO L231 Difference]: Finished difference. Result has 343 places, 331 transitions, 724 flow [2025-03-14 01:37:05,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=724, PETRI_PLACES=343, PETRI_TRANSITIONS=331} [2025-03-14 01:37:05,295 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2025-03-14 01:37:05,295 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 331 transitions, 724 flow [2025-03-14 01:37:05,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:05,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:05,297 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:05,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:37:05,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:05,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1652349966, now seen corresponding path program 1 times [2025-03-14 01:37:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:05,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94449551] [2025-03-14 01:37:05,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:05,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-14 01:37:05,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-14 01:37:05,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:05,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:05,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:05,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94449551] [2025-03-14 01:37:05,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94449551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:05,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652926681] [2025-03-14 01:37:05,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:05,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:05,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:05,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:05,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:37:05,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-14 01:37:05,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-14 01:37:05,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:05,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:05,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:37:05,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:05,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:05,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652926681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:05,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:05,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 01:37:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439797250] [2025-03-14 01:37:05,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:05,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:37:05,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:05,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:37:05,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:37:05,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-03-14 01:37:05,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 331 transitions, 724 flow. Second operand has 18 states, 18 states have (on average 315.8888888888889) internal successors, (5686), 18 states have internal predecessors, (5686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:05,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:05,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-03-14 01:37:05,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:06,011 INFO L124 PetriNetUnfolderBase]: 7/431 cut-off events. [2025-03-14 01:37:06,012 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-14 01:37:06,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 431 events. 7/431 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 402 event pairs, 6 based on Foata normal form. 4/408 useless extension candidates. Maximal degree in co-relation 363. Up to 24 conditions per place. [2025-03-14 01:37:06,014 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 18 selfloop transitions, 21 changer transitions 0/349 dead transitions. [2025-03-14 01:37:06,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 349 transitions, 890 flow [2025-03-14 01:37:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:37:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:37:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6637 transitions. [2025-03-14 01:37:06,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9577200577200577 [2025-03-14 01:37:06,023 INFO L175 Difference]: Start difference. First operand has 343 places, 331 transitions, 724 flow. Second operand 21 states and 6637 transitions. [2025-03-14 01:37:06,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 349 transitions, 890 flow [2025-03-14 01:37:06,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 349 transitions, 870 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:06,028 INFO L231 Difference]: Finished difference. Result has 363 places, 344 transitions, 834 flow [2025-03-14 01:37:06,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=834, PETRI_PLACES=363, PETRI_TRANSITIONS=344} [2025-03-14 01:37:06,029 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 33 predicate places. [2025-03-14 01:37:06,029 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 344 transitions, 834 flow [2025-03-14 01:37:06,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 315.8888888888889) internal successors, (5686), 18 states have internal predecessors, (5686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:06,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:06,032 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:06,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:37:06,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-14 01:37:06,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:06,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2081192078, now seen corresponding path program 2 times [2025-03-14 01:37:06,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:06,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542834416] [2025-03-14 01:37:06,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:06,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:06,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 138 statements into 2 equivalence classes. [2025-03-14 01:37:06,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 103 of 138 statements. [2025-03-14 01:37:06,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:06,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-14 01:37:06,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542834416] [2025-03-14 01:37:06,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542834416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:06,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:06,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947954590] [2025-03-14 01:37:06,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:06,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:06,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:06,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:07,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 330 [2025-03-14 01:37:07,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 344 transitions, 834 flow. Second operand has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:07,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:07,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 330 [2025-03-14 01:37:07,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:07,341 INFO L124 PetriNetUnfolderBase]: 365/1715 cut-off events. [2025-03-14 01:37:07,341 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-14 01:37:07,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 1715 events. 365/1715 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9248 event pairs, 364 based on Foata normal form. 0/1592 useless extension candidates. Maximal degree in co-relation 2430. Up to 800 conditions per place. [2025-03-14 01:37:07,353 INFO L140 encePairwiseOnDemand]: 318/330 looper letters, 71 selfloop transitions, 10 changer transitions 0/342 dead transitions. [2025-03-14 01:37:07,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 342 transitions, 992 flow [2025-03-14 01:37:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-03-14 01:37:07,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843434343434343 [2025-03-14 01:37:07,358 INFO L175 Difference]: Start difference. First operand has 363 places, 344 transitions, 834 flow. Second operand 6 states and 1553 transitions. [2025-03-14 01:37:07,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 342 transitions, 992 flow [2025-03-14 01:37:07,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 342 transitions, 968 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-14 01:37:07,367 INFO L231 Difference]: Finished difference. Result has 360 places, 342 transitions, 826 flow [2025-03-14 01:37:07,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=360, PETRI_TRANSITIONS=342} [2025-03-14 01:37:07,369 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 30 predicate places. [2025-03-14 01:37:07,370 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 342 transitions, 826 flow [2025-03-14 01:37:07,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:07,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:07,371 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:07,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:37:07,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:07,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1862246963, now seen corresponding path program 1 times [2025-03-14 01:37:07,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:07,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994474649] [2025-03-14 01:37:07,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:07,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:07,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-14 01:37:07,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-14 01:37:07,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:07,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:07,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994474649] [2025-03-14 01:37:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994474649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981687761] [2025-03-14 01:37:07,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:07,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:07,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:07,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:07,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:37:07,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-14 01:37:07,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-14 01:37:07,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:07,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:07,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:37:07,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:07,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981687761] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:08,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-14 01:37:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049545820] [2025-03-14 01:37:08,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:08,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:37:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:08,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:37:08,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:37:08,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-03-14 01:37:08,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 342 transitions, 826 flow. Second operand has 23 states, 23 states have (on average 316.0) internal successors, (7268), 23 states have internal predecessors, (7268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:08,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:08,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-03-14 01:37:08,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:08,313 INFO L124 PetriNetUnfolderBase]: 7/444 cut-off events. [2025-03-14 01:37:08,314 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-14 01:37:08,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 444 events. 7/444 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 396 event pairs, 6 based on Foata normal form. 3/422 useless extension candidates. Maximal degree in co-relation 368. Up to 24 conditions per place. [2025-03-14 01:37:08,316 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 21 selfloop transitions, 30 changer transitions 0/359 dead transitions. [2025-03-14 01:37:08,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 359 transitions, 1050 flow [2025-03-14 01:37:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 01:37:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 01:37:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9474 transitions. [2025-03-14 01:37:08,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9569696969696969 [2025-03-14 01:37:08,330 INFO L175 Difference]: Start difference. First operand has 360 places, 342 transitions, 826 flow. Second operand 30 states and 9474 transitions. [2025-03-14 01:37:08,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 359 transitions, 1050 flow [2025-03-14 01:37:08,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 359 transitions, 1030 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:08,337 INFO L231 Difference]: Finished difference. Result has 388 places, 352 transitions, 958 flow [2025-03-14 01:37:08,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=958, PETRI_PLACES=388, PETRI_TRANSITIONS=352} [2025-03-14 01:37:08,340 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 58 predicate places. [2025-03-14 01:37:08,340 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 352 transitions, 958 flow [2025-03-14 01:37:08,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 316.0) internal successors, (7268), 23 states have internal predecessors, (7268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:08,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:08,343 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:08,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:37:08,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:08,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:08,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1562172009, now seen corresponding path program 2 times [2025-03-14 01:37:08,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:08,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16242776] [2025-03-14 01:37:08,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:08,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 165 statements into 2 equivalence classes. [2025-03-14 01:37:08,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 115 of 165 statements. [2025-03-14 01:37:08,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:08,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-14 01:37:08,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:08,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16242776] [2025-03-14 01:37:08,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16242776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:08,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:08,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640806665] [2025-03-14 01:37:08,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:08,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:08,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:08,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:09,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 330 [2025-03-14 01:37:09,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 352 transitions, 958 flow. Second operand has 6 states, 6 states have (on average 243.83333333333334) internal successors, (1463), 6 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:09,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:09,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 330 [2025-03-14 01:37:09,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:09,890 INFO L124 PetriNetUnfolderBase]: 417/1909 cut-off events. [2025-03-14 01:37:09,890 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-14 01:37:09,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 1909 events. 417/1909 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10672 event pairs, 416 based on Foata normal form. 0/1777 useless extension candidates. Maximal degree in co-relation 2722. Up to 914 conditions per place. [2025-03-14 01:37:09,896 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 81 selfloop transitions, 5 changer transitions 0/351 dead transitions. [2025-03-14 01:37:09,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 351 transitions, 1128 flow [2025-03-14 01:37:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1533 transitions. [2025-03-14 01:37:09,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7742424242424243 [2025-03-14 01:37:09,900 INFO L175 Difference]: Start difference. First operand has 388 places, 352 transitions, 958 flow. Second operand 6 states and 1533 transitions. [2025-03-14 01:37:09,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 351 transitions, 1128 flow [2025-03-14 01:37:09,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 351 transitions, 1082 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-14 01:37:09,905 INFO L231 Difference]: Finished difference. Result has 374 places, 351 transitions, 920 flow [2025-03-14 01:37:09,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=920, PETRI_PLACES=374, PETRI_TRANSITIONS=351} [2025-03-14 01:37:09,906 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 44 predicate places. [2025-03-14 01:37:09,906 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 351 transitions, 920 flow [2025-03-14 01:37:09,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.83333333333334) internal successors, (1463), 6 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:09,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:09,908 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:09,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:37:09,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:09,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash 924038688, now seen corresponding path program 1 times [2025-03-14 01:37:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:09,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546855620] [2025-03-14 01:37:09,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:09,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-14 01:37:09,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-14 01:37:09,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:09,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-14 01:37:10,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:10,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546855620] [2025-03-14 01:37:10,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546855620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:10,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:10,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637190024] [2025-03-14 01:37:10,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:10,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:10,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:10,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:11,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 330 [2025-03-14 01:37:11,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 351 transitions, 920 flow. Second operand has 6 states, 6 states have (on average 266.8333333333333) internal successors, (1601), 6 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:11,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:11,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 330 [2025-03-14 01:37:11,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:11,441 INFO L124 PetriNetUnfolderBase]: 257/1749 cut-off events. [2025-03-14 01:37:11,441 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-14 01:37:11,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 1749 events. 257/1749 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10075 event pairs, 34 based on Foata normal form. 0/1620 useless extension candidates. Maximal degree in co-relation 2231. Up to 436 conditions per place. [2025-03-14 01:37:11,447 INFO L140 encePairwiseOnDemand]: 301/330 looper letters, 68 selfloop transitions, 75 changer transitions 0/428 dead transitions. [2025-03-14 01:37:11,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 428 transitions, 1360 flow [2025-03-14 01:37:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1717 transitions. [2025-03-14 01:37:11,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671717171717171 [2025-03-14 01:37:11,451 INFO L175 Difference]: Start difference. First operand has 374 places, 351 transitions, 920 flow. Second operand 6 states and 1717 transitions. [2025-03-14 01:37:11,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 428 transitions, 1360 flow [2025-03-14 01:37:11,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 428 transitions, 1350 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:11,458 INFO L231 Difference]: Finished difference. Result has 378 places, 419 transitions, 1390 flow [2025-03-14 01:37:11,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1390, PETRI_PLACES=378, PETRI_TRANSITIONS=419} [2025-03-14 01:37:11,459 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 48 predicate places. [2025-03-14 01:37:11,459 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 419 transitions, 1390 flow [2025-03-14 01:37:11,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.8333333333333) internal successors, (1601), 6 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:11,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:11,460 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:11,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:37:11,460 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:11,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:11,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1814799138, now seen corresponding path program 1 times [2025-03-14 01:37:11,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:11,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885698257] [2025-03-14 01:37:11,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:11,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-14 01:37:11,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-14 01:37:11,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:11,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-14 01:37:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:12,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885698257] [2025-03-14 01:37:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885698257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:12,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760528508] [2025-03-14 01:37:12,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:12,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:12,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:12,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:12,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:12,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-03-14 01:37:12,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 419 transitions, 1390 flow. Second operand has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:12,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:12,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-03-14 01:37:12,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:12,886 INFO L124 PetriNetUnfolderBase]: 163/1561 cut-off events. [2025-03-14 01:37:12,886 INFO L125 PetriNetUnfolderBase]: For 491/527 co-relation queries the response was YES. [2025-03-14 01:37:12,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 1561 events. 163/1561 cut-off events. For 491/527 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8871 event pairs, 51 based on Foata normal form. 0/1458 useless extension candidates. Maximal degree in co-relation 2370. Up to 335 conditions per place. [2025-03-14 01:37:12,894 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 117 selfloop transitions, 5 changer transitions 0/418 dead transitions. [2025-03-14 01:37:12,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 418 transitions, 1632 flow [2025-03-14 01:37:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2025-03-14 01:37:12,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8449494949494949 [2025-03-14 01:37:12,897 INFO L175 Difference]: Start difference. First operand has 378 places, 419 transitions, 1390 flow. Second operand 6 states and 1673 transitions. [2025-03-14 01:37:12,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 418 transitions, 1632 flow [2025-03-14 01:37:12,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 418 transitions, 1632 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:37:12,906 INFO L231 Difference]: Finished difference. Result has 382 places, 418 transitions, 1398 flow [2025-03-14 01:37:12,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1398, PETRI_PLACES=382, PETRI_TRANSITIONS=418} [2025-03-14 01:37:12,907 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 52 predicate places. [2025-03-14 01:37:12,907 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 418 transitions, 1398 flow [2025-03-14 01:37:12,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:12,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:12,908 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:12,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:37:12,908 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:12,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash 738467225, now seen corresponding path program 1 times [2025-03-14 01:37:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138188193] [2025-03-14 01:37:12,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:12,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-14 01:37:12,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-14 01:37:12,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:12,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-14 01:37:13,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138188193] [2025-03-14 01:37:13,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138188193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:13,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:13,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:13,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649248559] [2025-03-14 01:37:13,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:13,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:13,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:13,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:13,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:13,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 330 [2025-03-14 01:37:13,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 418 transitions, 1398 flow. Second operand has 6 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:13,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:13,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 330 [2025-03-14 01:37:13,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:14,165 INFO L124 PetriNetUnfolderBase]: 701/2966 cut-off events. [2025-03-14 01:37:14,165 INFO L125 PetriNetUnfolderBase]: For 1000/1075 co-relation queries the response was YES. [2025-03-14 01:37:14,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5704 conditions, 2966 events. 701/2966 cut-off events. For 1000/1075 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20009 event pairs, 395 based on Foata normal form. 0/2766 useless extension candidates. Maximal degree in co-relation 5453. Up to 1482 conditions per place. [2025-03-14 01:37:14,178 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 146 selfloop transitions, 5 changer transitions 0/417 dead transitions. [2025-03-14 01:37:14,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 417 transitions, 1698 flow [2025-03-14 01:37:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1543 transitions. [2025-03-14 01:37:14,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7792929292929293 [2025-03-14 01:37:14,181 INFO L175 Difference]: Start difference. First operand has 382 places, 418 transitions, 1398 flow. Second operand 6 states and 1543 transitions. [2025-03-14 01:37:14,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 417 transitions, 1698 flow [2025-03-14 01:37:14,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 417 transitions, 1688 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:14,189 INFO L231 Difference]: Finished difference. Result has 381 places, 417 transitions, 1396 flow [2025-03-14 01:37:14,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1396, PETRI_PLACES=381, PETRI_TRANSITIONS=417} [2025-03-14 01:37:14,190 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 51 predicate places. [2025-03-14 01:37:14,191 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 417 transitions, 1396 flow [2025-03-14 01:37:14,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:14,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:14,191 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:14,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:37:14,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:14,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:14,193 INFO L85 PathProgramCache]: Analyzing trace with hash -688289831, now seen corresponding path program 1 times [2025-03-14 01:37:14,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:14,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57409834] [2025-03-14 01:37:14,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:14,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:14,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-14 01:37:14,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-14 01:37:14,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:14,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-14 01:37:14,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:14,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57409834] [2025-03-14 01:37:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57409834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:14,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:14,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:14,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601058923] [2025-03-14 01:37:14,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:14,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:14,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:14,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:15,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 330 [2025-03-14 01:37:15,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 417 transitions, 1396 flow. Second operand has 6 states, 6 states have (on average 250.66666666666666) internal successors, (1504), 6 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:15,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:15,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 330 [2025-03-14 01:37:15,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:15,475 INFO L124 PetriNetUnfolderBase]: 701/2965 cut-off events. [2025-03-14 01:37:15,475 INFO L125 PetriNetUnfolderBase]: For 1002/1077 co-relation queries the response was YES. [2025-03-14 01:37:15,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5702 conditions, 2965 events. 701/2965 cut-off events. For 1002/1077 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20010 event pairs, 395 based on Foata normal form. 0/2766 useless extension candidates. Maximal degree in co-relation 5451. Up to 1481 conditions per place. [2025-03-14 01:37:15,489 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 145 selfloop transitions, 5 changer transitions 0/416 dead transitions. [2025-03-14 01:37:15,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 416 transitions, 1694 flow [2025-03-14 01:37:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1548 transitions. [2025-03-14 01:37:15,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7818181818181819 [2025-03-14 01:37:15,493 INFO L175 Difference]: Start difference. First operand has 381 places, 417 transitions, 1396 flow. Second operand 6 states and 1548 transitions. [2025-03-14 01:37:15,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 416 transitions, 1694 flow [2025-03-14 01:37:15,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 416 transitions, 1684 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:15,501 INFO L231 Difference]: Finished difference. Result has 380 places, 416 transitions, 1394 flow [2025-03-14 01:37:15,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1394, PETRI_PLACES=380, PETRI_TRANSITIONS=416} [2025-03-14 01:37:15,502 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 50 predicate places. [2025-03-14 01:37:15,502 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 416 transitions, 1394 flow [2025-03-14 01:37:15,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 250.66666666666666) internal successors, (1504), 6 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:15,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:15,503 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:15,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:37:15,503 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:15,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:15,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1019021791, now seen corresponding path program 1 times [2025-03-14 01:37:15,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:15,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451677369] [2025-03-14 01:37:15,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:15,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:15,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-14 01:37:15,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-14 01:37:15,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:15,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-14 01:37:15,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:15,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451677369] [2025-03-14 01:37:15,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451677369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:15,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:15,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:15,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364843447] [2025-03-14 01:37:15,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:15,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:15,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:15,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:15,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:16,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-03-14 01:37:16,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 416 transitions, 1394 flow. Second operand has 6 states, 6 states have (on average 275.1666666666667) internal successors, (1651), 6 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:16,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:16,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-03-14 01:37:16,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:16,743 INFO L124 PetriNetUnfolderBase]: 500/2481 cut-off events. [2025-03-14 01:37:16,743 INFO L125 PetriNetUnfolderBase]: For 968/1060 co-relation queries the response was YES. [2025-03-14 01:37:16,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4638 conditions, 2481 events. 500/2481 cut-off events. For 968/1060 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16071 event pairs, 92 based on Foata normal form. 16/2340 useless extension candidates. Maximal degree in co-relation 4386. Up to 813 conditions per place. [2025-03-14 01:37:16,757 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 131 selfloop transitions, 130 changer transitions 0/553 dead transitions. [2025-03-14 01:37:16,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 553 transitions, 2566 flow [2025-03-14 01:37:16,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1751 transitions. [2025-03-14 01:37:16,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8843434343434343 [2025-03-14 01:37:16,759 INFO L175 Difference]: Start difference. First operand has 380 places, 416 transitions, 1394 flow. Second operand 6 states and 1751 transitions. [2025-03-14 01:37:16,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 553 transitions, 2566 flow [2025-03-14 01:37:16,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 553 transitions, 2556 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:16,768 INFO L231 Difference]: Finished difference. Result has 385 places, 545 transitions, 2612 flow [2025-03-14 01:37:16,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2612, PETRI_PLACES=385, PETRI_TRANSITIONS=545} [2025-03-14 01:37:16,769 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 55 predicate places. [2025-03-14 01:37:16,769 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 545 transitions, 2612 flow [2025-03-14 01:37:16,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.1666666666667) internal successors, (1651), 6 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:16,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:16,770 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:16,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:37:16,770 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:16,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash 468016939, now seen corresponding path program 1 times [2025-03-14 01:37:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646573918] [2025-03-14 01:37:16,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:16,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-14 01:37:16,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-14 01:37:16,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:16,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-14 01:37:17,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:17,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646573918] [2025-03-14 01:37:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646573918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:17,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:17,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560342148] [2025-03-14 01:37:17,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:17,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:17,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:17,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:17,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-03-14 01:37:17,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 545 transitions, 2612 flow. Second operand has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:17,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:17,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-03-14 01:37:17,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:18,048 INFO L124 PetriNetUnfolderBase]: 776/3252 cut-off events. [2025-03-14 01:37:18,049 INFO L125 PetriNetUnfolderBase]: For 3396/3666 co-relation queries the response was YES. [2025-03-14 01:37:18,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7517 conditions, 3252 events. 776/3252 cut-off events. For 3396/3666 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22180 event pairs, 65 based on Foata normal form. 52/3139 useless extension candidates. Maximal degree in co-relation 7261. Up to 1071 conditions per place. [2025-03-14 01:37:18,078 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 251 selfloop transitions, 131 changer transitions 5/683 dead transitions. [2025-03-14 01:37:18,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 683 transitions, 4286 flow [2025-03-14 01:37:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1752 transitions. [2025-03-14 01:37:18,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8848484848484849 [2025-03-14 01:37:18,080 INFO L175 Difference]: Start difference. First operand has 385 places, 545 transitions, 2612 flow. Second operand 6 states and 1752 transitions. [2025-03-14 01:37:18,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 683 transitions, 4286 flow [2025-03-14 01:37:18,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 683 transitions, 4286 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:37:18,116 INFO L231 Difference]: Finished difference. Result has 395 places, 673 transitions, 4092 flow [2025-03-14 01:37:18,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=2612, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4092, PETRI_PLACES=395, PETRI_TRANSITIONS=673} [2025-03-14 01:37:18,117 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 65 predicate places. [2025-03-14 01:37:18,117 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 673 transitions, 4092 flow [2025-03-14 01:37:18,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:18,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:18,120 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:18,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:37:18,121 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:18,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:18,122 INFO L85 PathProgramCache]: Analyzing trace with hash 12257584, now seen corresponding path program 1 times [2025-03-14 01:37:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:18,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849320883] [2025-03-14 01:37:18,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:18,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:18,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-14 01:37:18,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-14 01:37:18,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:18,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-14 01:37:18,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:18,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849320883] [2025-03-14 01:37:18,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849320883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:18,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:18,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:18,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228925785] [2025-03-14 01:37:18,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:18,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:18,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:18,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:18,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:18,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 330 [2025-03-14 01:37:18,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 673 transitions, 4092 flow. Second operand has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:18,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:18,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 330 [2025-03-14 01:37:18,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:19,596 INFO L124 PetriNetUnfolderBase]: 1308/4650 cut-off events. [2025-03-14 01:37:19,596 INFO L125 PetriNetUnfolderBase]: For 4863/4920 co-relation queries the response was YES. [2025-03-14 01:37:19,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12215 conditions, 4650 events. 1308/4650 cut-off events. For 4863/4920 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33787 event pairs, 369 based on Foata normal form. 11/4416 useless extension candidates. Maximal degree in co-relation 11955. Up to 2225 conditions per place. [2025-03-14 01:37:19,618 INFO L140 encePairwiseOnDemand]: 311/330 looper letters, 316 selfloop transitions, 84 changer transitions 0/752 dead transitions. [2025-03-14 01:37:19,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 752 transitions, 5290 flow [2025-03-14 01:37:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1630 transitions. [2025-03-14 01:37:19,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8232323232323232 [2025-03-14 01:37:19,619 INFO L175 Difference]: Start difference. First operand has 395 places, 673 transitions, 4092 flow. Second operand 6 states and 1630 transitions. [2025-03-14 01:37:19,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 752 transitions, 5290 flow [2025-03-14 01:37:19,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 752 transitions, 5036 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-14 01:37:19,638 INFO L231 Difference]: Finished difference. Result has 404 places, 744 transitions, 4628 flow [2025-03-14 01:37:19,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3844, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4628, PETRI_PLACES=404, PETRI_TRANSITIONS=744} [2025-03-14 01:37:19,639 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 74 predicate places. [2025-03-14 01:37:19,639 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 744 transitions, 4628 flow [2025-03-14 01:37:19,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:19,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:19,640 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:19,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:37:19,640 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:19,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash -879237976, now seen corresponding path program 1 times [2025-03-14 01:37:19,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:19,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114049704] [2025-03-14 01:37:19,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:19,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:19,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-14 01:37:19,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-14 01:37:19,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:19,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-14 01:37:20,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:20,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114049704] [2025-03-14 01:37:20,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114049704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:20,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63031774] [2025-03-14 01:37:20,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:20,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:20,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:20,675 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:20,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:37:20,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-14 01:37:20,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-14 01:37:20,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:20,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:20,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-14 01:37:20,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:21,305 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-14 01:37:21,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-14 01:37:21,416 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 01:37:21,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-14 01:37:21,621 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:37:21,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-14 01:37:21,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-14 01:37:21,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-03-14 01:37:21,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:21,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-03-14 01:37:21,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:21,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-03-14 01:37:21,791 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 56 treesize of output 45 [2025-03-14 01:37:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-14 01:37:21,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:37:21,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63031774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:21,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:37:21,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 19 [2025-03-14 01:37:21,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412976479] [2025-03-14 01:37:21,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:21,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:37:21,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:21,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:37:21,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-14 01:37:23,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 330 [2025-03-14 01:37:23,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 744 transitions, 4628 flow. Second operand has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:23,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:23,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 330 [2025-03-14 01:37:23,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:24,779 INFO L124 PetriNetUnfolderBase]: 1038/3966 cut-off events. [2025-03-14 01:37:24,779 INFO L125 PetriNetUnfolderBase]: For 6148/6431 co-relation queries the response was YES. [2025-03-14 01:37:24,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11612 conditions, 3966 events. 1038/3966 cut-off events. For 6148/6431 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 27777 event pairs, 87 based on Foata normal form. 74/3894 useless extension candidates. Maximal degree in co-relation 11344. Up to 892 conditions per place. [2025-03-14 01:37:24,845 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 401 selfloop transitions, 143 changer transitions 1/869 dead transitions. [2025-03-14 01:37:24,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 869 transitions, 6652 flow [2025-03-14 01:37:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 01:37:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 01:37:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4514 transitions. [2025-03-14 01:37:24,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046345811051694 [2025-03-14 01:37:24,850 INFO L175 Difference]: Start difference. First operand has 404 places, 744 transitions, 4628 flow. Second operand 17 states and 4514 transitions. [2025-03-14 01:37:24,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 869 transitions, 6652 flow [2025-03-14 01:37:24,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 869 transitions, 6580 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-03-14 01:37:24,944 INFO L231 Difference]: Finished difference. Result has 431 places, 801 transitions, 5574 flow [2025-03-14 01:37:24,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4574, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5574, PETRI_PLACES=431, PETRI_TRANSITIONS=801} [2025-03-14 01:37:24,945 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 101 predicate places. [2025-03-14 01:37:24,945 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 801 transitions, 5574 flow [2025-03-14 01:37:24,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:24,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:24,946 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:25,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 01:37:25,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 01:37:25,147 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:25,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash 130031076, now seen corresponding path program 2 times [2025-03-14 01:37:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:25,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044577815] [2025-03-14 01:37:25,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:25,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 269 statements into 2 equivalence classes. [2025-03-14 01:37:25,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-14 01:37:25,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:37:25,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-14 01:37:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044577815] [2025-03-14 01:37:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044577815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770161846] [2025-03-14 01:37:28,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:28,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:28,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:28,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:37:28,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 269 statements into 2 equivalence classes. [2025-03-14 01:37:29,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-14 01:37:29,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:37:29,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:29,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-14 01:37:29,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:29,354 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-14 01:37:29,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-14 01:37:29,458 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-14 01:37:29,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-14 01:37:29,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-14 01:37:29,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-03-14 01:37:29,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:29,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-03-14 01:37:29,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:29,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-03-14 01:37:29,763 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:37:29,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-14 01:37:29,859 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 56 treesize of output 45 [2025-03-14 01:37:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-14 01:37:29,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:37:29,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770161846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:29,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:37:29,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2025-03-14 01:37:29,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120900749] [2025-03-14 01:37:29,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:29,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:37:29,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:29,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:37:29,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:37:31,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 330 [2025-03-14 01:37:31,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 801 transitions, 5574 flow. Second operand has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:31,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:31,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 330 [2025-03-14 01:37:31,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:33,055 INFO L124 PetriNetUnfolderBase]: 1506/5671 cut-off events. [2025-03-14 01:37:33,055 INFO L125 PetriNetUnfolderBase]: For 13160/13563 co-relation queries the response was YES. [2025-03-14 01:37:33,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17746 conditions, 5671 events. 1506/5671 cut-off events. For 13160/13563 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 45262 event pairs, 98 based on Foata normal form. 199/5678 useless extension candidates. Maximal degree in co-relation 17464. Up to 1301 conditions per place. [2025-03-14 01:37:33,129 INFO L140 encePairwiseOnDemand]: 296/330 looper letters, 419 selfloop transitions, 261 changer transitions 4/1008 dead transitions. [2025-03-14 01:37:33,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1008 transitions, 8770 flow [2025-03-14 01:37:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:37:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:37:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3007 transitions. [2025-03-14 01:37:33,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8283746556473829 [2025-03-14 01:37:33,132 INFO L175 Difference]: Start difference. First operand has 431 places, 801 transitions, 5574 flow. Second operand 11 states and 3007 transitions. [2025-03-14 01:37:33,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1008 transitions, 8770 flow [2025-03-14 01:37:33,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 1008 transitions, 8724 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 01:37:33,237 INFO L231 Difference]: Finished difference. Result has 442 places, 902 transitions, 7765 flow [2025-03-14 01:37:33,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=5550, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7765, PETRI_PLACES=442, PETRI_TRANSITIONS=902} [2025-03-14 01:37:33,239 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 112 predicate places. [2025-03-14 01:37:33,239 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 902 transitions, 7765 flow [2025-03-14 01:37:33,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:33,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:33,240 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:33,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 01:37:33,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-14 01:37:33,441 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:33,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash 150936714, now seen corresponding path program 3 times [2025-03-14 01:37:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:33,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430676493] [2025-03-14 01:37:33,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:37:33,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:33,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 269 statements into 11 equivalence classes. [2025-03-14 01:37:33,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 222 of 269 statements. [2025-03-14 01:37:33,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-14 01:37:33,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-14 01:37:35,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:35,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430676493] [2025-03-14 01:37:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430676493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844368393] [2025-03-14 01:37:35,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:37:35,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:35,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:35,808 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:35,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:37:35,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 269 statements into 11 equivalence classes. [2025-03-14 01:37:37,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 222 of 269 statements. [2025-03-14 01:37:37,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-14 01:37:37,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:37,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-14 01:37:37,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:37,372 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-14 01:37:37,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-14 01:37:37,506 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-14 01:37:37,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-14 01:37:37,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:37:37,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-14 01:37:37,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-14 01:37:37,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-03-14 01:37:37,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:37,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-03-14 01:37:37,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:37,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-03-14 01:37:38,023 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 56 treesize of output 45 [2025-03-14 01:37:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-14 01:37:38,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:37:38,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844368393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:38,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:37:38,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2025-03-14 01:37:38,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802643229] [2025-03-14 01:37:38,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:38,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:37:38,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:38,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:37:38,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:37:40,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 330 [2025-03-14 01:37:40,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 902 transitions, 7765 flow. Second operand has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:40,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:40,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 330 [2025-03-14 01:37:40,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:42,144 INFO L124 PetriNetUnfolderBase]: 2372/8785 cut-off events. [2025-03-14 01:37:42,145 INFO L125 PetriNetUnfolderBase]: For 29458/30113 co-relation queries the response was YES. [2025-03-14 01:37:42,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29138 conditions, 8785 events. 2372/8785 cut-off events. For 29458/30113 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 80525 event pairs, 161 based on Foata normal form. 233/8706 useless extension candidates. Maximal degree in co-relation 28850. Up to 1941 conditions per place. [2025-03-14 01:37:42,220 INFO L140 encePairwiseOnDemand]: 299/330 looper letters, 556 selfloop transitions, 329 changer transitions 1/1210 dead transitions. [2025-03-14 01:37:42,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 1210 transitions, 13094 flow [2025-03-14 01:37:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 01:37:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 01:37:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4268 transitions. [2025-03-14 01:37:42,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8083333333333333 [2025-03-14 01:37:42,231 INFO L175 Difference]: Start difference. First operand has 442 places, 902 transitions, 7765 flow. Second operand 16 states and 4268 transitions. [2025-03-14 01:37:42,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 1210 transitions, 13094 flow [2025-03-14 01:37:42,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 1210 transitions, 12978 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:42,374 INFO L231 Difference]: Finished difference. Result has 463 places, 1062 transitions, 11387 flow [2025-03-14 01:37:42,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=7681, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=902, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11387, PETRI_PLACES=463, PETRI_TRANSITIONS=1062} [2025-03-14 01:37:42,379 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 133 predicate places. [2025-03-14 01:37:42,379 INFO L471 AbstractCegarLoop]: Abstraction has has 463 places, 1062 transitions, 11387 flow [2025-03-14 01:37:42,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:37:42,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:42,380 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:42,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 01:37:42,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-14 01:37:42,585 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:37:42,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:42,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1162884278, now seen corresponding path program 4 times [2025-03-14 01:37:42,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:42,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86658593] [2025-03-14 01:37:42,586 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:37:42,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:42,620 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-03-14 01:37:42,691 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-14 01:37:42,691 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:37:42,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-14 01:37:44,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:44,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86658593] [2025-03-14 01:37:44,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86658593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:44,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523273446] [2025-03-14 01:37:44,077 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:37:44,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:44,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:44,096 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:44,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 01:37:44,358 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-03-14 01:37:46,308 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-14 01:37:46,308 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:37:46,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:46,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-14 01:37:46,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:46,538 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-14 01:37:46,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-14 01:37:46,677 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 01:37:46,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-14 01:37:46,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-14 01:37:46,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-03-14 01:37:46,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:46,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-03-14 01:37:46,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:37:46,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-14 01:37:46,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:46,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-03-14 01:37:46,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2025-03-14 01:37:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-14 01:37:46,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:46,995 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0 1)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ 3 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0)) 0)))) is different from false [2025-03-14 01:37:47,025 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (select |c_#race| |c_~#c~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) .cse2) 0)))))) is different from false [2025-03-14 01:37:47,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (select |c_#race| |c_~#c~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse1)))) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2632) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)) 0)))))) is different from false [2025-03-14 01:37:47,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:47,320 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 50 treesize of output 66 [2025-03-14 01:37:47,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:47,326 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 81 treesize of output 38 [2025-03-14 01:37:47,333 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-14 01:37:47,333 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 51 treesize of output 1 [2025-03-14 01:37:47,337 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-14 01:37:47,337 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 51 treesize of output 1 [2025-03-14 01:37:47,342 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-14 01:37:47,342 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 51 treesize of output 1 [2025-03-14 01:38:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 1 not checked. [2025-03-14 01:38:11,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523273446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:38:11,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:38:11,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-14 01:38:11,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209350046] [2025-03-14 01:38:11,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:38:11,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:38:11,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:11,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:38:11,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=300, Unknown=11, NotChecked=114, Total=506 [2025-03-14 01:38:11,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 330 [2025-03-14 01:38:11,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 1062 transitions, 11387 flow. Second operand has 23 states, 23 states have (on average 144.6086956521739) internal successors, (3326), 23 states have internal predecessors, (3326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:11,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:11,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 330 [2025-03-14 01:38:11,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:17,762 INFO L124 PetriNetUnfolderBase]: 7332/19871 cut-off events. [2025-03-14 01:38:17,762 INFO L125 PetriNetUnfolderBase]: For 80119/80318 co-relation queries the response was YES. [2025-03-14 01:38:17,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72521 conditions, 19871 events. 7332/19871 cut-off events. For 80119/80318 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 191436 event pairs, 1960 based on Foata normal form. 114/19134 useless extension candidates. Maximal degree in co-relation 72150. Up to 5817 conditions per place. [2025-03-14 01:38:17,915 INFO L140 encePairwiseOnDemand]: 296/330 looper letters, 952 selfloop transitions, 420 changer transitions 8/1542 dead transitions. [2025-03-14 01:38:17,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 1542 transitions, 18589 flow [2025-03-14 01:38:17,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 01:38:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 01:38:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2335 transitions. [2025-03-14 01:38:17,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5054112554112554 [2025-03-14 01:38:17,917 INFO L175 Difference]: Start difference. First operand has 463 places, 1062 transitions, 11387 flow. Second operand 14 states and 2335 transitions. [2025-03-14 01:38:17,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 1542 transitions, 18589 flow [2025-03-14 01:38:18,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 1542 transitions, 18492 flow, removed 47 selfloop flow, removed 2 redundant places. [2025-03-14 01:38:18,148 INFO L231 Difference]: Finished difference. Result has 483 places, 1203 transitions, 15606 flow [2025-03-14 01:38:18,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=11302, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15606, PETRI_PLACES=483, PETRI_TRANSITIONS=1203} [2025-03-14 01:38:18,149 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 153 predicate places. [2025-03-14 01:38:18,149 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 1203 transitions, 15606 flow [2025-03-14 01:38:18,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 144.6086956521739) internal successors, (3326), 23 states have internal predecessors, (3326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:38:18,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:18,150 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:38:18,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 01:38:18,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:38:18,351 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:38:18,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash 608988930, now seen corresponding path program 5 times [2025-03-14 01:38:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:18,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504077435] [2025-03-14 01:38:18,352 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:38:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:18,374 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 269 statements into 11 equivalence classes. [2025-03-14 01:38:18,412 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 269 of 269 statements. [2025-03-14 01:38:18,412 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-14 01:38:18,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-14 01:38:19,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504077435] [2025-03-14 01:38:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504077435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:38:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229931394] [2025-03-14 01:38:19,193 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:38:19,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:38:19,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:38:19,195 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:38:19,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 01:38:19,343 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 269 statements into 11 equivalence classes. [2025-03-14 01:38:22,965 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 269 of 269 statements. [2025-03-14 01:38:22,966 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-14 01:38:22,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:22,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-14 01:38:22,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:38:23,461 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-14 01:38:23,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-14 01:38:23,646 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-14 01:38:23,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-14 01:38:24,285 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 13 treesize of output 9 [2025-03-14 01:38:24,316 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 25 treesize of output 24 [2025-03-14 01:38:24,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:38:24,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-14 01:38:24,628 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 0 case distinctions, treesize of input 36 treesize of output 38 [2025-03-14 01:38:24,680 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 0 case distinctions, treesize of input 47 treesize of output 52 [2025-03-14 01:38:24,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2025-03-14 01:38:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-14 01:38:24,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:38:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-14 01:38:28,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229931394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:38:28,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:38:28,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 13] total 40 [2025-03-14 01:38:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539797437] [2025-03-14 01:38:28,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:38:28,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-14 01:38:28,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:28,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-14 01:38:28,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640