./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:21:31,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:21:31,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:21:31,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:21:31,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:21:31,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:21:31,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:21:31,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:21:31,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:21:31,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:21:31,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:21:31,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:21:31,850 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:21:31,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:21:31,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:21:31,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:21:31,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:21:31,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:21:31,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:21:31,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:21:31,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:21:31,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:21:31,851 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:21:31,852 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:21:31,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:21:31,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:21:31,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:21:31,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:21:31,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:21:31,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:21:31,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:21:31,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:21:31,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:21:31,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:21:31,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:21:31,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:21:31,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:21:31,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:21:31,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:21:31,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:21:31,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:21:31,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:21:31,854 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2025-02-06 09:21:32,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:21:32,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:21:32,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:21:32,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:21:32,135 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:21:32,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-02-06 09:21:33,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d7b27fe4/acfa64bba5d04bf09f0c74f701f0e484/FLAG0ad0eceb6 [2025-02-06 09:21:33,749 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:21:33,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-02-06 09:21:33,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d7b27fe4/acfa64bba5d04bf09f0c74f701f0e484/FLAG0ad0eceb6 [2025-02-06 09:21:33,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d7b27fe4/acfa64bba5d04bf09f0c74f701f0e484 [2025-02-06 09:21:33,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:21:33,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:21:33,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:21:33,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:21:33,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:21:33,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:21:33" (1/1) ... [2025-02-06 09:21:33,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5895e379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:33, skipping insertion in model container [2025-02-06 09:21:33,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:21:33" (1/1) ... [2025-02-06 09:21:33,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:21:34,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:21:34,385 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:21:34,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:21:34,551 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:21:34,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34 WrapperNode [2025-02-06 09:21:34,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:21:34,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:21:34,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:21:34,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:21:34,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (1/1) ... [2025-02-06 09:21:34,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (1/1) ... [2025-02-06 09:21:34,625 INFO L138 Inliner]: procedures = 368, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 199 [2025-02-06 09:21:34,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:21:34,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:21:34,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:21:34,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:21:34,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (1/1) ... [2025-02-06 09:21:34,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (1/1) ... [2025-02-06 09:21:34,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (1/1) ... [2025-02-06 09:21:34,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (1/1) ... [2025-02-06 09:21:34,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (1/1) ... [2025-02-06 09:21:34,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (1/1) ... [2025-02-06 09:21:34,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (1/1) ... [2025-02-06 09:21:34,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (1/1) ... [2025-02-06 09:21:34,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:21:34,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:21:34,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:21:34,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:21:34,672 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (1/1) ... [2025-02-06 09:21:34,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:21:34,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:21:34,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:21:34,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:21:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:21:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:21:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:21:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:21:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:21:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:21:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:21:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:21:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:21:34,742 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:21:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:21:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:21:34,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:21:34,744 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:21:34,896 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:21:34,898 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:21:35,418 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:21:35,418 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:21:35,455 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:21:35,455 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:21:35,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:21:35 BoogieIcfgContainer [2025-02-06 09:21:35,455 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:21:35,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:21:35,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:21:35,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:21:35,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:21:33" (1/3) ... [2025-02-06 09:21:35,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c0b30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:21:35, skipping insertion in model container [2025-02-06 09:21:35,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:34" (2/3) ... [2025-02-06 09:21:35,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c0b30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:21:35, skipping insertion in model container [2025-02-06 09:21:35,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:21:35" (3/3) ... [2025-02-06 09:21:35,467 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2025-02-06 09:21:35,479 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:21:35,481 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_04-list2_nr.i that has 2 procedures, 304 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-02-06 09:21:35,481 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:21:35,565 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:21:35,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 303 transitions, 610 flow [2025-02-06 09:21:35,731 INFO L124 PetriNetUnfolderBase]: 0/302 cut-off events. [2025-02-06 09:21:35,734 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:21:35,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 302 events. 0/302 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 194 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-02-06 09:21:35,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 303 transitions, 610 flow [2025-02-06 09:21:35,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 302 transitions, 607 flow [2025-02-06 09:21:35,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:21:35,765 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;@55767e9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:21:35,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-02-06 09:21:35,777 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:21:35,777 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-02-06 09:21:35,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:21:35,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:35,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:35,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:35,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:35,785 INFO L85 PathProgramCache]: Analyzing trace with hash 641313957, now seen corresponding path program 1 times [2025-02-06 09:21:35,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:35,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447669270] [2025-02-06 09:21:35,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:35,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:35,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:21:35,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:21:35,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:35,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:21:36,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:36,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447669270] [2025-02-06 09:21:36,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447669270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:36,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:36,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:36,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888330259] [2025-02-06 09:21:36,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:36,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:36,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:36,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:36,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:37,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 303 [2025-02-06 09:21:37,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 302 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:37,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:37,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 303 [2025-02-06 09:21:37,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:38,049 INFO L124 PetriNetUnfolderBase]: 560/2351 cut-off events. [2025-02-06 09:21:38,050 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:21:38,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 2351 events. 560/2351 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14895 event pairs, 560 based on Foata normal form. 0/2140 useless extension candidates. Maximal degree in co-relation 3350. Up to 1198 conditions per place. [2025-02-06 09:21:38,099 INFO L140 encePairwiseOnDemand]: 279/303 looper letters, 77 selfloop transitions, 20 changer transitions 0/298 dead transitions. [2025-02-06 09:21:38,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 298 transitions, 793 flow [2025-02-06 09:21:38,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1313 transitions. [2025-02-06 09:21:38,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-02-06 09:21:38,123 INFO L175 Difference]: Start difference. First operand has 306 places, 302 transitions, 607 flow. Second operand 6 states and 1313 transitions. [2025-02-06 09:21:38,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 298 transitions, 793 flow [2025-02-06 09:21:38,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 298 transitions, 792 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:21:38,141 INFO L231 Difference]: Finished difference. Result has 306 places, 298 transitions, 638 flow [2025-02-06 09:21:38,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=638, PETRI_PLACES=306, PETRI_TRANSITIONS=298} [2025-02-06 09:21:38,149 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 0 predicate places. [2025-02-06 09:21:38,149 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 298 transitions, 638 flow [2025-02-06 09:21:38,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:38,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:38,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:38,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:21:38,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:38,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:38,152 INFO L85 PathProgramCache]: Analyzing trace with hash 332419785, now seen corresponding path program 1 times [2025-02-06 09:21:38,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:38,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975122695] [2025-02-06 09:21:38,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:38,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:38,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:21:38,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:21:38,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:38,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:21:38,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:38,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975122695] [2025-02-06 09:21:38,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975122695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:38,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:38,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559372822] [2025-02-06 09:21:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:38,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:38,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:38,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:38,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:39,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 303 [2025-02-06 09:21:39,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 298 transitions, 638 flow. Second operand has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:39,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:39,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 303 [2025-02-06 09:21:39,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:39,718 INFO L124 PetriNetUnfolderBase]: 560/2347 cut-off events. [2025-02-06 09:21:39,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:21:39,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 2347 events. 560/2347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14936 event pairs, 560 based on Foata normal form. 0/2140 useless extension candidates. Maximal degree in co-relation 3391. Up to 1198 conditions per place. [2025-02-06 09:21:39,730 INFO L140 encePairwiseOnDemand]: 279/303 looper letters, 77 selfloop transitions, 20 changer transitions 0/294 dead transitions. [2025-02-06 09:21:39,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 294 transitions, 824 flow [2025-02-06 09:21:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1313 transitions. [2025-02-06 09:21:39,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-02-06 09:21:39,735 INFO L175 Difference]: Start difference. First operand has 306 places, 298 transitions, 638 flow. Second operand 6 states and 1313 transitions. [2025-02-06 09:21:39,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 294 transitions, 824 flow [2025-02-06 09:21:39,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 294 transitions, 784 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:21:39,744 INFO L231 Difference]: Finished difference. Result has 302 places, 294 transitions, 630 flow [2025-02-06 09:21:39,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=302, PETRI_TRANSITIONS=294} [2025-02-06 09:21:39,746 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -4 predicate places. [2025-02-06 09:21:39,746 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 294 transitions, 630 flow [2025-02-06 09:21:39,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:39,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:39,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:39,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:21:39,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:39,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1004942018, now seen corresponding path program 1 times [2025-02-06 09:21:39,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:39,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757286533] [2025-02-06 09:21:39,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:39,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:39,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 09:21:39,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 09:21:39,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:39,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:21:39,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:39,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757286533] [2025-02-06 09:21:39,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757286533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:39,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:39,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:21:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011737698] [2025-02-06 09:21:39,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:39,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:21:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:39,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:21:39,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:21:39,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 303 [2025-02-06 09:21:39,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 294 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:39,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:39,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 303 [2025-02-06 09:21:39,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:39,941 INFO L124 PetriNetUnfolderBase]: 30/743 cut-off events. [2025-02-06 09:21:39,941 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:21:39,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 743 events. 30/743 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2665 event pairs, 30 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2025-02-06 09:21:39,944 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 17 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-02-06 09:21:39,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 293 transitions, 666 flow [2025-02-06 09:21:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:21:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:21:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 869 transitions. [2025-02-06 09:21:39,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559955995599559 [2025-02-06 09:21:39,947 INFO L175 Difference]: Start difference. First operand has 302 places, 294 transitions, 630 flow. Second operand 3 states and 869 transitions. [2025-02-06 09:21:39,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 293 transitions, 666 flow [2025-02-06 09:21:39,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 293 transitions, 626 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:21:39,951 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 592 flow [2025-02-06 09:21:39,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=298, PETRI_TRANSITIONS=293} [2025-02-06 09:21:39,952 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -8 predicate places. [2025-02-06 09:21:39,952 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 592 flow [2025-02-06 09:21:39,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:39,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:39,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:39,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:21:39,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:39,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:39,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1550695425, now seen corresponding path program 1 times [2025-02-06 09:21:39,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:39,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609124019] [2025-02-06 09:21:39,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:39,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:21:39,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:21:39,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:39,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:21:40,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:40,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609124019] [2025-02-06 09:21:40,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609124019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:40,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:40,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:21:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120731505] [2025-02-06 09:21:40,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:40,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:21:40,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:40,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:21:40,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:21:40,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-06 09:21:40,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 293 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:40,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:40,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-06 09:21:40,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:40,108 INFO L124 PetriNetUnfolderBase]: 36/775 cut-off events. [2025-02-06 09:21:40,109 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:21:40,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 775 events. 36/775 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3011 event pairs, 36 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 813. Up to 89 conditions per place. [2025-02-06 09:21:40,112 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 17 selfloop transitions, 1 changer transitions 0/289 dead transitions. [2025-02-06 09:21:40,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 289 transitions, 620 flow [2025-02-06 09:21:40,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:21:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:21:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2025-02-06 09:21:40,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515951595159516 [2025-02-06 09:21:40,115 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 592 flow. Second operand 3 states and 865 transitions. [2025-02-06 09:21:40,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 289 transitions, 620 flow [2025-02-06 09:21:40,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 289 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:21:40,120 INFO L231 Difference]: Finished difference. Result has 294 places, 289 transitions, 582 flow [2025-02-06 09:21:40,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=294, PETRI_TRANSITIONS=289} [2025-02-06 09:21:40,122 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2025-02-06 09:21:40,122 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 289 transitions, 582 flow [2025-02-06 09:21:40,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:40,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:40,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:40,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:21:40,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:40,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1910287666, now seen corresponding path program 1 times [2025-02-06 09:21:40,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:40,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717336946] [2025-02-06 09:21:40,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:40,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 09:21:40,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 09:21:40,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:40,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:21:40,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:40,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717336946] [2025-02-06 09:21:40,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717336946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:40,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873448446] [2025-02-06 09:21:40,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:40,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:40,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:40,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:40,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 303 [2025-02-06 09:21:40,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 289 transitions, 582 flow. Second operand has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:40,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:40,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 303 [2025-02-06 09:21:40,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:41,484 INFO L124 PetriNetUnfolderBase]: 638/2544 cut-off events. [2025-02-06 09:21:41,484 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:21:41,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 2544 events. 638/2544 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 16291 event pairs, 638 based on Foata normal form. 0/2342 useless extension candidates. Maximal degree in co-relation 3855. Up to 1370 conditions per place. [2025-02-06 09:21:41,496 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 93 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-02-06 09:21:41,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 288 transitions, 776 flow [2025-02-06 09:21:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1323 transitions. [2025-02-06 09:21:41,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7277227722772277 [2025-02-06 09:21:41,500 INFO L175 Difference]: Start difference. First operand has 294 places, 289 transitions, 582 flow. Second operand 6 states and 1323 transitions. [2025-02-06 09:21:41,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 288 transitions, 776 flow [2025-02-06 09:21:41,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 288 transitions, 775 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:21:41,509 INFO L231 Difference]: Finished difference. Result has 297 places, 288 transitions, 589 flow [2025-02-06 09:21:41,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=297, PETRI_TRANSITIONS=288} [2025-02-06 09:21:41,510 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -9 predicate places. [2025-02-06 09:21:41,510 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 288 transitions, 589 flow [2025-02-06 09:21:41,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:41,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:41,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:41,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:21:41,511 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:41,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash 899781155, now seen corresponding path program 1 times [2025-02-06 09:21:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:41,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342237223] [2025-02-06 09:21:41,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:41,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:21:41,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:21:41,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:41,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:21:41,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:41,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342237223] [2025-02-06 09:21:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342237223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:41,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:41,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:21:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827032599] [2025-02-06 09:21:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:41,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:21:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:41,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:21:41,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:21:41,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 303 [2025-02-06 09:21:41,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 288 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:41,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:41,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 303 [2025-02-06 09:21:41,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:41,760 INFO L124 PetriNetUnfolderBase]: 30/731 cut-off events. [2025-02-06 09:21:41,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:21:41,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 731 events. 30/731 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2737 event pairs, 30 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 762. Up to 78 conditions per place. [2025-02-06 09:21:41,764 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 17 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-02-06 09:21:41,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 287 transitions, 625 flow [2025-02-06 09:21:41,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:21:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:21:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 869 transitions. [2025-02-06 09:21:41,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559955995599559 [2025-02-06 09:21:41,766 INFO L175 Difference]: Start difference. First operand has 297 places, 288 transitions, 589 flow. Second operand 3 states and 869 transitions. [2025-02-06 09:21:41,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 287 transitions, 625 flow [2025-02-06 09:21:41,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 287 transitions, 615 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:21:41,772 INFO L231 Difference]: Finished difference. Result has 293 places, 287 transitions, 581 flow [2025-02-06 09:21:41,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=293, PETRI_TRANSITIONS=287} [2025-02-06 09:21:41,773 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -13 predicate places. [2025-02-06 09:21:41,773 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 287 transitions, 581 flow [2025-02-06 09:21:41,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:41,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:41,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:41,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:21:41,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:41,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1991775005, now seen corresponding path program 1 times [2025-02-06 09:21:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684195804] [2025-02-06 09:21:41,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:41,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 09:21:41,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 09:21:41,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:41,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:41,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-02-06 09:21:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:41,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684195804] [2025-02-06 09:21:41,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684195804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:41,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:41,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:21:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405878683] [2025-02-06 09:21:41,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:41,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:21:41,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:41,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:21:41,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:21:41,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-02-06 09:21:41,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 287 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:41,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:41,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-02-06 09:21:41,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:41,956 INFO L124 PetriNetUnfolderBase]: 36/759 cut-off events. [2025-02-06 09:21:41,957 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:21:41,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 759 events. 36/759 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2915 event pairs, 36 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 799. Up to 89 conditions per place. [2025-02-06 09:21:41,960 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 17 selfloop transitions, 1 changer transitions 0/283 dead transitions. [2025-02-06 09:21:41,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 283 transitions, 609 flow [2025-02-06 09:21:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:21:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:21:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2025-02-06 09:21:41,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515951595159516 [2025-02-06 09:21:41,963 INFO L175 Difference]: Start difference. First operand has 293 places, 287 transitions, 581 flow. Second operand 3 states and 865 transitions. [2025-02-06 09:21:41,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 283 transitions, 609 flow [2025-02-06 09:21:41,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 283 transitions, 605 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:21:41,967 INFO L231 Difference]: Finished difference. Result has 289 places, 283 transitions, 571 flow [2025-02-06 09:21:41,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=289, PETRI_TRANSITIONS=283} [2025-02-06 09:21:41,968 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -17 predicate places. [2025-02-06 09:21:41,968 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 283 transitions, 571 flow [2025-02-06 09:21:41,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:41,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:41,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:41,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:21:41,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:41,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1908061501, now seen corresponding path program 1 times [2025-02-06 09:21:41,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:41,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308633057] [2025-02-06 09:21:41,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:41,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:41,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 09:21:42,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 09:21:42,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:42,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:21:42,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:42,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308633057] [2025-02-06 09:21:42,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308633057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:42,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:42,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:42,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999216220] [2025-02-06 09:21:42,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:42,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:42,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:42,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:42,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:43,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 303 [2025-02-06 09:21:43,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 283 transitions, 571 flow. Second operand has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:43,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:43,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 303 [2025-02-06 09:21:43,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:43,485 INFO L124 PetriNetUnfolderBase]: 638/2453 cut-off events. [2025-02-06 09:21:43,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:21:43,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3834 conditions, 2453 events. 638/2453 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15373 event pairs, 638 based on Foata normal form. 0/2306 useless extension candidates. Maximal degree in co-relation 3766. Up to 1370 conditions per place. [2025-02-06 09:21:43,498 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 93 selfloop transitions, 5 changer transitions 0/282 dead transitions. [2025-02-06 09:21:43,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 282 transitions, 765 flow [2025-02-06 09:21:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1323 transitions. [2025-02-06 09:21:43,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7277227722772277 [2025-02-06 09:21:43,504 INFO L175 Difference]: Start difference. First operand has 289 places, 283 transitions, 571 flow. Second operand 6 states and 1323 transitions. [2025-02-06 09:21:43,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 282 transitions, 765 flow [2025-02-06 09:21:43,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 282 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:21:43,513 INFO L231 Difference]: Finished difference. Result has 292 places, 282 transitions, 578 flow [2025-02-06 09:21:43,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=292, PETRI_TRANSITIONS=282} [2025-02-06 09:21:43,515 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -14 predicate places. [2025-02-06 09:21:43,515 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 282 transitions, 578 flow [2025-02-06 09:21:43,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:43,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:43,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:43,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:21:43,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:43,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:43,519 INFO L85 PathProgramCache]: Analyzing trace with hash -833202783, now seen corresponding path program 1 times [2025-02-06 09:21:43,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:43,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485534301] [2025-02-06 09:21:43,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:43,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:43,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 09:21:43,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 09:21:43,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:43,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:21:44,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:44,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485534301] [2025-02-06 09:21:44,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485534301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:44,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:44,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:44,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291652122] [2025-02-06 09:21:44,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:44,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:44,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:44,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:44,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 303 [2025-02-06 09:21:44,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 282 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:44,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:44,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 303 [2025-02-06 09:21:44,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:45,262 INFO L124 PetriNetUnfolderBase]: 232/1812 cut-off events. [2025-02-06 09:21:45,263 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:21:45,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378 conditions, 1812 events. 232/1812 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11450 event pairs, 20 based on Foata normal form. 0/1688 useless extension candidates. Maximal degree in co-relation 2310. Up to 313 conditions per place. [2025-02-06 09:21:45,271 INFO L140 encePairwiseOnDemand]: 284/303 looper letters, 108 selfloop transitions, 38 changer transitions 0/356 dead transitions. [2025-02-06 09:21:45,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 356 transitions, 1018 flow [2025-02-06 09:21:45,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1534 transitions. [2025-02-06 09:21:45,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437843784378438 [2025-02-06 09:21:45,275 INFO L175 Difference]: Start difference. First operand has 292 places, 282 transitions, 578 flow. Second operand 6 states and 1534 transitions. [2025-02-06 09:21:45,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 356 transitions, 1018 flow [2025-02-06 09:21:45,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 356 transitions, 1008 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:21:45,285 INFO L231 Difference]: Finished difference. Result has 296 places, 318 transitions, 826 flow [2025-02-06 09:21:45,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=296, PETRI_TRANSITIONS=318} [2025-02-06 09:21:45,286 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -10 predicate places. [2025-02-06 09:21:45,286 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 318 transitions, 826 flow [2025-02-06 09:21:45,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:45,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:45,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:45,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:21:45,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:45,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:45,289 INFO L85 PathProgramCache]: Analyzing trace with hash 832417124, now seen corresponding path program 1 times [2025-02-06 09:21:45,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:45,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11664749] [2025-02-06 09:21:45,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:45,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 09:21:45,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 09:21:45,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:45,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:21:45,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11664749] [2025-02-06 09:21:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11664749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:45,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:45,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:45,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471250935] [2025-02-06 09:21:45,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:45,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:45,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:45,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:45,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:46,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 303 [2025-02-06 09:21:46,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 318 transitions, 826 flow. Second operand has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:46,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:46,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 303 [2025-02-06 09:21:46,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:46,674 INFO L124 PetriNetUnfolderBase]: 185/1616 cut-off events. [2025-02-06 09:21:46,674 INFO L125 PetriNetUnfolderBase]: For 202/207 co-relation queries the response was YES. [2025-02-06 09:21:46,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 1616 events. 185/1616 cut-off events. For 202/207 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 10000 event pairs, 75 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 2326. Up to 362 conditions per place. [2025-02-06 09:21:46,684 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 104 selfloop transitions, 5 changer transitions 0/333 dead transitions. [2025-02-06 09:21:46,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 333 transitions, 1074 flow [2025-02-06 09:21:46,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1504 transitions. [2025-02-06 09:21:46,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8272827282728272 [2025-02-06 09:21:46,688 INFO L175 Difference]: Start difference. First operand has 296 places, 318 transitions, 826 flow. Second operand 6 states and 1504 transitions. [2025-02-06 09:21:46,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 333 transitions, 1074 flow [2025-02-06 09:21:46,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 333 transitions, 1074 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:46,699 INFO L231 Difference]: Finished difference. Result has 300 places, 317 transitions, 834 flow [2025-02-06 09:21:46,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=834, PETRI_PLACES=300, PETRI_TRANSITIONS=317} [2025-02-06 09:21:46,701 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -6 predicate places. [2025-02-06 09:21:46,701 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 317 transitions, 834 flow [2025-02-06 09:21:46,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:46,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:46,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:46,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:21:46,703 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:46,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash 231270175, now seen corresponding path program 1 times [2025-02-06 09:21:46,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:46,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500288325] [2025-02-06 09:21:46,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:46,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 09:21:46,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 09:21:46,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:46,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:21:47,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500288325] [2025-02-06 09:21:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500288325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:47,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331264187] [2025-02-06 09:21:47,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:47,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:47,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:47,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:47,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 303 [2025-02-06 09:21:47,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 317 transitions, 834 flow. Second operand has 6 states, 6 states have (on average 236.5) internal successors, (1419), 6 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:47,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:47,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 303 [2025-02-06 09:21:47,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:48,218 INFO L124 PetriNetUnfolderBase]: 583/2973 cut-off events. [2025-02-06 09:21:48,219 INFO L125 PetriNetUnfolderBase]: For 700/707 co-relation queries the response was YES. [2025-02-06 09:21:48,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 2973 events. 583/2973 cut-off events. For 700/707 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21856 event pairs, 69 based on Foata normal form. 0/2786 useless extension candidates. Maximal degree in co-relation 4987. Up to 804 conditions per place. [2025-02-06 09:21:48,232 INFO L140 encePairwiseOnDemand]: 281/303 looper letters, 120 selfloop transitions, 72 changer transitions 0/406 dead transitions. [2025-02-06 09:21:48,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 406 transitions, 1588 flow [2025-02-06 09:21:48,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1506 transitions. [2025-02-06 09:21:48,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8283828382838284 [2025-02-06 09:21:48,236 INFO L175 Difference]: Start difference. First operand has 300 places, 317 transitions, 834 flow. Second operand 6 states and 1506 transitions. [2025-02-06 09:21:48,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 406 transitions, 1588 flow [2025-02-06 09:21:48,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 406 transitions, 1570 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:21:48,246 INFO L231 Difference]: Finished difference. Result has 305 places, 387 transitions, 1490 flow [2025-02-06 09:21:48,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1490, PETRI_PLACES=305, PETRI_TRANSITIONS=387} [2025-02-06 09:21:48,247 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -1 predicate places. [2025-02-06 09:21:48,247 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 387 transitions, 1490 flow [2025-02-06 09:21:48,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.5) internal successors, (1419), 6 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:48,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:48,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:48,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:21:48,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:48,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash -187381016, now seen corresponding path program 1 times [2025-02-06 09:21:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:48,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303183388] [2025-02-06 09:21:48,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:48,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-06 09:21:48,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-06 09:21:48,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:48,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:21:48,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:48,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303183388] [2025-02-06 09:21:48,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303183388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:48,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:48,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521989119] [2025-02-06 09:21:48,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:48,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:48,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:48,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:48,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:49,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 303 [2025-02-06 09:21:49,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 387 transitions, 1490 flow. Second operand has 6 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:49,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:49,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 303 [2025-02-06 09:21:49,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:50,161 INFO L124 PetriNetUnfolderBase]: 1657/5720 cut-off events. [2025-02-06 09:21:50,161 INFO L125 PetriNetUnfolderBase]: For 3354/3414 co-relation queries the response was YES. [2025-02-06 09:21:50,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12817 conditions, 5720 events. 1657/5720 cut-off events. For 3354/3414 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 46021 event pairs, 861 based on Foata normal form. 0/5391 useless extension candidates. Maximal degree in co-relation 12742. Up to 3155 conditions per place. [2025-02-06 09:21:50,195 INFO L140 encePairwiseOnDemand]: 280/303 looper letters, 209 selfloop transitions, 89 changer transitions 0/487 dead transitions. [2025-02-06 09:21:50,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 487 transitions, 2490 flow [2025-02-06 09:21:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1424 transitions. [2025-02-06 09:21:50,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7832783278327833 [2025-02-06 09:21:50,200 INFO L175 Difference]: Start difference. First operand has 305 places, 387 transitions, 1490 flow. Second operand 6 states and 1424 transitions. [2025-02-06 09:21:50,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 487 transitions, 2490 flow [2025-02-06 09:21:50,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 487 transitions, 2490 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:50,216 INFO L231 Difference]: Finished difference. Result has 315 places, 471 transitions, 2292 flow [2025-02-06 09:21:50,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2292, PETRI_PLACES=315, PETRI_TRANSITIONS=471} [2025-02-06 09:21:50,217 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 9 predicate places. [2025-02-06 09:21:50,217 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 471 transitions, 2292 flow [2025-02-06 09:21:50,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:50,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:50,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:50,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:21:50,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:50,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash 620931127, now seen corresponding path program 1 times [2025-02-06 09:21:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:50,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743656281] [2025-02-06 09:21:50,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:50,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 09:21:50,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 09:21:50,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:50,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:21:50,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:50,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743656281] [2025-02-06 09:21:50,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743656281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:50,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:50,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:21:50,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989236334] [2025-02-06 09:21:50,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:50,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:21:50,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:50,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:21:50,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:21:50,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 303 [2025-02-06 09:21:50,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 471 transitions, 2292 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:50,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:50,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 303 [2025-02-06 09:21:50,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:50,662 INFO L124 PetriNetUnfolderBase]: 315/1995 cut-off events. [2025-02-06 09:21:50,662 INFO L125 PetriNetUnfolderBase]: For 1183/1250 co-relation queries the response was YES. [2025-02-06 09:21:50,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4145 conditions, 1995 events. 315/1995 cut-off events. For 1183/1250 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13443 event pairs, 31 based on Foata normal form. 4/1919 useless extension candidates. Maximal degree in co-relation 4072. Up to 312 conditions per place. [2025-02-06 09:21:50,674 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 10 selfloop transitions, 6 changer transitions 0/411 dead transitions. [2025-02-06 09:21:50,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 411 transitions, 1760 flow [2025-02-06 09:21:50,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:21:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:21:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2025-02-06 09:21:50,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9867986798679867 [2025-02-06 09:21:50,677 INFO L175 Difference]: Start difference. First operand has 315 places, 471 transitions, 2292 flow. Second operand 3 states and 897 transitions. [2025-02-06 09:21:50,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 411 transitions, 1760 flow [2025-02-06 09:21:50,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 411 transitions, 1672 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:50,693 INFO L231 Difference]: Finished difference. Result has 318 places, 409 transitions, 1662 flow [2025-02-06 09:21:50,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1662, PETRI_PLACES=318, PETRI_TRANSITIONS=409} [2025-02-06 09:21:50,695 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 12 predicate places. [2025-02-06 09:21:50,695 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 409 transitions, 1662 flow [2025-02-06 09:21:50,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:50,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:50,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:50,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:21:50,696 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:50,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:50,697 INFO L85 PathProgramCache]: Analyzing trace with hash 628300313, now seen corresponding path program 1 times [2025-02-06 09:21:50,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:50,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41138271] [2025-02-06 09:21:50,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:50,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 09:21:50,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 09:21:50,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:50,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:21:51,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:51,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41138271] [2025-02-06 09:21:51,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41138271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:51,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:51,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:51,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410587933] [2025-02-06 09:21:51,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:51,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:51,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:51,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:51,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:51,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 303 [2025-02-06 09:21:51,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 409 transitions, 1662 flow. Second operand has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:51,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:51,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 303 [2025-02-06 09:21:51,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:52,276 INFO L124 PetriNetUnfolderBase]: 690/3138 cut-off events. [2025-02-06 09:21:52,276 INFO L125 PetriNetUnfolderBase]: For 3017/3235 co-relation queries the response was YES. [2025-02-06 09:21:52,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7473 conditions, 3138 events. 690/3138 cut-off events. For 3017/3235 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 23938 event pairs, 54 based on Foata normal form. 20/3047 useless extension candidates. Maximal degree in co-relation 7390. Up to 742 conditions per place. [2025-02-06 09:21:52,290 INFO L140 encePairwiseOnDemand]: 284/303 looper letters, 192 selfloop transitions, 124 changer transitions 4/567 dead transitions. [2025-02-06 09:21:52,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 567 transitions, 3269 flow [2025-02-06 09:21:52,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1552 transitions. [2025-02-06 09:21:52,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8536853685368537 [2025-02-06 09:21:52,296 INFO L175 Difference]: Start difference. First operand has 318 places, 409 transitions, 1662 flow. Second operand 6 states and 1552 transitions. [2025-02-06 09:21:52,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 567 transitions, 3269 flow [2025-02-06 09:21:52,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 567 transitions, 3246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:21:52,319 INFO L231 Difference]: Finished difference. Result has 326 places, 511 transitions, 3038 flow [2025-02-06 09:21:52,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3038, PETRI_PLACES=326, PETRI_TRANSITIONS=511} [2025-02-06 09:21:52,321 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 20 predicate places. [2025-02-06 09:21:52,321 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 511 transitions, 3038 flow [2025-02-06 09:21:52,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:52,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:52,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:52,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:21:52,322 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:52,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:52,323 INFO L85 PathProgramCache]: Analyzing trace with hash -734346093, now seen corresponding path program 1 times [2025-02-06 09:21:52,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:52,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985525175] [2025-02-06 09:21:52,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:52,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 09:21:52,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 09:21:52,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:52,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:21:52,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:52,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985525175] [2025-02-06 09:21:52,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985525175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:52,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:52,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279582824] [2025-02-06 09:21:52,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:52,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:52,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:52,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:52,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:53,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 303 [2025-02-06 09:21:53,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 511 transitions, 3038 flow. Second operand has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:53,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:53,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 303 [2025-02-06 09:21:53,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:54,038 INFO L124 PetriNetUnfolderBase]: 608/2941 cut-off events. [2025-02-06 09:21:54,039 INFO L125 PetriNetUnfolderBase]: For 5544/5717 co-relation queries the response was YES. [2025-02-06 09:21:54,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7925 conditions, 2941 events. 608/2941 cut-off events. For 5544/5717 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22163 event pairs, 92 based on Foata normal form. 18/2903 useless extension candidates. Maximal degree in co-relation 7839. Up to 818 conditions per place. [2025-02-06 09:21:54,055 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 226 selfloop transitions, 17 changer transitions 0/526 dead transitions. [2025-02-06 09:21:54,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 526 transitions, 3578 flow [2025-02-06 09:21:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1504 transitions. [2025-02-06 09:21:54,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8272827282728272 [2025-02-06 09:21:54,059 INFO L175 Difference]: Start difference. First operand has 326 places, 511 transitions, 3038 flow. Second operand 6 states and 1504 transitions. [2025-02-06 09:21:54,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 526 transitions, 3578 flow [2025-02-06 09:21:54,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 526 transitions, 3560 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:54,085 INFO L231 Difference]: Finished difference. Result has 330 places, 510 transitions, 3052 flow [2025-02-06 09:21:54,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3018, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3052, PETRI_PLACES=330, PETRI_TRANSITIONS=510} [2025-02-06 09:21:54,086 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 24 predicate places. [2025-02-06 09:21:54,086 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 510 transitions, 3052 flow [2025-02-06 09:21:54,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:54,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:54,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:54,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:21:54,087 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:54,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:54,089 INFO L85 PathProgramCache]: Analyzing trace with hash 392885271, now seen corresponding path program 1 times [2025-02-06 09:21:54,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:54,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488024244] [2025-02-06 09:21:54,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:54,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-06 09:21:54,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-06 09:21:54,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:54,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:21:54,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:54,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488024244] [2025-02-06 09:21:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488024244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:54,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:54,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:54,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165499437] [2025-02-06 09:21:54,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:54,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:54,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:54,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:54,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:54,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 303 [2025-02-06 09:21:54,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 510 transitions, 3052 flow. Second operand has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:54,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:54,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 303 [2025-02-06 09:21:54,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:55,649 INFO L124 PetriNetUnfolderBase]: 1547/5186 cut-off events. [2025-02-06 09:21:55,649 INFO L125 PetriNetUnfolderBase]: For 7490/7571 co-relation queries the response was YES. [2025-02-06 09:21:55,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15171 conditions, 5186 events. 1547/5186 cut-off events. For 7490/7571 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 41369 event pairs, 582 based on Foata normal form. 1/5034 useless extension candidates. Maximal degree in co-relation 15084. Up to 2889 conditions per place. [2025-02-06 09:21:55,670 INFO L140 encePairwiseOnDemand]: 280/303 looper letters, 312 selfloop transitions, 103 changer transitions 8/616 dead transitions. [2025-02-06 09:21:55,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 616 transitions, 4508 flow [2025-02-06 09:21:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1424 transitions. [2025-02-06 09:21:55,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7832783278327833 [2025-02-06 09:21:55,674 INFO L175 Difference]: Start difference. First operand has 330 places, 510 transitions, 3052 flow. Second operand 6 states and 1424 transitions. [2025-02-06 09:21:55,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 616 transitions, 4508 flow [2025-02-06 09:21:55,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 616 transitions, 4474 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:21:55,707 INFO L231 Difference]: Finished difference. Result has 335 places, 596 transitions, 4036 flow [2025-02-06 09:21:55,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3018, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4036, PETRI_PLACES=335, PETRI_TRANSITIONS=596} [2025-02-06 09:21:55,709 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 29 predicate places. [2025-02-06 09:21:55,709 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 596 transitions, 4036 flow [2025-02-06 09:21:55,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:21:55,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:55,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:55,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:21:55,711 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:21:55,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash -555370240, now seen corresponding path program 1 times [2025-02-06 09:21:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:55,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144699565] [2025-02-06 09:21:55,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:55,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-06 09:21:55,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-06 09:21:55,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:55,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:21:57,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:57,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144699565] [2025-02-06 09:21:57,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144699565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:21:57,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137528534] [2025-02-06 09:21:57,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:57,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:21:57,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:21:57,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:21:57,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:21:57,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-06 09:21:57,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-06 09:21:57,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:57,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:57,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-02-06 09:21:57,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:21:57,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 09:21:58,157 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 09:21:58,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 09:21:58,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 09:21:58,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 09:21:58,656 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2025-02-06 09:21:58,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 26 treesize of output 41 [2025-02-06 09:21:59,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 09:21:59,140 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 26 treesize of output 19 [2025-02-06 09:21:59,394 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 26 treesize of output 19 [2025-02-06 09:21:59,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 09:21:59,612 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2025-02-06 09:21:59,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 29 [2025-02-06 09:21:59,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 09:21:59,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-02-06 09:22:00,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-02-06 09:22:00,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 09:22:00,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-02-06 09:22:00,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-02-06 09:22:01,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2025-02-06 09:22:01,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 09:22:01,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 09:22:01,333 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 21 treesize of output 20 [2025-02-06 09:22:01,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-02-06 09:22:01,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-02-06 09:22:01,520 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 50 treesize of output 47 [2025-02-06 09:22:01,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:22:01,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:03,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:03,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-02-06 09:22:03,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:03,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-02-06 09:22:03,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:03,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-02-06 09:22:03,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:03,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-02-06 09:22:07,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:07,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 297 treesize of output 268 [2025-02-06 09:22:07,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:07,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 228 [2025-02-06 09:22:07,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 389 [2025-02-06 09:22:07,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 385 treesize of output 377 [2025-02-06 09:22:07,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 369 [2025-02-06 09:22:07,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 646 treesize of output 610 [2025-02-06 09:22:07,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 537 treesize of output 529 [2025-02-06 09:22:07,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 529 treesize of output 521 [2025-02-06 09:22:07,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 521 treesize of output 517 [2025-02-06 09:22:07,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 517 treesize of output 509 [2025-02-06 09:22:07,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:07,931 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 509 treesize of output 512 [2025-02-06 09:22:07,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 503 treesize of output 495 [2025-02-06 09:22:07,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:07,953 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 495 treesize of output 498 [2025-02-06 09:22:07,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 489 treesize of output 485 [2025-02-06 09:22:07,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 485 treesize of output 481 [2025-02-06 09:22:07,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:07,995 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 481 treesize of output 484 [2025-02-06 09:22:08,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 475 treesize of output 467 [2025-02-06 09:22:08,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 467 treesize of output 463 [2025-02-06 09:22:08,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 463 treesize of output 455 [2025-02-06 09:22:08,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:08,047 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 455 treesize of output 458 [2025-02-06 09:22:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:22:13,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137528534] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:13,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:13,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 23] total 64 [2025-02-06 09:22:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598675544] [2025-02-06 09:22:13,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:13,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-06 09:22:13,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:13,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-06 09:22:13,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=3730, Unknown=56, NotChecked=0, Total=4160 [2025-02-06 09:22:29,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 303 [2025-02-06 09:22:29,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 596 transitions, 4036 flow. Second operand has 65 states, 65 states have (on average 116.16923076923077) internal successors, (7551), 65 states have internal predecessors, (7551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:29,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:29,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 303 [2025-02-06 09:22:29,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:39,474 INFO L124 PetriNetUnfolderBase]: 2682/7535 cut-off events. [2025-02-06 09:22:39,474 INFO L125 PetriNetUnfolderBase]: For 14378/14406 co-relation queries the response was YES. [2025-02-06 09:22:39,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25472 conditions, 7535 events. 2682/7535 cut-off events. For 14378/14406 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 61012 event pairs, 494 based on Foata normal form. 18/7484 useless extension candidates. Maximal degree in co-relation 25360. Up to 1706 conditions per place. [2025-02-06 09:22:39,516 INFO L140 encePairwiseOnDemand]: 264/303 looper letters, 755 selfloop transitions, 119 changer transitions 24/998 dead transitions. [2025-02-06 09:22:39,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 998 transitions, 8624 flow [2025-02-06 09:22:39,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-06 09:22:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-02-06 09:22:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 5169 transitions. [2025-02-06 09:22:39,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39673037071148975 [2025-02-06 09:22:39,527 INFO L175 Difference]: Start difference. First operand has 335 places, 596 transitions, 4036 flow. Second operand 43 states and 5169 transitions. [2025-02-06 09:22:39,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 998 transitions, 8624 flow [2025-02-06 09:22:39,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 998 transitions, 8402 flow, removed 111 selfloop flow, removed 0 redundant places. [2025-02-06 09:22:39,615 INFO L231 Difference]: Finished difference. Result has 383 places, 646 transitions, 4597 flow [2025-02-06 09:22:39,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3888, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=4597, PETRI_PLACES=383, PETRI_TRANSITIONS=646} [2025-02-06 09:22:39,617 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 77 predicate places. [2025-02-06 09:22:39,617 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 646 transitions, 4597 flow [2025-02-06 09:22:39,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 116.16923076923077) internal successors, (7551), 65 states have internal predecessors, (7551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:39,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:39,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:39,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:22:39,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 09:22:39,826 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:22:39,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1775841806, now seen corresponding path program 1 times [2025-02-06 09:22:39,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:39,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112450756] [2025-02-06 09:22:39,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:39,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:39,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-06 09:22:39,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-06 09:22:39,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:39,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:22:42,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112450756] [2025-02-06 09:22:42,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112450756] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863431476] [2025-02-06 09:22:42,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:42,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:42,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:42,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:22:42,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:22:42,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-06 09:22:42,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-06 09:22:42,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:42,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:42,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-06 09:22:42,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:42,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 09:22:42,430 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 09:22:42,430 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 17 treesize of output 21 [2025-02-06 09:22:42,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 09:22:42,665 INFO L349 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2025-02-06 09:22:42,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2025-02-06 09:22:42,925 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 40 treesize of output 31 [2025-02-06 09:22:43,016 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 40 treesize of output 31 [2025-02-06 09:22:43,116 INFO L349 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2025-02-06 09:22:43,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2025-02-06 09:22:43,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2025-02-06 09:22:43,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2025-02-06 09:22:43,430 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 29 treesize of output 22 [2025-02-06 09:22:43,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 09:22:43,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-06 09:22:43,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:43,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-02-06 09:22:43,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:43,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-02-06 09:22:43,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-02-06 09:22:43,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-02-06 09:22:43,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-02-06 09:22:43,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-02-06 09:22:43,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-02-06 09:22:43,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-02-06 09:22:43,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-02-06 09:22:43,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-02-06 09:22:43,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-02-06 09:22:44,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-02-06 09:22:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:22:44,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:44,135 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2793) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2798) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2793) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2798) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2793) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2798) c_~B~0.base) (+ 5 c_~B~0.offset)))) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2793) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2798) c_~B~0.base) (+ 6 c_~B~0.offset)) 0))) is different from false [2025-02-06 09:22:44,405 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-02-06 09:22:44,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 c_~B~0.offset)) (.cse4 (+ 6 c_~B~0.offset)) (.cse3 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse2 0) .cse4 0) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) .cse4) 0))))) is different from false [2025-02-06 09:22:44,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:44,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 62 [2025-02-06 09:22:44,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:44,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 206 treesize of output 170 [2025-02-06 09:22:44,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-02-06 09:22:44,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-02-06 09:22:44,453 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-02-06 09:22:44,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-02-06 09:22:44,459 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-02-06 09:22:44,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-02-06 09:22:44,466 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-02-06 09:22:44,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-02-06 09:22:45,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:22:45,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-02-06 09:22:45,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 131 [2025-02-06 09:22:45,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2025-02-06 09:22:45,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-02-06 09:22:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:22:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863431476] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:46,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:46,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 59 [2025-02-06 09:22:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892512861] [2025-02-06 09:22:46,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:46,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-02-06 09:22:46,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:46,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-02-06 09:22:46,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2827, Unknown=103, NotChecked=336, Total=3540 [2025-02-06 09:22:46,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 303 [2025-02-06 09:22:46,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 646 transitions, 4597 flow. Second operand has 60 states, 60 states have (on average 118.65) internal successors, (7119), 60 states have internal predecessors, (7119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:22:46,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:46,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 303 [2025-02-06 09:22:46,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand