./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.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/28-race_reach_93-evilcollapse_racefree.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 dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:18,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:18,459 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:29:18,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:18,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:18,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:18,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:18,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:18,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:18,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:18,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:18,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:18,492 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:18,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:18,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:18,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:18,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:18,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:18,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:18,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:18,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:18,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:18,493 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:18,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:18,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:18,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:18,494 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:18,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:18,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:18,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:18,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:18,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:18,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:18,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:18,495 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 -> dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 [2025-01-09 21:29:18,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:18,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:18,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:18,723 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:18,723 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:18,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2025-01-09 21:29:19,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/638f2da1d/6d6b3206bbc548ec87659a74690ed253/FLAGdff7a1648 [2025-01-09 21:29:20,107 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:20,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2025-01-09 21:29:20,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/638f2da1d/6d6b3206bbc548ec87659a74690ed253/FLAGdff7a1648 [2025-01-09 21:29:20,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/638f2da1d/6d6b3206bbc548ec87659a74690ed253 [2025-01-09 21:29:20,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:20,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:20,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:20,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:20,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:20,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:20,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f220eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20, skipping insertion in model container [2025-01-09 21:29:20,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:20,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:20,805 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:20,807 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:20,808 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:20,810 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:20,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:20,860 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:20,887 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:20,888 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:20,888 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:20,888 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:20,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:20,947 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:20,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20 WrapperNode [2025-01-09 21:29:20,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:20,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:20,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:20,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:20,954 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:29:20" (1/1) ... [2025-01-09 21:29:20,981 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:29:20" (1/1) ... [2025-01-09 21:29:21,013 INFO L138 Inliner]: procedures = 281, calls = 126, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 412 [2025-01-09 21:29:21,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:21,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:21,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:21,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:21,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:21,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:21,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:21,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:21,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:21,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:21,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:21,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:21,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:21,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:21,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:21,068 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:21,068 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:21,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20" (1/1) ... [2025-01-09 21:29:21,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:21,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:21,102 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:29:21,105 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:29:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:29:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:29:21,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:29:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:29:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:29:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:29:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:29:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:29:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:29:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:21,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:29:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:29:21,125 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:29:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:21,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:21,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:21,127 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:29:21,253 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:21,254 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:21,830 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:21,830 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:21,855 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:21,859 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 21:29:21,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:21 BoogieIcfgContainer [2025-01-09 21:29:21,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:21,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:21,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:21,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:21,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:20" (1/3) ... [2025-01-09 21:29:21,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dfb2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:21, skipping insertion in model container [2025-01-09 21:29:21,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:20" (2/3) ... [2025-01-09 21:29:21,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dfb2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:21, skipping insertion in model container [2025-01-09 21:29:21,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:21" (3/3) ... [2025-01-09 21:29:21,867 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_93-evilcollapse_racefree.i [2025-01-09 21:29:21,877 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:21,879 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_93-evilcollapse_racefree.i that has 2 procedures, 451 locations, 1 initial locations, 11 loop locations, and 21 error locations. [2025-01-09 21:29:21,879 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:21,976 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:29:22,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 454 places, 473 transitions, 953 flow [2025-01-09 21:29:22,166 INFO L124 PetriNetUnfolderBase]: 22/503 cut-off events. [2025-01-09 21:29:22,169 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:29:22,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 503 events. 22/503 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1150 event pairs, 0 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 322. Up to 4 conditions per place. [2025-01-09 21:29:22,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 454 places, 473 transitions, 953 flow [2025-01-09 21:29:22,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 454 places, 473 transitions, 953 flow [2025-01-09 21:29:22,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:22,197 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;@2b40c1c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:22,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-09 21:29:22,213 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:22,214 INFO L124 PetriNetUnfolderBase]: 0/125 cut-off events. [2025-01-09 21:29:22,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:22,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:22,214 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] [2025-01-09 21:29:22,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:22,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1176703125, now seen corresponding path program 1 times [2025-01-09 21:29:22,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:22,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189237917] [2025-01-09 21:29:22,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:22,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:22,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 21:29:22,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 21:29:22,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:22,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:23,150 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:29:23,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:23,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189237917] [2025-01-09 21:29:23,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189237917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:23,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:23,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429202871] [2025-01-09 21:29:23,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:23,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:23,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:23,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:23,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:23,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 473 [2025-01-09 21:29:23,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 473 transitions, 953 flow. Second operand has 6 states, 6 states have (on average 358.3333333333333) internal successors, (2150), 6 states have internal predecessors, (2150), 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:29:23,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:23,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 473 [2025-01-09 21:29:23,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:23,992 INFO L124 PetriNetUnfolderBase]: 320/1671 cut-off events. [2025-01-09 21:29:23,992 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-01-09 21:29:23,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 1671 events. 320/1671 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10111 event pairs, 288 based on Foata normal form. 88/1624 useless extension candidates. Maximal degree in co-relation 1972. Up to 682 conditions per place. [2025-01-09 21:29:24,000 INFO L140 encePairwiseOnDemand]: 446/473 looper letters, 88 selfloop transitions, 10 changer transitions 2/454 dead transitions. [2025-01-09 21:29:24,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 454 transitions, 1111 flow [2025-01-09 21:29:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2257 transitions. [2025-01-09 21:29:24,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.795278365045807 [2025-01-09 21:29:24,021 INFO L175 Difference]: Start difference. First operand has 454 places, 473 transitions, 953 flow. Second operand 6 states and 2257 transitions. [2025-01-09 21:29:24,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 454 transitions, 1111 flow [2025-01-09 21:29:24,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 454 transitions, 1111 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:24,037 INFO L231 Difference]: Finished difference. Result has 455 places, 452 transitions, 931 flow [2025-01-09 21:29:24,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=931, PETRI_PLACES=455, PETRI_TRANSITIONS=452} [2025-01-09 21:29:24,041 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, 1 predicate places. [2025-01-09 21:29:24,041 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 452 transitions, 931 flow [2025-01-09 21:29:24,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 358.3333333333333) internal successors, (2150), 6 states have internal predecessors, (2150), 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:29:24,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:24,043 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] [2025-01-09 21:29:24,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:24,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:24,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:24,045 INFO L85 PathProgramCache]: Analyzing trace with hash 16196316, now seen corresponding path program 1 times [2025-01-09 21:29:24,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:24,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909377819] [2025-01-09 21:29:24,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:24,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:24,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:29:24,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:29:24,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:24,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:24,475 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:29:24,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:24,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909377819] [2025-01-09 21:29:24,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909377819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:24,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:24,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697283078] [2025-01-09 21:29:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:24,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:24,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:24,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:24,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:24,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 473 [2025-01-09 21:29:24,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 452 transitions, 931 flow. Second operand has 6 states, 6 states have (on average 358.3333333333333) internal successors, (2150), 6 states have internal predecessors, (2150), 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:29:24,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:24,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 473 [2025-01-09 21:29:24,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:25,151 INFO L124 PetriNetUnfolderBase]: 320/1667 cut-off events. [2025-01-09 21:29:25,151 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-01-09 21:29:25,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2376 conditions, 1667 events. 320/1667 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10040 event pairs, 288 based on Foata normal form. 0/1536 useless extension candidates. Maximal degree in co-relation 2201. Up to 682 conditions per place. [2025-01-09 21:29:25,157 INFO L140 encePairwiseOnDemand]: 461/473 looper letters, 88 selfloop transitions, 10 changer transitions 0/450 dead transitions. [2025-01-09 21:29:25,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 450 transitions, 1123 flow [2025-01-09 21:29:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2242 transitions. [2025-01-09 21:29:25,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7899929527836504 [2025-01-09 21:29:25,161 INFO L175 Difference]: Start difference. First operand has 455 places, 452 transitions, 931 flow. Second operand 6 states and 2242 transitions. [2025-01-09 21:29:25,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 450 transitions, 1123 flow [2025-01-09 21:29:25,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 450 transitions, 1103 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:25,169 INFO L231 Difference]: Finished difference. Result has 451 places, 450 transitions, 927 flow [2025-01-09 21:29:25,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=927, PETRI_PLACES=451, PETRI_TRANSITIONS=450} [2025-01-09 21:29:25,171 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, -3 predicate places. [2025-01-09 21:29:25,171 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 450 transitions, 927 flow [2025-01-09 21:29:25,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 358.3333333333333) internal successors, (2150), 6 states have internal predecessors, (2150), 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:29:25,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:25,173 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] [2025-01-09 21:29:25,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:25,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:25,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:25,174 INFO L85 PathProgramCache]: Analyzing trace with hash 941056672, now seen corresponding path program 1 times [2025-01-09 21:29:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:25,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721235453] [2025-01-09 21:29:25,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:25,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 21:29:25,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 21:29:25,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:25,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:25,264 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:29:25,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:25,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721235453] [2025-01-09 21:29:25,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721235453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:25,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:25,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:29:25,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411574505] [2025-01-09 21:29:25,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:25,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:25,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:25,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:25,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 441 out of 473 [2025-01-09 21:29:25,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 450 transitions, 927 flow. Second operand has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 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:29:25,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:25,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 441 of 473 [2025-01-09 21:29:25,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:25,339 INFO L124 PetriNetUnfolderBase]: 16/628 cut-off events. [2025-01-09 21:29:25,339 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-01-09 21:29:25,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 628 events. 16/628 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1812 event pairs, 8 based on Foata normal form. 1/586 useless extension candidates. Maximal degree in co-relation 465. Up to 34 conditions per place. [2025-01-09 21:29:25,341 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 15 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-01-09 21:29:25,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 451 transitions, 963 flow [2025-01-09 21:29:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1341 transitions. [2025-01-09 21:29:25,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.945031712473573 [2025-01-09 21:29:25,343 INFO L175 Difference]: Start difference. First operand has 451 places, 450 transitions, 927 flow. Second operand 3 states and 1341 transitions. [2025-01-09 21:29:25,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 451 transitions, 963 flow [2025-01-09 21:29:25,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 943 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:25,350 INFO L231 Difference]: Finished difference. Result has 449 places, 451 transitions, 919 flow [2025-01-09 21:29:25,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=919, PETRI_PLACES=449, PETRI_TRANSITIONS=451} [2025-01-09 21:29:25,351 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, -5 predicate places. [2025-01-09 21:29:25,351 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 451 transitions, 919 flow [2025-01-09 21:29:25,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 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:29:25,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:25,353 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] [2025-01-09 21:29:25,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:29:25,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:25,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash -745616143, now seen corresponding path program 1 times [2025-01-09 21:29:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:25,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115121344] [2025-01-09 21:29:25,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:25,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:29:25,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:29:25,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:25,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:25,758 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:29:25,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:25,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115121344] [2025-01-09 21:29:25,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115121344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:25,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:25,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:25,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107991279] [2025-01-09 21:29:25,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:25,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:25,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:25,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:25,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:26,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 473 [2025-01-09 21:29:26,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 451 transitions, 919 flow. Second operand has 6 states, 6 states have (on average 358.6666666666667) internal successors, (2152), 6 states have internal predecessors, (2152), 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:29:26,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:26,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 473 [2025-01-09 21:29:26,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:26,341 INFO L124 PetriNetUnfolderBase]: 321/1789 cut-off events. [2025-01-09 21:29:26,341 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-01-09 21:29:26,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 1789 events. 321/1789 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10700 event pairs, 288 based on Foata normal form. 0/1654 useless extension candidates. Maximal degree in co-relation 2270. Up to 730 conditions per place. [2025-01-09 21:29:26,349 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 95 selfloop transitions, 5 changer transitions 0/450 dead transitions. [2025-01-09 21:29:26,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 450 transitions, 1117 flow [2025-01-09 21:29:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2237 transitions. [2025-01-09 21:29:26,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.788231148696265 [2025-01-09 21:29:26,353 INFO L175 Difference]: Start difference. First operand has 449 places, 451 transitions, 919 flow. Second operand 6 states and 2237 transitions. [2025-01-09 21:29:26,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 450 transitions, 1117 flow [2025-01-09 21:29:26,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 450 transitions, 1115 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:26,361 INFO L231 Difference]: Finished difference. Result has 452 places, 450 transitions, 925 flow [2025-01-09 21:29:26,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=925, PETRI_PLACES=452, PETRI_TRANSITIONS=450} [2025-01-09 21:29:26,362 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, -2 predicate places. [2025-01-09 21:29:26,362 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 450 transitions, 925 flow [2025-01-09 21:29:26,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 358.6666666666667) internal successors, (2152), 6 states have internal predecessors, (2152), 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:29:26,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:26,364 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] [2025-01-09 21:29:26,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:26,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:26,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:26,364 INFO L85 PathProgramCache]: Analyzing trace with hash -40861461, now seen corresponding path program 1 times [2025-01-09 21:29:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:26,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843082018] [2025-01-09 21:29:26,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:26,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:26,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 21:29:26,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 21:29:26,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:26,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:26,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:26,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843082018] [2025-01-09 21:29:26,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843082018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:26,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:26,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:29:26,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725384851] [2025-01-09 21:29:26,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:26,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:26,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:26,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:26,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:26,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 441 out of 473 [2025-01-09 21:29:26,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 450 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 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:29:26,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:26,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 441 of 473 [2025-01-09 21:29:26,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:26,543 INFO L124 PetriNetUnfolderBase]: 16/814 cut-off events. [2025-01-09 21:29:26,543 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-01-09 21:29:26,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 814 events. 16/814 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1833 event pairs, 8 based on Foata normal form. 2/767 useless extension candidates. Maximal degree in co-relation 660. Up to 38 conditions per place. [2025-01-09 21:29:26,546 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 15 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-01-09 21:29:26,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 451 transitions, 961 flow [2025-01-09 21:29:26,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:26,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1341 transitions. [2025-01-09 21:29:26,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.945031712473573 [2025-01-09 21:29:26,551 INFO L175 Difference]: Start difference. First operand has 452 places, 450 transitions, 925 flow. Second operand 3 states and 1341 transitions. [2025-01-09 21:29:26,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 451 transitions, 961 flow [2025-01-09 21:29:26,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 451 transitions, 951 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:26,559 INFO L231 Difference]: Finished difference. Result has 450 places, 451 transitions, 927 flow [2025-01-09 21:29:26,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=927, PETRI_PLACES=450, PETRI_TRANSITIONS=451} [2025-01-09 21:29:26,560 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, -4 predicate places. [2025-01-09 21:29:26,560 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 451 transitions, 927 flow [2025-01-09 21:29:26,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 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:29:26,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:26,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:26,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:26,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:26,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash -981365373, now seen corresponding path program 1 times [2025-01-09 21:29:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:26,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731717439] [2025-01-09 21:29:26,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:26,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:26,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 21:29:26,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 21:29:26,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:26,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:27,167 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:29:27,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:27,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731717439] [2025-01-09 21:29:27,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731717439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:27,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:27,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:27,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545725751] [2025-01-09 21:29:27,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:27,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:27,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:27,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:27,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:27,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 473 [2025-01-09 21:29:27,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 451 transitions, 927 flow. Second operand has 6 states, 6 states have (on average 393.5) internal successors, (2361), 6 states have internal predecessors, (2361), 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:29:27,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:27,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 473 [2025-01-09 21:29:27,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:27,824 INFO L124 PetriNetUnfolderBase]: 84/1128 cut-off events. [2025-01-09 21:29:27,825 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-01-09 21:29:27,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 1128 events. 84/1128 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3782 event pairs, 64 based on Foata normal form. 0/1042 useless extension candidates. Maximal degree in co-relation 942. Up to 311 conditions per place. [2025-01-09 21:29:27,829 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 62 selfloop transitions, 5 changer transitions 0/450 dead transitions. [2025-01-09 21:29:27,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 450 transitions, 1059 flow [2025-01-09 21:29:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2402 transitions. [2025-01-09 21:29:27,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8463706835799859 [2025-01-09 21:29:27,833 INFO L175 Difference]: Start difference. First operand has 450 places, 451 transitions, 927 flow. Second operand 6 states and 2402 transitions. [2025-01-09 21:29:27,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 450 transitions, 1059 flow [2025-01-09 21:29:27,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 450 transitions, 1057 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:27,840 INFO L231 Difference]: Finished difference. Result has 453 places, 450 transitions, 933 flow [2025-01-09 21:29:27,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=933, PETRI_PLACES=453, PETRI_TRANSITIONS=450} [2025-01-09 21:29:27,843 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, -1 predicate places. [2025-01-09 21:29:27,843 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 450 transitions, 933 flow [2025-01-09 21:29:27,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 393.5) internal successors, (2361), 6 states have internal predecessors, (2361), 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:29:27,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:27,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:27,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:29:27,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:27,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash -461362138, now seen corresponding path program 1 times [2025-01-09 21:29:27,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:27,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017446247] [2025-01-09 21:29:27,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:27,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:27,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 21:29:27,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 21:29:27,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:27,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:29:28,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:28,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017446247] [2025-01-09 21:29:28,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017446247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:28,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:28,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:28,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709916243] [2025-01-09 21:29:28,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:28,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:28,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:28,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:28,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:28,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 473 [2025-01-09 21:29:28,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 450 transitions, 933 flow. Second operand has 6 states, 6 states have (on average 361.3333333333333) internal successors, (2168), 6 states have internal predecessors, (2168), 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:29:28,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:28,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 473 [2025-01-09 21:29:28,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:28,947 INFO L124 PetriNetUnfolderBase]: 321/1969 cut-off events. [2025-01-09 21:29:28,948 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-01-09 21:29:28,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2826 conditions, 1969 events. 321/1969 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10798 event pairs, 288 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 2313. Up to 796 conditions per place. [2025-01-09 21:29:28,954 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 95 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-01-09 21:29:28,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 449 transitions, 1131 flow [2025-01-09 21:29:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2237 transitions. [2025-01-09 21:29:28,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.788231148696265 [2025-01-09 21:29:28,958 INFO L175 Difference]: Start difference. First operand has 453 places, 450 transitions, 933 flow. Second operand 6 states and 2237 transitions. [2025-01-09 21:29:28,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 449 transitions, 1131 flow [2025-01-09 21:29:28,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 449 transitions, 1121 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:28,963 INFO L231 Difference]: Finished difference. Result has 452 places, 449 transitions, 931 flow [2025-01-09 21:29:28,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=931, PETRI_PLACES=452, PETRI_TRANSITIONS=449} [2025-01-09 21:29:28,964 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, -2 predicate places. [2025-01-09 21:29:28,964 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 449 transitions, 931 flow [2025-01-09 21:29:28,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 361.3333333333333) internal successors, (2168), 6 states have internal predecessors, (2168), 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:29:28,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:28,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:28,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:29:28,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:28,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1343027095, now seen corresponding path program 1 times [2025-01-09 21:29:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:28,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942054909] [2025-01-09 21:29:28,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:29,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 21:29:29,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 21:29:29,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:29,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:29:29,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:29,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942054909] [2025-01-09 21:29:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942054909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:29,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:29,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:29,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130986957] [2025-01-09 21:29:29,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:29,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:29,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:29,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:29,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:29,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 473 [2025-01-09 21:29:29,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 449 transitions, 931 flow. Second operand has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 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:29:29,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:29,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 473 [2025-01-09 21:29:29,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:29,878 INFO L124 PetriNetUnfolderBase]: 321/1965 cut-off events. [2025-01-09 21:29:29,878 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-01-09 21:29:29,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2806 conditions, 1965 events. 321/1965 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10804 event pairs, 288 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 2329. Up to 780 conditions per place. [2025-01-09 21:29:29,885 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 91 selfloop transitions, 5 changer transitions 0/448 dead transitions. [2025-01-09 21:29:29,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 448 transitions, 1121 flow [2025-01-09 21:29:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2257 transitions. [2025-01-09 21:29:29,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.795278365045807 [2025-01-09 21:29:29,892 INFO L175 Difference]: Start difference. First operand has 452 places, 449 transitions, 931 flow. Second operand 6 states and 2257 transitions. [2025-01-09 21:29:29,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 448 transitions, 1121 flow [2025-01-09 21:29:29,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 448 transitions, 1111 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:29,897 INFO L231 Difference]: Finished difference. Result has 451 places, 448 transitions, 929 flow [2025-01-09 21:29:29,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=929, PETRI_PLACES=451, PETRI_TRANSITIONS=448} [2025-01-09 21:29:29,898 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, -3 predicate places. [2025-01-09 21:29:29,898 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 448 transitions, 929 flow [2025-01-09 21:29:29,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 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:29:29,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:29,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:29,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:29:29,900 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:29,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:29,900 INFO L85 PathProgramCache]: Analyzing trace with hash 283237335, now seen corresponding path program 1 times [2025-01-09 21:29:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:29,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720994197] [2025-01-09 21:29:29,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:29,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:29,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:29:29,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:29:29,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:29,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:29:30,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720994197] [2025-01-09 21:29:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720994197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:30,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:30,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:30,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131549144] [2025-01-09 21:29:30,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:30,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:30,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:30,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:30,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 473 [2025-01-09 21:29:30,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 448 transitions, 929 flow. Second operand has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 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:29:30,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:30,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 473 [2025-01-09 21:29:30,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:30,801 INFO L124 PetriNetUnfolderBase]: 321/1961 cut-off events. [2025-01-09 21:29:30,802 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-01-09 21:29:30,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2802 conditions, 1961 events. 321/1961 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10786 event pairs, 288 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 2344. Up to 780 conditions per place. [2025-01-09 21:29:30,808 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 91 selfloop transitions, 5 changer transitions 0/447 dead transitions. [2025-01-09 21:29:30,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 447 transitions, 1119 flow [2025-01-09 21:29:30,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2257 transitions. [2025-01-09 21:29:30,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.795278365045807 [2025-01-09 21:29:30,812 INFO L175 Difference]: Start difference. First operand has 451 places, 448 transitions, 929 flow. Second operand 6 states and 2257 transitions. [2025-01-09 21:29:30,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 447 transitions, 1119 flow [2025-01-09 21:29:30,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 447 transitions, 1109 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:30,817 INFO L231 Difference]: Finished difference. Result has 450 places, 447 transitions, 927 flow [2025-01-09 21:29:30,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=927, PETRI_PLACES=450, PETRI_TRANSITIONS=447} [2025-01-09 21:29:30,819 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, -4 predicate places. [2025-01-09 21:29:30,819 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 447 transitions, 927 flow [2025-01-09 21:29:30,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 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:29:30,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:30,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:30,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:29:30,820 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:30,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:30,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1391952125, now seen corresponding path program 1 times [2025-01-09 21:29:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:30,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036166136] [2025-01-09 21:29:30,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:30,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:30,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 21:29:30,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 21:29:30,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:30,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 21:29:31,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:31,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036166136] [2025-01-09 21:29:31,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036166136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:31,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:31,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:31,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522749753] [2025-01-09 21:29:31,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:31,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:31,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:31,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:31,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:31,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 473 [2025-01-09 21:29:31,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 447 transitions, 927 flow. Second operand has 6 states, 6 states have (on average 362.5) internal successors, (2175), 6 states have internal predecessors, (2175), 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:29:31,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:31,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 473 [2025-01-09 21:29:31,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:31,816 INFO L124 PetriNetUnfolderBase]: 321/1957 cut-off events. [2025-01-09 21:29:31,817 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-01-09 21:29:31,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2818 conditions, 1957 events. 321/1957 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10713 event pairs, 288 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 2357. Up to 800 conditions per place. [2025-01-09 21:29:31,824 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 96 selfloop transitions, 5 changer transitions 0/446 dead transitions. [2025-01-09 21:29:31,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 446 transitions, 1127 flow [2025-01-09 21:29:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2232 transitions. [2025-01-09 21:29:31,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7864693446088795 [2025-01-09 21:29:31,828 INFO L175 Difference]: Start difference. First operand has 450 places, 447 transitions, 927 flow. Second operand 6 states and 2232 transitions. [2025-01-09 21:29:31,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 446 transitions, 1127 flow [2025-01-09 21:29:31,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 446 transitions, 1117 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:31,837 INFO L231 Difference]: Finished difference. Result has 449 places, 446 transitions, 925 flow [2025-01-09 21:29:31,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=925, PETRI_PLACES=449, PETRI_TRANSITIONS=446} [2025-01-09 21:29:31,839 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, -5 predicate places. [2025-01-09 21:29:31,839 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 446 transitions, 925 flow [2025-01-09 21:29:31,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 362.5) internal successors, (2175), 6 states have internal predecessors, (2175), 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:29:31,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:31,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:31,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:29:31,840 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:31,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:31,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1897981774, now seen corresponding path program 1 times [2025-01-09 21:29:31,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:31,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115421221] [2025-01-09 21:29:31,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:31,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:31,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 21:29:31,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 21:29:31,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:31,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 21:29:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115421221] [2025-01-09 21:29:31,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115421221] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327066521] [2025-01-09 21:29:31,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:31,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:31,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:31,996 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:29:31,997 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:29:32,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 21:29:32,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 21:29:32,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:32,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:32,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:29:32,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 21:29:32,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:29:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 21:29:32,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327066521] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:29:32,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:29:32,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:29:32,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957505895] [2025-01-09 21:29:32,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:29:32,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:29:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:32,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:29:32,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:29:32,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 438 out of 473 [2025-01-09 21:29:32,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 446 transitions, 925 flow. Second operand has 10 states, 10 states have (on average 439.8) internal successors, (4398), 10 states have internal predecessors, (4398), 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:29:32,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:32,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 438 of 473 [2025-01-09 21:29:32,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:32,678 INFO L124 PetriNetUnfolderBase]: 16/978 cut-off events. [2025-01-09 21:29:32,678 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:29:32,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 978 events. 16/978 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1205 event pairs, 8 based on Foata normal form. 4/953 useless extension candidates. Maximal degree in co-relation 866. Up to 38 conditions per place. [2025-01-09 21:29:32,681 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 19 selfloop transitions, 9 changer transitions 0/454 dead transitions. [2025-01-09 21:29:32,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 454 transitions, 999 flow [2025-01-09 21:29:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:29:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:29:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3972 transitions. [2025-01-09 21:29:32,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9330514446793516 [2025-01-09 21:29:32,685 INFO L175 Difference]: Start difference. First operand has 449 places, 446 transitions, 925 flow. Second operand 9 states and 3972 transitions. [2025-01-09 21:29:32,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 454 transitions, 999 flow [2025-01-09 21:29:32,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 454 transitions, 989 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:32,690 INFO L231 Difference]: Finished difference. Result has 455 places, 452 transitions, 965 flow [2025-01-09 21:29:32,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=965, PETRI_PLACES=455, PETRI_TRANSITIONS=452} [2025-01-09 21:29:32,691 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, 1 predicate places. [2025-01-09 21:29:32,691 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 452 transitions, 965 flow [2025-01-09 21:29:32,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 439.8) internal successors, (4398), 10 states have internal predecessors, (4398), 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:29:32,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:32,693 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:32,701 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:29:32,893 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,SelfDestructingSolverStorable10 [2025-01-09 21:29:32,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:32,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 424381140, now seen corresponding path program 2 times [2025-01-09 21:29:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:32,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789228208] [2025-01-09 21:29:32,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:29:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:32,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 418 statements into 2 equivalence classes. [2025-01-09 21:29:32,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 119 of 418 statements. [2025-01-09 21:29:32,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:29:32,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2025-01-09 21:29:33,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:33,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789228208] [2025-01-09 21:29:33,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789228208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:33,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:33,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:33,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047949845] [2025-01-09 21:29:33,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:33,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:33,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:33,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:33,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:34,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 473 [2025-01-09 21:29:34,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 452 transitions, 965 flow. Second operand has 6 states, 6 states have (on average 396.3333333333333) internal successors, (2378), 6 states have internal predecessors, (2378), 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:29:34,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:34,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 473 [2025-01-09 21:29:34,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:34,294 INFO L124 PetriNetUnfolderBase]: 84/1295 cut-off events. [2025-01-09 21:29:34,294 INFO L125 PetriNetUnfolderBase]: For 14/18 co-relation queries the response was YES. [2025-01-09 21:29:34,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 1295 events. 84/1295 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3120 event pairs, 64 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 1064. Up to 355 conditions per place. [2025-01-09 21:29:34,297 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 62 selfloop transitions, 5 changer transitions 0/451 dead transitions. [2025-01-09 21:29:34,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 451 transitions, 1097 flow [2025-01-09 21:29:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2402 transitions. [2025-01-09 21:29:34,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8463706835799859 [2025-01-09 21:29:34,301 INFO L175 Difference]: Start difference. First operand has 455 places, 452 transitions, 965 flow. Second operand 6 states and 2402 transitions. [2025-01-09 21:29:34,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 451 transitions, 1097 flow [2025-01-09 21:29:34,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 451 transitions, 1091 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:34,307 INFO L231 Difference]: Finished difference. Result has 458 places, 451 transitions, 967 flow [2025-01-09 21:29:34,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=967, PETRI_PLACES=458, PETRI_TRANSITIONS=451} [2025-01-09 21:29:34,309 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, 4 predicate places. [2025-01-09 21:29:34,309 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 451 transitions, 967 flow [2025-01-09 21:29:34,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 396.3333333333333) internal successors, (2378), 6 states have internal predecessors, (2378), 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:29:34,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:34,310 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:34,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:29:34,310 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:34,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1948298151, now seen corresponding path program 1 times [2025-01-09 21:29:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:34,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801245995] [2025-01-09 21:29:34,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:34,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:34,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-01-09 21:29:34,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-01-09 21:29:34,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:34,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-01-09 21:29:34,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801245995] [2025-01-09 21:29:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801245995] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991359331] [2025-01-09 21:29:34,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:34,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:34,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:34,579 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:29:34,582 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:29:34,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-01-09 21:29:34,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-01-09 21:29:34,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:34,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:34,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:29:34,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 1 proven. 441 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 21:29:35,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:29:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 1 proven. 441 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 21:29:35,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991359331] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:29:35,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:29:35,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-09 21:29:35,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013456704] [2025-01-09 21:29:35,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:29:35,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 21:29:35,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:35,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 21:29:35,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-09 21:29:35,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 473 [2025-01-09 21:29:35,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 451 transitions, 967 flow. Second operand has 19 states, 19 states have (on average 434.5263157894737) internal successors, (8256), 19 states have internal predecessors, (8256), 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:29:35,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:35,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 473 [2025-01-09 21:29:35,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:36,586 INFO L124 PetriNetUnfolderBase]: 17/2357 cut-off events. [2025-01-09 21:29:36,586 INFO L125 PetriNetUnfolderBase]: For 80/81 co-relation queries the response was YES. [2025-01-09 21:29:36,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 2357 events. 17/2357 cut-off events. For 80/81 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1205 event pairs, 8 based on Foata normal form. 13/2342 useless extension candidates. Maximal degree in co-relation 2424. Up to 40 conditions per place. [2025-01-09 21:29:36,591 INFO L140 encePairwiseOnDemand]: 462/473 looper letters, 51 selfloop transitions, 68 changer transitions 0/537 dead transitions. [2025-01-09 21:29:36,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 537 transitions, 1615 flow [2025-01-09 21:29:36,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-09 21:29:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-01-09 21:29:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 27348 transitions. [2025-01-09 21:29:36,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2025-01-09 21:29:36,609 INFO L175 Difference]: Start difference. First operand has 458 places, 451 transitions, 967 flow. Second operand 63 states and 27348 transitions. [2025-01-09 21:29:36,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 537 transitions, 1615 flow [2025-01-09 21:29:36,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 537 transitions, 1605 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:36,615 INFO L231 Difference]: Finished difference. Result has 531 places, 513 transitions, 1477 flow [2025-01-09 21:29:36,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1477, PETRI_PLACES=531, PETRI_TRANSITIONS=513} [2025-01-09 21:29:36,616 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, 77 predicate places. [2025-01-09 21:29:36,616 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 513 transitions, 1477 flow [2025-01-09 21:29:36,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 434.5263157894737) internal successors, (8256), 19 states have internal predecessors, (8256), 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:29:36,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:36,618 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:36,627 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:29:36,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:36,823 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:36,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1846246363, now seen corresponding path program 2 times [2025-01-09 21:29:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:36,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458591033] [2025-01-09 21:29:36,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:29:36,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:37,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1437 statements into 2 equivalence classes. [2025-01-09 21:29:37,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 119 of 1437 statements. [2025-01-09 21:29:37,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:29:37,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 13737 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13737 trivial. 0 not checked. [2025-01-09 21:29:37,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458591033] [2025-01-09 21:29:37,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458591033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:37,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:37,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:37,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960254773] [2025-01-09 21:29:37,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:37,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:37,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:37,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:37,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:37,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 473 [2025-01-09 21:29:37,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 513 transitions, 1477 flow. Second operand has 6 states, 6 states have (on average 396.3333333333333) internal successors, (2378), 6 states have internal predecessors, (2378), 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:29:37,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:37,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 473 [2025-01-09 21:29:37,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:38,448 INFO L124 PetriNetUnfolderBase]: 85/2674 cut-off events. [2025-01-09 21:29:38,448 INFO L125 PetriNetUnfolderBase]: For 436/440 co-relation queries the response was YES. [2025-01-09 21:29:38,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 2674 events. 85/2674 cut-off events. For 436/440 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3109 event pairs, 64 based on Foata normal form. 0/2602 useless extension candidates. Maximal degree in co-relation 3107. Up to 783 conditions per place. [2025-01-09 21:29:38,456 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 62 selfloop transitions, 5 changer transitions 0/512 dead transitions. [2025-01-09 21:29:38,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 512 transitions, 1609 flow [2025-01-09 21:29:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2402 transitions. [2025-01-09 21:29:38,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8463706835799859 [2025-01-09 21:29:38,459 INFO L175 Difference]: Start difference. First operand has 531 places, 513 transitions, 1477 flow. Second operand 6 states and 2402 transitions. [2025-01-09 21:29:38,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 512 transitions, 1609 flow [2025-01-09 21:29:38,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 512 transitions, 1533 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-01-09 21:29:38,468 INFO L231 Difference]: Finished difference. Result has 528 places, 512 transitions, 1409 flow [2025-01-09 21:29:38,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1409, PETRI_PLACES=528, PETRI_TRANSITIONS=512} [2025-01-09 21:29:38,469 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, 74 predicate places. [2025-01-09 21:29:38,469 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 512 transitions, 1409 flow [2025-01-09 21:29:38,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 396.3333333333333) internal successors, (2378), 6 states have internal predecessors, (2378), 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:29:38,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:38,470 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:38,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:29:38,470 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:38,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:38,472 INFO L85 PathProgramCache]: Analyzing trace with hash 874069841, now seen corresponding path program 1 times [2025-01-09 21:29:38,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:38,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144702824] [2025-01-09 21:29:38,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:38,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:38,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1456 statements into 1 equivalence classes. [2025-01-09 21:29:38,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1456 of 1456 statements. [2025-01-09 21:29:38,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:38,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13962 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13962 trivial. 0 not checked. [2025-01-09 21:29:39,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144702824] [2025-01-09 21:29:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144702824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:39,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:39,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:29:39,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972961663] [2025-01-09 21:29:39,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:39,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:39,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:39,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:39,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 441 out of 473 [2025-01-09 21:29:39,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 512 transitions, 1409 flow. Second operand has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 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:29:39,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:39,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 441 of 473 [2025-01-09 21:29:39,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:39,933 INFO L124 PetriNetUnfolderBase]: 40/2625 cut-off events. [2025-01-09 21:29:39,933 INFO L125 PetriNetUnfolderBase]: For 481/485 co-relation queries the response was YES. [2025-01-09 21:29:39,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 2625 events. 40/2625 cut-off events. For 481/485 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3166 event pairs, 0 based on Foata normal form. 2/2564 useless extension candidates. Maximal degree in co-relation 2975. Up to 72 conditions per place. [2025-01-09 21:29:39,940 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 22 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-01-09 21:29:39,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 520 transitions, 1473 flow [2025-01-09 21:29:39,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1348 transitions. [2025-01-09 21:29:39,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9499647639182522 [2025-01-09 21:29:39,941 INFO L175 Difference]: Start difference. First operand has 528 places, 512 transitions, 1409 flow. Second operand 3 states and 1348 transitions. [2025-01-09 21:29:39,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 520 transitions, 1473 flow [2025-01-09 21:29:39,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 520 transitions, 1463 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:39,949 INFO L231 Difference]: Finished difference. Result has 526 places, 512 transitions, 1407 flow [2025-01-09 21:29:39,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1407, PETRI_PLACES=526, PETRI_TRANSITIONS=512} [2025-01-09 21:29:39,950 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, 72 predicate places. [2025-01-09 21:29:39,950 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 512 transitions, 1407 flow [2025-01-09 21:29:39,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 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:29:39,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:39,950 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:39,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:29:39,951 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:39,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:39,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1491764821, now seen corresponding path program 1 times [2025-01-09 21:29:39,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:39,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804445158] [2025-01-09 21:29:39,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:40,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1456 statements into 1 equivalence classes. [2025-01-09 21:29:40,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1456 of 1456 statements. [2025-01-09 21:29:40,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:40,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 13962 backedges. 7306 proven. 3073 refuted. 0 times theorem prover too weak. 3583 trivial. 0 not checked. [2025-01-09 21:29:42,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:42,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804445158] [2025-01-09 21:29:42,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804445158] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:42,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294812132] [2025-01-09 21:29:42,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:42,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:42,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:42,426 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:29:42,428 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:29:42,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1456 statements into 1 equivalence classes. [2025-01-09 21:29:43,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1456 of 1456 statements. [2025-01-09 21:29:43,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:43,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:43,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 5710 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:29:43,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13962 backedges. 7306 proven. 3073 refuted. 0 times theorem prover too weak. 3583 trivial. 0 not checked. [2025-01-09 21:29:43,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:29:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 13962 backedges. 7306 proven. 3073 refuted. 0 times theorem prover too weak. 3583 trivial. 0 not checked. [2025-01-09 21:29:44,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294812132] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:29:44,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:29:44,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-01-09 21:29:44,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193490950] [2025-01-09 21:29:44,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:29:44,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 21:29:44,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:44,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 21:29:44,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 21:29:44,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 438 out of 473 [2025-01-09 21:29:44,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 512 transitions, 1407 flow. Second operand has 34 states, 34 states have (on average 440.11764705882354) internal successors, (14964), 34 states have internal predecessors, (14964), 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:29:44,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:44,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 438 of 473 [2025-01-09 21:29:44,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:46,354 INFO L124 PetriNetUnfolderBase]: 16/4513 cut-off events. [2025-01-09 21:29:46,354 INFO L125 PetriNetUnfolderBase]: For 3212/3213 co-relation queries the response was YES. [2025-01-09 21:29:46,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5309 conditions, 4513 events. 16/4513 cut-off events. For 3212/3213 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1249 event pairs, 8 based on Foata normal form. 24/4512 useless extension candidates. Maximal degree in co-relation 5043. Up to 78 conditions per place. [2025-01-09 21:29:46,362 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 51 selfloop transitions, 135 changer transitions 0/613 dead transitions. [2025-01-09 21:29:46,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 613 transitions, 2543 flow [2025-01-09 21:29:46,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 21:29:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-09 21:29:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 19794 transitions. [2025-01-09 21:29:46,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9299506694855532 [2025-01-09 21:29:46,371 INFO L175 Difference]: Start difference. First operand has 526 places, 512 transitions, 1407 flow. Second operand 45 states and 19794 transitions. [2025-01-09 21:29:46,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 613 transitions, 2543 flow [2025-01-09 21:29:46,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 613 transitions, 2539 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:46,381 INFO L231 Difference]: Finished difference. Result has 577 places, 587 transitions, 2277 flow [2025-01-09 21:29:46,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2277, PETRI_PLACES=577, PETRI_TRANSITIONS=587} [2025-01-09 21:29:46,382 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, 123 predicate places. [2025-01-09 21:29:46,383 INFO L471 AbstractCegarLoop]: Abstraction has has 577 places, 587 transitions, 2277 flow [2025-01-09 21:29:46,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 440.11764705882354) internal successors, (14964), 34 states have internal predecessors, (14964), 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:29:46,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:46,386 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:46,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 21:29:46,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:46,587 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:46,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:46,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1301175637, now seen corresponding path program 2 times [2025-01-09 21:29:46,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:46,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480003965] [2025-01-09 21:29:46,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:29:46,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:46,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2896 statements into 2 equivalence classes. [2025-01-09 21:29:46,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 136 of 2896 statements. [2025-01-09 21:29:46,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:29:46,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 64922 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64922 trivial. 0 not checked. [2025-01-09 21:29:47,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:47,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480003965] [2025-01-09 21:29:47,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480003965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:47,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:47,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:47,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481789613] [2025-01-09 21:29:47,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:47,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:47,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:47,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:47,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 473 [2025-01-09 21:29:47,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 587 transitions, 2277 flow. Second operand has 6 states, 6 states have (on average 361.8333333333333) internal successors, (2171), 6 states have internal predecessors, (2171), 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:29:47,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:47,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 473 [2025-01-09 21:29:47,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:51,434 INFO L124 PetriNetUnfolderBase]: 740/7076 cut-off events. [2025-01-09 21:29:51,434 INFO L125 PetriNetUnfolderBase]: For 1224/1238 co-relation queries the response was YES. [2025-01-09 21:29:51,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10879 conditions, 7076 events. 740/7076 cut-off events. For 1224/1238 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 22756 event pairs, 315 based on Foata normal form. 4/6835 useless extension candidates. Maximal degree in co-relation 6548. Up to 2692 conditions per place. [2025-01-09 21:29:51,453 INFO L140 encePairwiseOnDemand]: 438/473 looper letters, 135 selfloop transitions, 118 changer transitions 0/736 dead transitions. [2025-01-09 21:29:51,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 736 transitions, 3082 flow [2025-01-09 21:29:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2372 transitions. [2025-01-09 21:29:51,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.835799859055673 [2025-01-09 21:29:51,455 INFO L175 Difference]: Start difference. First operand has 577 places, 587 transitions, 2277 flow. Second operand 6 states and 2372 transitions. [2025-01-09 21:29:51,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 736 transitions, 3082 flow [2025-01-09 21:29:51,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 736 transitions, 2974 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-01-09 21:29:51,473 INFO L231 Difference]: Finished difference. Result has 569 places, 704 transitions, 2944 flow [2025-01-09 21:29:51,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2944, PETRI_PLACES=569, PETRI_TRANSITIONS=704} [2025-01-09 21:29:51,475 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, 115 predicate places. [2025-01-09 21:29:51,475 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 704 transitions, 2944 flow [2025-01-09 21:29:51,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 361.8333333333333) internal successors, (2171), 6 states have internal predecessors, (2171), 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:29:51,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:51,476 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:51,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:29:51,476 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:51,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:51,482 INFO L85 PathProgramCache]: Analyzing trace with hash 557322474, now seen corresponding path program 1 times [2025-01-09 21:29:51,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:51,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399386444] [2025-01-09 21:29:51,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:51,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:51,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2910 statements into 1 equivalence classes. [2025-01-09 21:29:51,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2910 of 2910 statements. [2025-01-09 21:29:51,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:51,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 64922 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64922 trivial. 0 not checked. [2025-01-09 21:29:54,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:54,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399386444] [2025-01-09 21:29:54,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399386444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:54,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:54,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:54,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547824216] [2025-01-09 21:29:54,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:54,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:29:54,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:54,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:29:54,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:29:54,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 473 [2025-01-09 21:29:54,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 704 transitions, 2944 flow. Second operand has 5 states, 5 states have (on average 440.6) internal successors, (2203), 5 states have internal predecessors, (2203), 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:29:54,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:54,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 473 [2025-01-09 21:29:54,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:58,115 INFO L124 PetriNetUnfolderBase]: 303/5697 cut-off events. [2025-01-09 21:29:58,115 INFO L125 PetriNetUnfolderBase]: For 1379/1421 co-relation queries the response was YES. [2025-01-09 21:29:58,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7495 conditions, 5697 events. 303/5697 cut-off events. For 1379/1421 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10034 event pairs, 0 based on Foata normal form. 10/5611 useless extension candidates. Maximal degree in co-relation 5024. Up to 368 conditions per place. [2025-01-09 21:29:58,127 INFO L140 encePairwiseOnDemand]: 468/473 looper letters, 34 selfloop transitions, 5 changer transitions 0/705 dead transitions. [2025-01-09 21:29:58,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 705 transitions, 3019 flow [2025-01-09 21:29:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2673 transitions. [2025-01-09 21:29:58,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9418604651162791 [2025-01-09 21:29:58,129 INFO L175 Difference]: Start difference. First operand has 569 places, 704 transitions, 2944 flow. Second operand 6 states and 2673 transitions. [2025-01-09 21:29:58,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 705 transitions, 3019 flow [2025-01-09 21:29:58,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 705 transitions, 3016 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:58,145 INFO L231 Difference]: Finished difference. Result has 551 places, 681 transitions, 2900 flow [2025-01-09 21:29:58,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=2890, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2900, PETRI_PLACES=551, PETRI_TRANSITIONS=681} [2025-01-09 21:29:58,146 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, 97 predicate places. [2025-01-09 21:29:58,146 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 681 transitions, 2900 flow [2025-01-09 21:29:58,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 440.6) internal successors, (2203), 5 states have internal predecessors, (2203), 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:29:58,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:58,147 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:58,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:29:58,147 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:29:58,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2065803958, now seen corresponding path program 1 times [2025-01-09 21:29:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:58,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995504978] [2025-01-09 21:29:58,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:58,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2911 statements into 1 equivalence classes. [2025-01-09 21:29:58,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2911 of 2911 statements. [2025-01-09 21:29:58,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:58,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 64922 backedges. 33146 proven. 15345 refuted. 0 times theorem prover too weak. 16431 trivial. 0 not checked. [2025-01-09 21:30:07,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:07,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995504978] [2025-01-09 21:30:07,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995504978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:30:07,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286574889] [2025-01-09 21:30:07,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:07,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:07,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:07,886 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:30:07,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:30:09,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2911 statements into 1 equivalence classes. [2025-01-09 21:30:09,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2911 of 2911 statements. [2025-01-09 21:30:09,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:09,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:09,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 11659 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 21:30:10,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:30:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 64922 backedges. 33146 proven. 15345 refuted. 0 times theorem prover too weak. 16431 trivial. 0 not checked. [2025-01-09 21:30:10,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:30:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 64922 backedges. 33146 proven. 15345 refuted. 0 times theorem prover too weak. 16431 trivial. 0 not checked. [2025-01-09 21:30:12,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286574889] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:30:12,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:30:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-01-09 21:30:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635415528] [2025-01-09 21:30:12,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:30:12,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-01-09 21:30:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:12,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-01-09 21:30:12,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 21:30:12,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 438 out of 473 [2025-01-09 21:30:12,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 681 transitions, 2900 flow. Second operand has 63 states, 63 states have (on average 440.1111111111111) internal successors, (27727), 63 states have internal predecessors, (27727), 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:30:12,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:12,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 438 of 473 [2025-01-09 21:30:12,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:19,516 INFO L124 PetriNetUnfolderBase]: 198/9525 cut-off events. [2025-01-09 21:30:19,516 INFO L125 PetriNetUnfolderBase]: For 13554/13601 co-relation queries the response was YES. [2025-01-09 21:30:19,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12296 conditions, 9525 events. 198/9525 cut-off events. For 13554/13601 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8817 event pairs, 0 based on Foata normal form. 45/9484 useless extension candidates. Maximal degree in co-relation 10211. Up to 345 conditions per place. [2025-01-09 21:30:19,544 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 94 selfloop transitions, 270 changer transitions 0/887 dead transitions. [2025-01-09 21:30:19,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 887 transitions, 5814 flow [2025-01-09 21:30:19,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-01-09 21:30:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-01-09 21:30:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 39569 transitions. [2025-01-09 21:30:19,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9295043457834156 [2025-01-09 21:30:19,560 INFO L175 Difference]: Start difference. First operand has 551 places, 681 transitions, 2900 flow. Second operand 90 states and 39569 transitions. [2025-01-09 21:30:19,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 887 transitions, 5814 flow [2025-01-09 21:30:19,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 887 transitions, 5805 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:30:19,584 INFO L231 Difference]: Finished difference. Result has 652 places, 819 transitions, 4883 flow [2025-01-09 21:30:19,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=2891, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4883, PETRI_PLACES=652, PETRI_TRANSITIONS=819} [2025-01-09 21:30:19,586 INFO L279 CegarLoopForPetriNet]: 454 programPoint places, 198 predicate places. [2025-01-09 21:30:19,586 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 819 transitions, 4883 flow [2025-01-09 21:30:19,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 440.1111111111111) internal successors, (27727), 63 states have internal predecessors, (27727), 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:30:19,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:19,592 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:19,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:30:19,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:19,793 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:30:19,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1179938646, now seen corresponding path program 2 times [2025-01-09 21:30:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:19,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330123483] [2025-01-09 21:30:19,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:30:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:20,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5611 statements into 2 equivalence classes. [2025-01-09 21:30:21,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5611 of 5611 statements. [2025-01-09 21:30:21,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:30:21,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 261212 backedges. 960 proven. 131491 refuted. 0 times theorem prover too weak. 128761 trivial. 0 not checked. [2025-01-09 21:30:33,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:33,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330123483] [2025-01-09 21:30:33,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330123483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:30:33,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978305858] [2025-01-09 21:30:33,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:30:33,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:33,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:33,668 INFO L229 MonitoredProcess]: Starting monitored process 6 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:30:33,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:30:35,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5611 statements into 2 equivalence classes. [2025-01-09 21:30:37,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5611 of 5611 statements. [2025-01-09 21:30:37,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:30:37,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:37,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 22699 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:30:37,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:30:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 261212 backedges. 960 proven. 131491 refuted. 0 times theorem prover too weak. 128761 trivial. 0 not checked. [2025-01-09 21:30:41,761 INFO L312 TraceCheckSpWp]: Computing backward predicates...