./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b00ba58edbbf9092a3bbde4865c9e14ef534546a29b4ba514bb7ebaf27fc72c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:23:32,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:23:32,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:23:32,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:23:32,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:23:32,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:23:32,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:23:32,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:23:32,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:23:32,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:23:32,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:23:32,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:23:32,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:23:32,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:23:32,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:23:32,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:23:32,651 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b00ba58edbbf9092a3bbde4865c9e14ef534546a29b4ba514bb7ebaf27fc72c0 [2025-01-09 21:23:32,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:23:32,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:23:32,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:23:32,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:23:32,883 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:23:32,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i [2025-01-09 21:23:34,006 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/248bdb41c/c1ca5f4267ad4e5ca544aaf64fda243f/FLAG50e9792cc [2025-01-09 21:23:34,309 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:23:34,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i [2025-01-09 21:23:34,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/248bdb41c/c1ca5f4267ad4e5ca544aaf64fda243f/FLAG50e9792cc [2025-01-09 21:23:34,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/248bdb41c/c1ca5f4267ad4e5ca544aaf64fda243f [2025-01-09 21:23:34,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:23:34,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:23:34,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:23:34,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:23:34,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:23:34,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad69ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34, skipping insertion in model container [2025-01-09 21:23:34,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:23:34,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:23:34,802 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:23:34,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:23:34,891 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:23:34,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34 WrapperNode [2025-01-09 21:23:34,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:23:34,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:23:34,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:23:34,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:23:34,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,946 INFO L138 Inliner]: procedures = 368, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 207 [2025-01-09 21:23:34,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:23:34,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:23:34,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:23:34,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:23:34,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,974 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:23:34,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:23:34,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:23:34,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:23:34,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (1/1) ... [2025-01-09 21:23:34,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:23:35,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:35,015 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-01-09 21:23:35,019 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-01-09 21:23:35,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:23:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:23:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:23:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:23:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:23:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:23:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:23:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:23:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:23:35,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:23:35,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:23:35,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:23:35,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:23:35,034 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:23:35,158 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:23:35,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:23:35,569 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:23:35,569 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:23:35,587 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:23:35,591 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:23:35,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:23:35 BoogieIcfgContainer [2025-01-09 21:23:35,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:23:35,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:23:35,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:23:35,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:23:35,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:23:34" (1/3) ... [2025-01-09 21:23:35,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1031ec31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:23:35, skipping insertion in model container [2025-01-09 21:23:35,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:34" (2/3) ... [2025-01-09 21:23:35,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1031ec31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:23:35, skipping insertion in model container [2025-01-09 21:23:35,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:23:35" (3/3) ... [2025-01-09 21:23:35,598 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_05-ptra_rc.i [2025-01-09 21:23:35,608 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:23:35,610 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_05-ptra_rc.i that has 2 procedures, 241 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-01-09 21:23:35,611 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:23:35,687 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:23:35,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 240 transitions, 484 flow [2025-01-09 21:23:35,794 INFO L124 PetriNetUnfolderBase]: 0/239 cut-off events. [2025-01-09 21:23:35,795 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:35,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 239 events. 0/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-09 21:23:35,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 240 transitions, 484 flow [2025-01-09 21:23:35,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 239 transitions, 481 flow [2025-01-09 21:23:35,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:23:35,820 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;@7f29cedc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:23:35,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-09 21:23:35,827 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:23:35,827 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-01-09 21:23:35,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:35,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:35,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:35,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:35,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash 408968249, now seen corresponding path program 1 times [2025-01-09 21:23:35,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:35,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227858828] [2025-01-09 21:23:35,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:35,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:23:35,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:23:35,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:35,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:36,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:36,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227858828] [2025-01-09 21:23:36,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227858828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:36,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:36,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:36,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882474813] [2025-01-09 21:23:36,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:36,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:36,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:36,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:36,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:36,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 240 [2025-01-09 21:23:37,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 239 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:37,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:37,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 240 [2025-01-09 21:23:37,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:37,201 INFO L124 PetriNetUnfolderBase]: 220/1062 cut-off events. [2025-01-09 21:23:37,202 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:37,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1062 events. 220/1062 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5475 event pairs, 220 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1401. Up to 493 conditions per place. [2025-01-09 21:23:37,211 INFO L140 encePairwiseOnDemand]: 222/240 looper letters, 52 selfloop transitions, 15 changer transitions 0/236 dead transitions. [2025-01-09 21:23:37,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 236 transitions, 609 flow [2025-01-09 21:23:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2025-01-09 21:23:37,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2025-01-09 21:23:37,234 INFO L175 Difference]: Start difference. First operand has 243 places, 239 transitions, 481 flow. Second operand 6 states and 1090 transitions. [2025-01-09 21:23:37,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 236 transitions, 609 flow [2025-01-09 21:23:37,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 236 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:37,246 INFO L231 Difference]: Finished difference. Result has 244 places, 236 transitions, 504 flow [2025-01-09 21:23:37,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=244, PETRI_TRANSITIONS=236} [2025-01-09 21:23:37,252 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 1 predicate places. [2025-01-09 21:23:37,252 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 236 transitions, 504 flow [2025-01-09 21:23:37,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:37,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:37,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:37,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:23:37,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:37,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:37,255 INFO L85 PathProgramCache]: Analyzing trace with hash 535129878, now seen corresponding path program 1 times [2025-01-09 21:23:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:37,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659953162] [2025-01-09 21:23:37,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:37,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:37,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:23:37,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:23:37,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:37,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:37,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:37,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659953162] [2025-01-09 21:23:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659953162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:37,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:37,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139118101] [2025-01-09 21:23:37,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:37,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:37,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:37,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:37,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 240 [2025-01-09 21:23:37,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 236 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:37,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:37,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 240 [2025-01-09 21:23:37,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:38,078 INFO L124 PetriNetUnfolderBase]: 220/1059 cut-off events. [2025-01-09 21:23:38,078 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:38,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 1059 events. 220/1059 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5458 event pairs, 220 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1426. Up to 493 conditions per place. [2025-01-09 21:23:38,086 INFO L140 encePairwiseOnDemand]: 222/240 looper letters, 52 selfloop transitions, 15 changer transitions 0/233 dead transitions. [2025-01-09 21:23:38,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 233 transitions, 632 flow [2025-01-09 21:23:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2025-01-09 21:23:38,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2025-01-09 21:23:38,089 INFO L175 Difference]: Start difference. First operand has 244 places, 236 transitions, 504 flow. Second operand 6 states and 1090 transitions. [2025-01-09 21:23:38,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 233 transitions, 632 flow [2025-01-09 21:23:38,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 233 transitions, 602 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:38,099 INFO L231 Difference]: Finished difference. Result has 241 places, 233 transitions, 498 flow [2025-01-09 21:23:38,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=241, PETRI_TRANSITIONS=233} [2025-01-09 21:23:38,099 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -2 predicate places. [2025-01-09 21:23:38,100 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 233 transitions, 498 flow [2025-01-09 21:23:38,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:38,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:38,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:38,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:23:38,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:38,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash 106327977, now seen corresponding path program 1 times [2025-01-09 21:23:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:38,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133189420] [2025-01-09 21:23:38,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:38,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:38,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:23:38,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:23:38,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:38,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:38,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133189420] [2025-01-09 21:23:38,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133189420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:38,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:38,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:38,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866511874] [2025-01-09 21:23:38,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:38,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:38,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:38,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:38,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:38,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 240 [2025-01-09 21:23:38,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 233 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:38,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:38,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 240 [2025-01-09 21:23:38,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:38,199 INFO L124 PetriNetUnfolderBase]: 16/368 cut-off events. [2025-01-09 21:23:38,199 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:38,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 368 events. 16/368 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 773 event pairs, 16 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 288. Up to 47 conditions per place. [2025-01-09 21:23:38,200 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 14 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2025-01-09 21:23:38,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 232 transitions, 528 flow [2025-01-09 21:23:38,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-01-09 21:23:38,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527777777777777 [2025-01-09 21:23:38,202 INFO L175 Difference]: Start difference. First operand has 241 places, 233 transitions, 498 flow. Second operand 3 states and 686 transitions. [2025-01-09 21:23:38,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 232 transitions, 528 flow [2025-01-09 21:23:38,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 232 transitions, 498 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:38,205 INFO L231 Difference]: Finished difference. Result has 237 places, 232 transitions, 470 flow [2025-01-09 21:23:38,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=237, PETRI_TRANSITIONS=232} [2025-01-09 21:23:38,206 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -6 predicate places. [2025-01-09 21:23:38,206 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 232 transitions, 470 flow [2025-01-09 21:23:38,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:38,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:38,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:38,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:23:38,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:38,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash 296367235, now seen corresponding path program 1 times [2025-01-09 21:23:38,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:38,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020741142] [2025-01-09 21:23:38,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:38,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:23:38,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:23:38,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:38,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:38,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020741142] [2025-01-09 21:23:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020741142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:38,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:38,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452310845] [2025-01-09 21:23:38,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:38,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:38,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:38,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:38,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:38,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 240 [2025-01-09 21:23:38,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 232 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:38,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:38,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 240 [2025-01-09 21:23:38,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:38,288 INFO L124 PetriNetUnfolderBase]: 24/445 cut-off events. [2025-01-09 21:23:38,288 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:38,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 445 events. 24/445 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1219 event pairs, 24 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 455. Up to 63 conditions per place. [2025-01-09 21:23:38,289 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 15 selfloop transitions, 1 changer transitions 0/227 dead transitions. [2025-01-09 21:23:38,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 227 transitions, 492 flow [2025-01-09 21:23:38,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 678 transitions. [2025-01-09 21:23:38,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2025-01-09 21:23:38,291 INFO L175 Difference]: Start difference. First operand has 237 places, 232 transitions, 470 flow. Second operand 3 states and 678 transitions. [2025-01-09 21:23:38,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 227 transitions, 492 flow [2025-01-09 21:23:38,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 227 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:23:38,293 INFO L231 Difference]: Finished difference. Result has 232 places, 227 transitions, 458 flow [2025-01-09 21:23:38,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=232, PETRI_TRANSITIONS=227} [2025-01-09 21:23:38,294 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -11 predicate places. [2025-01-09 21:23:38,294 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 227 transitions, 458 flow [2025-01-09 21:23:38,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:38,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:38,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:38,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:23:38,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:38,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:38,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1505942631, now seen corresponding path program 1 times [2025-01-09 21:23:38,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:38,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757311049] [2025-01-09 21:23:38,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:38,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:38,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:23:38,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:23:38,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:38,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:38,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:38,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757311049] [2025-01-09 21:23:38,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757311049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:38,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:38,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:38,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463626150] [2025-01-09 21:23:38,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:38,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:38,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:38,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:38,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:38,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 240 [2025-01-09 21:23:38,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 227 transitions, 458 flow. Second operand has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:38,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:38,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 240 [2025-01-09 21:23:38,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:38,981 INFO L124 PetriNetUnfolderBase]: 288/1198 cut-off events. [2025-01-09 21:23:38,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:38,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1198 events. 288/1198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6404 event pairs, 288 based on Foata normal form. 0/1137 useless extension candidates. Maximal degree in co-relation 1780. Up to 643 conditions per place. [2025-01-09 21:23:38,986 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 66 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2025-01-09 21:23:38,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 226 transitions, 598 flow [2025-01-09 21:23:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1080 transitions. [2025-01-09 21:23:38,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-09 21:23:38,991 INFO L175 Difference]: Start difference. First operand has 232 places, 227 transitions, 458 flow. Second operand 6 states and 1080 transitions. [2025-01-09 21:23:38,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 226 transitions, 598 flow [2025-01-09 21:23:38,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 226 transitions, 597 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:38,995 INFO L231 Difference]: Finished difference. Result has 235 places, 226 transitions, 465 flow [2025-01-09 21:23:38,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=235, PETRI_TRANSITIONS=226} [2025-01-09 21:23:38,998 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -8 predicate places. [2025-01-09 21:23:38,998 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 226 transitions, 465 flow [2025-01-09 21:23:39,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:39,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:39,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:39,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:23:39,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:39,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1196565690, now seen corresponding path program 1 times [2025-01-09 21:23:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:39,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391509055] [2025-01-09 21:23:39,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:39,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:23:39,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:23:39,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:39,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:39,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:39,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391509055] [2025-01-09 21:23:39,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391509055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:39,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:39,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:39,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541867983] [2025-01-09 21:23:39,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:39,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:39,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:39,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:39,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:39,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 240 [2025-01-09 21:23:39,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 226 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:39,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:39,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 240 [2025-01-09 21:23:39,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:39,128 INFO L124 PetriNetUnfolderBase]: 6/289 cut-off events. [2025-01-09 21:23:39,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:39,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 289 events. 6/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 397 event pairs, 6 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 263. Up to 23 conditions per place. [2025-01-09 21:23:39,129 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 10 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-01-09 21:23:39,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 225 transitions, 487 flow [2025-01-09 21:23:39,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-01-09 21:23:39,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9638888888888889 [2025-01-09 21:23:39,131 INFO L175 Difference]: Start difference. First operand has 235 places, 226 transitions, 465 flow. Second operand 3 states and 694 transitions. [2025-01-09 21:23:39,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 225 transitions, 487 flow [2025-01-09 21:23:39,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 225 transitions, 477 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:39,133 INFO L231 Difference]: Finished difference. Result has 231 places, 225 transitions, 457 flow [2025-01-09 21:23:39,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=231, PETRI_TRANSITIONS=225} [2025-01-09 21:23:39,135 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -12 predicate places. [2025-01-09 21:23:39,135 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 225 transitions, 457 flow [2025-01-09 21:23:39,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:39,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:39,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:39,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:23:39,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:39,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1416804218, now seen corresponding path program 1 times [2025-01-09 21:23:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:39,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727449157] [2025-01-09 21:23:39,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:39,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:39,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:23:39,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:23:39,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:39,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:39,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:39,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727449157] [2025-01-09 21:23:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727449157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:39,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:39,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:39,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101591897] [2025-01-09 21:23:39,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:39,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:39,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:39,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:39,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:39,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 240 [2025-01-09 21:23:39,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 225 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:39,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:39,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 240 [2025-01-09 21:23:39,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:39,230 INFO L124 PetriNetUnfolderBase]: 4/286 cut-off events. [2025-01-09 21:23:39,230 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:39,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 286 events. 4/286 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 261 event pairs, 4 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 250. Up to 15 conditions per place. [2025-01-09 21:23:39,231 INFO L140 encePairwiseOnDemand]: 238/240 looper letters, 7 selfloop transitions, 1 changer transitions 0/224 dead transitions. [2025-01-09 21:23:39,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 224 transitions, 471 flow [2025-01-09 21:23:39,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2025-01-09 21:23:39,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.975 [2025-01-09 21:23:39,233 INFO L175 Difference]: Start difference. First operand has 231 places, 225 transitions, 457 flow. Second operand 3 states and 702 transitions. [2025-01-09 21:23:39,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 224 transitions, 471 flow [2025-01-09 21:23:39,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 224 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:23:39,235 INFO L231 Difference]: Finished difference. Result has 230 places, 224 transitions, 453 flow [2025-01-09 21:23:39,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=230, PETRI_TRANSITIONS=224} [2025-01-09 21:23:39,236 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -13 predicate places. [2025-01-09 21:23:39,236 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 224 transitions, 453 flow [2025-01-09 21:23:39,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:39,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:39,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:39,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:23:39,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:39,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1164812758, now seen corresponding path program 1 times [2025-01-09 21:23:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:39,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383564706] [2025-01-09 21:23:39,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:39,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:23:39,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:23:39,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:39,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:39,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:39,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383564706] [2025-01-09 21:23:39,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383564706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:39,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:39,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:39,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951260048] [2025-01-09 21:23:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:39,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:39,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:39,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:39,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:39,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 240 [2025-01-09 21:23:39,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 224 transitions, 453 flow. Second operand has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:39,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:39,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 240 [2025-01-09 21:23:39,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:40,244 INFO L124 PetriNetUnfolderBase]: 316/1522 cut-off events. [2025-01-09 21:23:40,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:40,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 1522 events. 316/1522 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9251 event pairs, 36 based on Foata normal form. 0/1432 useless extension candidates. Maximal degree in co-relation 2192. Up to 388 conditions per place. [2025-01-09 21:23:40,250 INFO L140 encePairwiseOnDemand]: 212/240 looper letters, 107 selfloop transitions, 70 changer transitions 0/336 dead transitions. [2025-01-09 21:23:40,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 336 transitions, 1031 flow [2025-01-09 21:23:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1229 transitions. [2025-01-09 21:23:40,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8534722222222222 [2025-01-09 21:23:40,253 INFO L175 Difference]: Start difference. First operand has 230 places, 224 transitions, 453 flow. Second operand 6 states and 1229 transitions. [2025-01-09 21:23:40,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 336 transitions, 1031 flow [2025-01-09 21:23:40,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 336 transitions, 1030 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:40,258 INFO L231 Difference]: Finished difference. Result has 238 places, 294 transitions, 930 flow [2025-01-09 21:23:40,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=930, PETRI_PLACES=238, PETRI_TRANSITIONS=294} [2025-01-09 21:23:40,259 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -5 predicate places. [2025-01-09 21:23:40,259 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 294 transitions, 930 flow [2025-01-09 21:23:40,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:40,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:40,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:40,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:23:40,261 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:40,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:40,261 INFO L85 PathProgramCache]: Analyzing trace with hash -420518204, now seen corresponding path program 1 times [2025-01-09 21:23:40,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:40,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851960103] [2025-01-09 21:23:40,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:40,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:40,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 21:23:40,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 21:23:40,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:40,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:40,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:40,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851960103] [2025-01-09 21:23:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851960103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:40,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:40,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:40,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714146841] [2025-01-09 21:23:40,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:40,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:40,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:40,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:40,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 240 [2025-01-09 21:23:40,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 294 transitions, 930 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:40,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:40,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 240 [2025-01-09 21:23:40,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:41,113 INFO L124 PetriNetUnfolderBase]: 588/2293 cut-off events. [2025-01-09 21:23:41,113 INFO L125 PetriNetUnfolderBase]: For 602/608 co-relation queries the response was YES. [2025-01-09 21:23:41,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4691 conditions, 2293 events. 588/2293 cut-off events. For 602/608 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 15197 event pairs, 222 based on Foata normal form. 0/2182 useless extension candidates. Maximal degree in co-relation 4619. Up to 1090 conditions per place. [2025-01-09 21:23:41,123 INFO L140 encePairwiseOnDemand]: 225/240 looper letters, 114 selfloop transitions, 48 changer transitions 0/345 dead transitions. [2025-01-09 21:23:41,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 345 transitions, 1426 flow [2025-01-09 21:23:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2025-01-09 21:23:41,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-01-09 21:23:41,126 INFO L175 Difference]: Start difference. First operand has 238 places, 294 transitions, 930 flow. Second operand 6 states and 1166 transitions. [2025-01-09 21:23:41,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 345 transitions, 1426 flow [2025-01-09 21:23:41,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 345 transitions, 1426 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:41,133 INFO L231 Difference]: Finished difference. Result has 248 places, 337 transitions, 1318 flow [2025-01-09 21:23:41,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1318, PETRI_PLACES=248, PETRI_TRANSITIONS=337} [2025-01-09 21:23:41,133 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 5 predicate places. [2025-01-09 21:23:41,134 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 337 transitions, 1318 flow [2025-01-09 21:23:41,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:41,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:41,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:41,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:23:41,135 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:41,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:41,135 INFO L85 PathProgramCache]: Analyzing trace with hash 678966440, now seen corresponding path program 1 times [2025-01-09 21:23:41,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:41,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124106526] [2025-01-09 21:23:41,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:41,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 21:23:41,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 21:23:41,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:41,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:41,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:41,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124106526] [2025-01-09 21:23:41,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124106526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:41,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:41,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:41,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898208152] [2025-01-09 21:23:41,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:41,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:41,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:41,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:41,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:41,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 240 [2025-01-09 21:23:41,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 337 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:41,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:41,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 240 [2025-01-09 21:23:41,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:42,237 INFO L124 PetriNetUnfolderBase]: 754/2823 cut-off events. [2025-01-09 21:23:42,237 INFO L125 PetriNetUnfolderBase]: For 1640/1696 co-relation queries the response was YES. [2025-01-09 21:23:42,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2823 events. 754/2823 cut-off events. For 1640/1696 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19722 event pairs, 86 based on Foata normal form. 0/2729 useless extension candidates. Maximal degree in co-relation 6511. Up to 1017 conditions per place. [2025-01-09 21:23:42,252 INFO L140 encePairwiseOnDemand]: 217/240 looper letters, 136 selfloop transitions, 136 changer transitions 4/477 dead transitions. [2025-01-09 21:23:42,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 477 transitions, 2626 flow [2025-01-09 21:23:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1224 transitions. [2025-01-09 21:23:42,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-01-09 21:23:42,254 INFO L175 Difference]: Start difference. First operand has 248 places, 337 transitions, 1318 flow. Second operand 6 states and 1224 transitions. [2025-01-09 21:23:42,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 477 transitions, 2626 flow [2025-01-09 21:23:42,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 477 transitions, 2608 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:42,266 INFO L231 Difference]: Finished difference. Result has 258 places, 468 transitions, 2666 flow [2025-01-09 21:23:42,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2666, PETRI_PLACES=258, PETRI_TRANSITIONS=468} [2025-01-09 21:23:42,266 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 15 predicate places. [2025-01-09 21:23:42,267 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 468 transitions, 2666 flow [2025-01-09 21:23:42,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:42,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:42,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:42,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:23:42,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:42,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:42,268 INFO L85 PathProgramCache]: Analyzing trace with hash -365900599, now seen corresponding path program 1 times [2025-01-09 21:23:42,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:42,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671535686] [2025-01-09 21:23:42,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:42,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 21:23:42,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 21:23:42,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:42,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:42,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:42,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671535686] [2025-01-09 21:23:42,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671535686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:42,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:42,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:42,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227757549] [2025-01-09 21:23:42,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:42,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:42,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:42,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:42,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:42,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 240 [2025-01-09 21:23:42,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 468 transitions, 2666 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:42,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:42,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 240 [2025-01-09 21:23:42,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:43,244 INFO L124 PetriNetUnfolderBase]: 968/3386 cut-off events. [2025-01-09 21:23:43,244 INFO L125 PetriNetUnfolderBase]: For 3817/3888 co-relation queries the response was YES. [2025-01-09 21:23:43,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9627 conditions, 3386 events. 968/3386 cut-off events. For 3817/3888 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 24388 event pairs, 207 based on Foata normal form. 0/3298 useless extension candidates. Maximal degree in co-relation 9545. Up to 1565 conditions per place. [2025-01-09 21:23:43,264 INFO L140 encePairwiseOnDemand]: 225/240 looper letters, 239 selfloop transitions, 62 changer transitions 0/525 dead transitions. [2025-01-09 21:23:43,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 525 transitions, 3610 flow [2025-01-09 21:23:43,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2025-01-09 21:23:43,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-01-09 21:23:43,267 INFO L175 Difference]: Start difference. First operand has 258 places, 468 transitions, 2666 flow. Second operand 6 states and 1166 transitions. [2025-01-09 21:23:43,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 525 transitions, 3610 flow [2025-01-09 21:23:43,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 525 transitions, 3574 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:43,289 INFO L231 Difference]: Finished difference. Result has 268 places, 517 transitions, 3256 flow [2025-01-09 21:23:43,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3256, PETRI_PLACES=268, PETRI_TRANSITIONS=517} [2025-01-09 21:23:43,290 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 25 predicate places. [2025-01-09 21:23:43,290 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 517 transitions, 3256 flow [2025-01-09 21:23:43,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:43,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:43,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:43,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:23:43,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:43,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 33238092, now seen corresponding path program 1 times [2025-01-09 21:23:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:43,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452274399] [2025-01-09 21:23:43,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:43,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 21:23:43,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:23:43,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:43,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:43,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:43,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452274399] [2025-01-09 21:23:43,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452274399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:43,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:43,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:43,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651270428] [2025-01-09 21:23:43,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:43,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:43,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:43,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:43,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:45,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2025-01-09 21:23:45,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 517 transitions, 3256 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:45,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:45,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2025-01-09 21:23:45,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:46,384 INFO L124 PetriNetUnfolderBase]: 1524/5131 cut-off events. [2025-01-09 21:23:46,384 INFO L125 PetriNetUnfolderBase]: For 8793/8894 co-relation queries the response was YES. [2025-01-09 21:23:46,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16430 conditions, 5131 events. 1524/5131 cut-off events. For 8793/8894 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 41536 event pairs, 111 based on Foata normal form. 47/5076 useless extension candidates. Maximal degree in co-relation 16338. Up to 1002 conditions per place. [2025-01-09 21:23:46,414 INFO L140 encePairwiseOnDemand]: 211/240 looper letters, 478 selfloop transitions, 172 changer transitions 0/843 dead transitions. [2025-01-09 21:23:46,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 843 transitions, 7206 flow [2025-01-09 21:23:46,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:23:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:23:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3314 transitions. [2025-01-09 21:23:46,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7267543859649123 [2025-01-09 21:23:46,419 INFO L175 Difference]: Start difference. First operand has 268 places, 517 transitions, 3256 flow. Second operand 19 states and 3314 transitions. [2025-01-09 21:23:46,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 843 transitions, 7206 flow [2025-01-09 21:23:46,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 843 transitions, 7024 flow, removed 91 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:46,461 INFO L231 Difference]: Finished difference. Result has 295 places, 640 transitions, 4992 flow [2025-01-09 21:23:46,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=3144, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4992, PETRI_PLACES=295, PETRI_TRANSITIONS=640} [2025-01-09 21:23:46,461 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 52 predicate places. [2025-01-09 21:23:46,462 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 640 transitions, 4992 flow [2025-01-09 21:23:46,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:46,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:46,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:46,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:23:46,463 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:46,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:46,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1740036200, now seen corresponding path program 2 times [2025-01-09 21:23:46,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:46,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172761559] [2025-01-09 21:23:46,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:46,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:46,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 1 equivalence classes. [2025-01-09 21:23:46,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:23:46,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:46,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:47,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172761559] [2025-01-09 21:23:47,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172761559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:47,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:47,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801796974] [2025-01-09 21:23:47,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:47,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:47,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:47,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:47,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:47,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2025-01-09 21:23:47,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 640 transitions, 4992 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:47,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:47,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2025-01-09 21:23:47,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:49,267 INFO L124 PetriNetUnfolderBase]: 2138/7193 cut-off events. [2025-01-09 21:23:49,268 INFO L125 PetriNetUnfolderBase]: For 17382/17602 co-relation queries the response was YES. [2025-01-09 21:23:49,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24652 conditions, 7193 events. 2138/7193 cut-off events. For 17382/17602 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 65467 event pairs, 198 based on Foata normal form. 57/7126 useless extension candidates. Maximal degree in co-relation 24547. Up to 2162 conditions per place. [2025-01-09 21:23:49,326 INFO L140 encePairwiseOnDemand]: 207/240 looper letters, 458 selfloop transitions, 189 changer transitions 1/841 dead transitions. [2025-01-09 21:23:49,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 841 transitions, 8174 flow [2025-01-09 21:23:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:23:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:23:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2614 transitions. [2025-01-09 21:23:49,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7261111111111112 [2025-01-09 21:23:49,330 INFO L175 Difference]: Start difference. First operand has 295 places, 640 transitions, 4992 flow. Second operand 15 states and 2614 transitions. [2025-01-09 21:23:49,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 841 transitions, 8174 flow [2025-01-09 21:23:49,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 841 transitions, 8119 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:49,393 INFO L231 Difference]: Finished difference. Result has 314 places, 736 transitions, 7002 flow [2025-01-09 21:23:49,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=4951, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7002, PETRI_PLACES=314, PETRI_TRANSITIONS=736} [2025-01-09 21:23:49,394 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 71 predicate places. [2025-01-09 21:23:49,394 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 736 transitions, 7002 flow [2025-01-09 21:23:49,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:49,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:49,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:49,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:23:49,395 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:49,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2011476306, now seen corresponding path program 3 times [2025-01-09 21:23:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:49,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921908496] [2025-01-09 21:23:49,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:49,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:49,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 1 equivalence classes. [2025-01-09 21:23:49,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:23:49,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:49,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921908496] [2025-01-09 21:23:49,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921908496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:49,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:49,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058149988] [2025-01-09 21:23:49,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:49,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:49,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:49,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:51,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2025-01-09 21:23:51,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 736 transitions, 7002 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:51,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:51,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2025-01-09 21:23:51,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:53,559 INFO L124 PetriNetUnfolderBase]: 3213/10760 cut-off events. [2025-01-09 21:23:53,560 INFO L125 PetriNetUnfolderBase]: For 35505/35856 co-relation queries the response was YES. [2025-01-09 21:23:53,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38860 conditions, 10760 events. 3213/10760 cut-off events. For 35505/35856 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 108684 event pairs, 300 based on Foata normal form. 116/10688 useless extension candidates. Maximal degree in co-relation 38744. Up to 2268 conditions per place. [2025-01-09 21:23:53,644 INFO L140 encePairwiseOnDemand]: 205/240 looper letters, 525 selfloop transitions, 374 changer transitions 2/1094 dead transitions. [2025-01-09 21:23:53,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1094 transitions, 12605 flow [2025-01-09 21:23:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:23:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:23:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3353 transitions. [2025-01-09 21:23:53,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7353070175438596 [2025-01-09 21:23:53,651 INFO L175 Difference]: Start difference. First operand has 314 places, 736 transitions, 7002 flow. Second operand 19 states and 3353 transitions. [2025-01-09 21:23:53,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1094 transitions, 12605 flow [2025-01-09 21:23:53,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 1094 transitions, 12570 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-01-09 21:23:53,910 INFO L231 Difference]: Finished difference. Result has 344 places, 884 transitions, 10755 flow [2025-01-09 21:23:53,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=6971, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10755, PETRI_PLACES=344, PETRI_TRANSITIONS=884} [2025-01-09 21:23:53,911 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 101 predicate places. [2025-01-09 21:23:53,911 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 884 transitions, 10755 flow [2025-01-09 21:23:53,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:53,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:53,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:53,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:23:53,912 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:53,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:53,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1782067446, now seen corresponding path program 4 times [2025-01-09 21:23:53,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:53,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677908511] [2025-01-09 21:23:53,918 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:53,946 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 151 statements into 2 equivalence classes. [2025-01-09 21:23:53,972 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 145 of 151 statements. [2025-01-09 21:23:53,973 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:23:53,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:54,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:54,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677908511] [2025-01-09 21:23:54,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677908511] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:54,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528358560] [2025-01-09 21:23:54,399 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:54,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:54,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:54,401 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-01-09 21:23:54,402 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-01-09 21:23:54,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 151 statements into 2 equivalence classes. [2025-01-09 21:23:54,572 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 145 of 151 statements. [2025-01-09 21:23:54,573 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:23:54,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:54,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 21:23:54,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:54,623 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-01-09 21:23:54,706 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 21:23:54,706 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-01-09 21:23:54,792 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:23:54,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 21:23:54,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 21:23:54,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-01-09 21:23:54,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:54,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-01-09 21:23:54,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:54,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-01-09 21:23:54,904 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-01-09 21:23:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:54,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:54,937 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 5)))) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 6)) 0))) is different from false [2025-01-09 21:23:54,996 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-01-09 21:23:55,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 6)) (.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1455 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1455) c_~A~0.base) .cse2) 0))))) is different from false [2025-01-09 21:23:56,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-01-09 21:23:56,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2025-01-09 21:23:56,948 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-01-09 21:23:56,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-01-09 21:23:56,954 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-01-09 21:23:56,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-01-09 21:23:56,959 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-01-09 21:23:56,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-01-09 21:23:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528358560] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:23:57,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:23:57,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2025-01-09 21:23:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985576037] [2025-01-09 21:23:57,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:23:57,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 21:23:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:57,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 21:23:57,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=184, Unknown=16, NotChecked=90, Total=342 [2025-01-09 21:23:57,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 240 [2025-01-09 21:23:57,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 884 transitions, 10755 flow. Second operand has 19 states, 19 states have (on average 129.42105263157896) internal successors, (2459), 19 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:57,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:57,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 240 [2025-01-09 21:23:57,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:01,516 INFO L124 PetriNetUnfolderBase]: 5368/15005 cut-off events. [2025-01-09 21:24:01,517 INFO L125 PetriNetUnfolderBase]: For 65645/66107 co-relation queries the response was YES. [2025-01-09 21:24:01,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60271 conditions, 15005 events. 5368/15005 cut-off events. For 65645/66107 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 146641 event pairs, 1058 based on Foata normal form. 42/14767 useless extension candidates. Maximal degree in co-relation 60133. Up to 5220 conditions per place. [2025-01-09 21:24:01,623 INFO L140 encePairwiseOnDemand]: 219/240 looper letters, 834 selfloop transitions, 215 changer transitions 0/1166 dead transitions. [2025-01-09 21:24:01,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1166 transitions, 15293 flow [2025-01-09 21:24:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:24:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:24:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2648 transitions. [2025-01-09 21:24:01,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5807017543859649 [2025-01-09 21:24:01,626 INFO L175 Difference]: Start difference. First operand has 344 places, 884 transitions, 10755 flow. Second operand 19 states and 2648 transitions. [2025-01-09 21:24:01,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 1166 transitions, 15293 flow [2025-01-09 21:24:01,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1166 transitions, 15202 flow, removed 43 selfloop flow, removed 3 redundant places. [2025-01-09 21:24:01,907 INFO L231 Difference]: Finished difference. Result has 368 places, 945 transitions, 12283 flow [2025-01-09 21:24:01,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=10664, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=12283, PETRI_PLACES=368, PETRI_TRANSITIONS=945} [2025-01-09 21:24:01,908 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 125 predicate places. [2025-01-09 21:24:01,908 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 945 transitions, 12283 flow [2025-01-09 21:24:01,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 129.42105263157896) internal successors, (2459), 19 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:24:01,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:01,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:01,916 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-01-09 21:24:02,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 21:24:02,113 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:24:02,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1355508717, now seen corresponding path program 1 times [2025-01-09 21:24:02,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:02,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115613713] [2025-01-09 21:24:02,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:02,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:02,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 21:24:02,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:24:02,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:02,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:02,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115613713] [2025-01-09 21:24:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115613713] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944681140] [2025-01-09 21:24:02,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:02,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:02,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:02,873 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-01-09 21:24:02,875 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-01-09 21:24:02,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 21:24:03,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:24:03,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:03,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:03,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 21:24:03,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:03,059 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-01-09 21:24:03,128 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 21:24:03,128 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-01-09 21:24:03,198 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:24:03,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 21:24:03,254 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-01-09 21:24:03,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 21:24:03,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:24:03,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-01-09 21:24:03,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:24:03,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-01-09 21:24:03,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-01-09 21:24:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:03,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:03,407 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|)))) is different from false [2025-01-09 21:24:03,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|))))) is different from false [2025-01-09 21:24:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944681140] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:07,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:07,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-01-09 21:24:07,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260463638] [2025-01-09 21:24:07,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:07,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 21:24:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:07,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 21:24:07,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=556, Unknown=19, NotChecked=98, Total=756 [2025-01-09 21:24:07,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 240 [2025-01-09 21:24:07,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 945 transitions, 12283 flow. Second operand has 28 states, 28 states have (on average 127.35714285714286) internal successors, (3566), 28 states have internal predecessors, (3566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:24:07,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:07,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 240 [2025-01-09 21:24:07,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:11,766 INFO L124 PetriNetUnfolderBase]: 5546/15179 cut-off events. [2025-01-09 21:24:11,766 INFO L125 PetriNetUnfolderBase]: For 82508/82866 co-relation queries the response was YES. [2025-01-09 21:24:11,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64016 conditions, 15179 events. 5546/15179 cut-off events. For 82508/82866 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 147773 event pairs, 1243 based on Foata normal form. 115/15026 useless extension candidates. Maximal degree in co-relation 63868. Up to 5456 conditions per place. [2025-01-09 21:24:11,889 INFO L140 encePairwiseOnDemand]: 218/240 looper letters, 853 selfloop transitions, 195 changer transitions 0/1162 dead transitions. [2025-01-09 21:24:11,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1162 transitions, 17111 flow [2025-01-09 21:24:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:24:11,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:24:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2084 transitions. [2025-01-09 21:24:11,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5788888888888889 [2025-01-09 21:24:11,891 INFO L175 Difference]: Start difference. First operand has 368 places, 945 transitions, 12283 flow. Second operand 15 states and 2084 transitions. [2025-01-09 21:24:11,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1162 transitions, 17111 flow [2025-01-09 21:24:12,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 1162 transitions, 16820 flow, removed 124 selfloop flow, removed 9 redundant places. [2025-01-09 21:24:12,230 INFO L231 Difference]: Finished difference. Result has 378 places, 963 transitions, 13063 flow [2025-01-09 21:24:12,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=12108, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13063, PETRI_PLACES=378, PETRI_TRANSITIONS=963} [2025-01-09 21:24:12,231 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 135 predicate places. [2025-01-09 21:24:12,231 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 963 transitions, 13063 flow [2025-01-09 21:24:12,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 127.35714285714286) internal successors, (3566), 28 states have internal predecessors, (3566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:24:12,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:12,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:12,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:24:12,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 21:24:12,436 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:24:12,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:12,437 INFO L85 PathProgramCache]: Analyzing trace with hash -775458266, now seen corresponding path program 5 times [2025-01-09 21:24:12,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:12,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478311815] [2025-01-09 21:24:12,437 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:24:12,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:12,458 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-01-09 21:24:12,481 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:24:12,482 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:24:12,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:13,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:13,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478311815] [2025-01-09 21:24:13,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478311815] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:13,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716654563] [2025-01-09 21:24:13,357 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:24:13,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:13,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:13,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:24:13,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:24:13,492 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-01-09 21:24:13,634 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:24:13,635 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:24:13,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:13,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 21:24:13,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:13,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:24:13,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 21:24:13,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:24:13,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-01-09 21:24:13,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:24:13,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-01-09 21:24:14,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:24:14,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:24:14,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:24:14,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:24:14,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:24:14,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2025-01-09 21:24:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:14,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:24,319 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:24:24,321 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:24:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:24,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716654563] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:24,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:24,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 34 [2025-01-09 21:24:24,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937654617] [2025-01-09 21:24:24,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:24,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 21:24:24,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:24,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 21:24:24,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1039, Unknown=2, NotChecked=0, Total=1190 [2025-01-09 21:24:29,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:34,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:38,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:42,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:47,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:52,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:57,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:25:02,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]