./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/twostage_3-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/twostage_3-race.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 c1c75e051173a22f60f33f26eab32e0b3a7dcaf46f2d4cc494d0c9d8775c984e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:09:23,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:09:23,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:09:23,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:09:23,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:09:23,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:09:23,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:09:23,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:09:23,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:09:23,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:09:23,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:09:23,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:09:23,572 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:09:23,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:09:23,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:09:23,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:09:23,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:09:23,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:09:23,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:09:23,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:09:23,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:09:23,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:09:23,574 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:09:23,574 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:09:23,574 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:09:23,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:09:23,574 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:09:23,574 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:09:23,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:23,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:09:23,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:09:23,575 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 -> c1c75e051173a22f60f33f26eab32e0b3a7dcaf46f2d4cc494d0c9d8775c984e [2025-02-08 05:09:23,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:09:23,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:09:23,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:09:23,830 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:09:23,831 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:09:23,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/twostage_3-race.i [2025-02-08 05:09:25,003 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30f8a57c9/11e331a6c48e489486762654579d1d27/FLAG8fc02d295 [2025-02-08 05:09:25,355 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:09:25,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3-race.i [2025-02-08 05:09:25,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30f8a57c9/11e331a6c48e489486762654579d1d27/FLAG8fc02d295 [2025-02-08 05:09:25,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30f8a57c9/11e331a6c48e489486762654579d1d27 [2025-02-08 05:09:25,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:09:25,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:09:25,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:25,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:09:25,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:09:25,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44bb460e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25, skipping insertion in model container [2025-02-08 05:09:25,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:09:25,758 WARN L1731 CHandler]: Possible shadowing of function lock [2025-02-08 05:09:25,764 WARN L1731 CHandler]: Possible shadowing of function lock [2025-02-08 05:09:25,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:25,771 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:09:25,813 WARN L1731 CHandler]: Possible shadowing of function lock [2025-02-08 05:09:25,813 WARN L1731 CHandler]: Possible shadowing of function lock [2025-02-08 05:09:25,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:25,855 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:09:25,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25 WrapperNode [2025-02-08 05:09:25,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:25,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:25,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:09:25,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:09:25,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,895 INFO L138 Inliner]: procedures = 373, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 272 [2025-02-08 05:09:25,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:25,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:09:25,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:09:25,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:09:25,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:09:25,955 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:09:25,955 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:09:25,955 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:09:25,956 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (1/1) ... [2025-02-08 05:09:25,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:25,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:09:26,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:09:26,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:09:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-02-08 05:09:26,029 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-02-08 05:09:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-02-08 05:09:26,029 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-02-08 05:09:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:09:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:09:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:09:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:09:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:09:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:09:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:09:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:09:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:09:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:09:26,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:09:26,031 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:09:26,125 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:09:26,127 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:09:26,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1297: havoc main_~#tPool~0#1.base, main_~#tPool~0#1.offset; [2025-02-08 05:09:26,461 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1297-1: SUMMARY for call ULTIMATE.dealloc(main_~#tPool~0#1.base, main_~#tPool~0#1.offset); srcloc: null [2025-02-08 05:09:26,462 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1298: havoc main_~#rPool~0#1.base, main_~#rPool~0#1.offset; [2025-02-08 05:09:26,462 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1298-1: SUMMARY for call ULTIMATE.dealloc(main_~#rPool~0#1.base, main_~#rPool~0#1.offset); srcloc: null [2025-02-08 05:09:26,527 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:09:26,527 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:09:26,556 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:09:26,556 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:09:26,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:26 BoogieIcfgContainer [2025-02-08 05:09:26,557 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:09:26,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:09:26,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:09:26,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:09:26,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:09:25" (1/3) ... [2025-02-08 05:09:26,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa66cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:26, skipping insertion in model container [2025-02-08 05:09:26,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:25" (2/3) ... [2025-02-08 05:09:26,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa66cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:26, skipping insertion in model container [2025-02-08 05:09:26,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:26" (3/3) ... [2025-02-08 05:09:26,567 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3-race.i [2025-02-08 05:09:26,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:09:26,576 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3-race.i that has 3 procedures, 335 locations, 1 initial locations, 4 loop locations, and 43 error locations. [2025-02-08 05:09:26,576 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:09:26,658 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:09:26,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 341 places, 357 transitions, 734 flow [2025-02-08 05:09:26,812 INFO L124 PetriNetUnfolderBase]: 43/670 cut-off events. [2025-02-08 05:09:26,814 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:09:26,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 670 events. 43/670 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2896 event pairs, 0 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 354. Up to 8 conditions per place. [2025-02-08 05:09:26,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 341 places, 357 transitions, 734 flow [2025-02-08 05:09:26,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 341 places, 357 transitions, 734 flow [2025-02-08 05:09:26,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:26,850 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;@512a8b1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:26,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-08 05:09:26,854 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:26,854 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:09:26,854 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:09:26,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:26,854 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] [2025-02-08 05:09:26,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:26,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1250125259, now seen corresponding path program 1 times [2025-02-08 05:09:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:26,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89994618] [2025-02-08 05:09:26,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:26,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 05:09:26,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 05:09:26,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:26,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:26,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:26,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89994618] [2025-02-08 05:09:26,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89994618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:26,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:26,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:26,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752502912] [2025-02-08 05:09:26,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:27,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:27,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:27,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:27,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 357 [2025-02-08 05:09:27,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 357 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:27,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:27,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 357 [2025-02-08 05:09:27,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:27,384 INFO L124 PetriNetUnfolderBase]: 197/2060 cut-off events. [2025-02-08 05:09:27,385 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-02-08 05:09:27,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2444 conditions, 2060 events. 197/2060 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 15309 event pairs, 166 based on Foata normal form. 186/1888 useless extension candidates. Maximal degree in co-relation 1786. Up to 338 conditions per place. [2025-02-08 05:09:27,398 INFO L140 encePairwiseOnDemand]: 338/357 looper letters, 23 selfloop transitions, 1 changer transitions 8/337 dead transitions. [2025-02-08 05:09:27,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 337 transitions, 742 flow [2025-02-08 05:09:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2025-02-08 05:09:27,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2025-02-08 05:09:27,414 INFO L175 Difference]: Start difference. First operand has 341 places, 357 transitions, 734 flow. Second operand 3 states and 984 transitions. [2025-02-08 05:09:27,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 337 transitions, 742 flow [2025-02-08 05:09:27,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 337 transitions, 742 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:27,425 INFO L231 Difference]: Finished difference. Result has 337 places, 329 transitions, 680 flow [2025-02-08 05:09:27,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=337, PETRI_TRANSITIONS=329} [2025-02-08 05:09:27,429 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -4 predicate places. [2025-02-08 05:09:27,429 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 329 transitions, 680 flow [2025-02-08 05:09:27,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:27,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:27,430 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] [2025-02-08 05:09:27,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:09:27,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:27,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:27,433 INFO L85 PathProgramCache]: Analyzing trace with hash -99109407, now seen corresponding path program 1 times [2025-02-08 05:09:27,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:27,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775275606] [2025-02-08 05:09:27,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:27,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:27,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:09:27,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:09:27,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:27,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:27,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:27,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775275606] [2025-02-08 05:09:27,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775275606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:27,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:27,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:27,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464149845] [2025-02-08 05:09:27,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:27,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:27,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:27,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:27,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 357 [2025-02-08 05:09:27,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 329 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:27,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:27,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 357 [2025-02-08 05:09:27,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:27,847 INFO L124 PetriNetUnfolderBase]: 120/2428 cut-off events. [2025-02-08 05:09:27,848 INFO L125 PetriNetUnfolderBase]: For 242/302 co-relation queries the response was YES. [2025-02-08 05:09:27,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 2428 events. 120/2428 cut-off events. For 242/302 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 18362 event pairs, 84 based on Foata normal form. 0/2035 useless extension candidates. Maximal degree in co-relation 1341. Up to 113 conditions per place. [2025-02-08 05:09:27,865 INFO L140 encePairwiseOnDemand]: 355/357 looper letters, 31 selfloop transitions, 1 changer transitions 0/343 dead transitions. [2025-02-08 05:09:27,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 343 transitions, 790 flow [2025-02-08 05:09:27,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2025-02-08 05:09:27,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938375350140056 [2025-02-08 05:09:27,870 INFO L175 Difference]: Start difference. First operand has 337 places, 329 transitions, 680 flow. Second operand 3 states and 1005 transitions. [2025-02-08 05:09:27,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 343 transitions, 790 flow [2025-02-08 05:09:27,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 343 transitions, 789 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:27,875 INFO L231 Difference]: Finished difference. Result has 329 places, 328 transitions, 679 flow [2025-02-08 05:09:27,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=329, PETRI_TRANSITIONS=328} [2025-02-08 05:09:27,875 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -12 predicate places. [2025-02-08 05:09:27,875 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 328 transitions, 679 flow [2025-02-08 05:09:27,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:27,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:27,876 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] [2025-02-08 05:09:27,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:09:27,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:27,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1222706418, now seen corresponding path program 1 times [2025-02-08 05:09:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:27,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564619293] [2025-02-08 05:09:27,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:27,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:27,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:09:27,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:09:27,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:27,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:27,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:27,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564619293] [2025-02-08 05:09:27,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564619293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:27,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:27,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:27,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555817806] [2025-02-08 05:09:27,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:27,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:27,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:27,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:27,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 357 [2025-02-08 05:09:27,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 328 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:27,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:27,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 357 [2025-02-08 05:09:27,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:28,336 INFO L124 PetriNetUnfolderBase]: 544/3303 cut-off events. [2025-02-08 05:09:28,337 INFO L125 PetriNetUnfolderBase]: For 266/326 co-relation queries the response was YES. [2025-02-08 05:09:28,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4410 conditions, 3303 events. 544/3303 cut-off events. For 266/326 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 27086 event pairs, 116 based on Foata normal form. 5/2913 useless extension candidates. Maximal degree in co-relation 2202. Up to 785 conditions per place. [2025-02-08 05:09:28,359 INFO L140 encePairwiseOnDemand]: 341/357 looper letters, 33 selfloop transitions, 5 changer transitions 11/335 dead transitions. [2025-02-08 05:09:28,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 335 transitions, 785 flow [2025-02-08 05:09:28,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2025-02-08 05:09:28,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.896358543417367 [2025-02-08 05:09:28,362 INFO L175 Difference]: Start difference. First operand has 329 places, 328 transitions, 679 flow. Second operand 3 states and 960 transitions. [2025-02-08 05:09:28,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 335 transitions, 785 flow [2025-02-08 05:09:28,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 335 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:28,368 INFO L231 Difference]: Finished difference. Result has 323 places, 313 transitions, 667 flow [2025-02-08 05:09:28,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=667, PETRI_PLACES=323, PETRI_TRANSITIONS=313} [2025-02-08 05:09:28,369 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -18 predicate places. [2025-02-08 05:09:28,369 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 313 transitions, 667 flow [2025-02-08 05:09:28,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:28,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:28,370 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] [2025-02-08 05:09:28,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:09:28,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:28,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash 365192125, now seen corresponding path program 1 times [2025-02-08 05:09:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:28,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227707202] [2025-02-08 05:09:28,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:28,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:09:28,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:09:28,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:28,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227707202] [2025-02-08 05:09:28,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227707202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:28,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:28,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745088080] [2025-02-08 05:09:28,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:28,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:28,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:28,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:28,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 357 [2025-02-08 05:09:28,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 313 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:28,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:28,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 357 [2025-02-08 05:09:28,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:28,815 INFO L124 PetriNetUnfolderBase]: 644/5442 cut-off events. [2025-02-08 05:09:28,815 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-02-08 05:09:28,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6763 conditions, 5442 events. 644/5442 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 52906 event pairs, 548 based on Foata normal form. 0/4586 useless extension candidates. Maximal degree in co-relation 6140. Up to 1038 conditions per place. [2025-02-08 05:09:28,844 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 23 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-02-08 05:09:28,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 711 flow [2025-02-08 05:09:28,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-02-08 05:09:28,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9066293183940243 [2025-02-08 05:09:28,847 INFO L175 Difference]: Start difference. First operand has 323 places, 313 transitions, 667 flow. Second operand 3 states and 971 transitions. [2025-02-08 05:09:28,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 711 flow [2025-02-08 05:09:28,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 310 transitions, 711 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:28,851 INFO L231 Difference]: Finished difference. Result has 313 places, 310 transitions, 669 flow [2025-02-08 05:09:28,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=313, PETRI_TRANSITIONS=310} [2025-02-08 05:09:28,852 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -28 predicate places. [2025-02-08 05:09:28,852 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 310 transitions, 669 flow [2025-02-08 05:09:28,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:28,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:28,853 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] [2025-02-08 05:09:28,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:09:28,853 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:28,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:28,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1101045817, now seen corresponding path program 1 times [2025-02-08 05:09:28,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:28,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378855116] [2025-02-08 05:09:28,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:28,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:28,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 05:09:28,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 05:09:28,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:28,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:28,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378855116] [2025-02-08 05:09:28,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378855116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:28,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:28,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743276440] [2025-02-08 05:09:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:28,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:28,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:28,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:28,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:28,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 357 [2025-02-08 05:09:28,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 310 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:28,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:28,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 357 [2025-02-08 05:09:28,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:29,291 INFO L124 PetriNetUnfolderBase]: 396/3957 cut-off events. [2025-02-08 05:09:29,294 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-02-08 05:09:29,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 3957 events. 396/3957 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 36212 event pairs, 324 based on Foata normal form. 0/3350 useless extension candidates. Maximal degree in co-relation 4413. Up to 666 conditions per place. [2025-02-08 05:09:29,316 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 23 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-02-08 05:09:29,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 309 transitions, 717 flow [2025-02-08 05:09:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 974 transitions. [2025-02-08 05:09:29,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9094304388422035 [2025-02-08 05:09:29,320 INFO L175 Difference]: Start difference. First operand has 313 places, 310 transitions, 669 flow. Second operand 3 states and 974 transitions. [2025-02-08 05:09:29,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 309 transitions, 717 flow [2025-02-08 05:09:29,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 309 transitions, 717 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:29,326 INFO L231 Difference]: Finished difference. Result has 314 places, 309 transitions, 671 flow [2025-02-08 05:09:29,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=671, PETRI_PLACES=314, PETRI_TRANSITIONS=309} [2025-02-08 05:09:29,328 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -27 predicate places. [2025-02-08 05:09:29,328 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 309 transitions, 671 flow [2025-02-08 05:09:29,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:29,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:29,329 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] [2025-02-08 05:09:29,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:09:29,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:29,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1703913795, now seen corresponding path program 1 times [2025-02-08 05:09:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446889381] [2025-02-08 05:09:29,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:29,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:09:29,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:09:29,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:29,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:29,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:29,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446889381] [2025-02-08 05:09:29,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446889381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:29,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:29,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:09:29,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599100900] [2025-02-08 05:09:29,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:29,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:29,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:29,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:29,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:29,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 357 [2025-02-08 05:09:29,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 309 transitions, 671 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:29,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:29,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 357 [2025-02-08 05:09:29,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:29,700 INFO L124 PetriNetUnfolderBase]: 260/3163 cut-off events. [2025-02-08 05:09:29,700 INFO L125 PetriNetUnfolderBase]: For 242/302 co-relation queries the response was YES. [2025-02-08 05:09:29,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 3163 events. 260/3163 cut-off events. For 242/302 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 27464 event pairs, 200 based on Foata normal form. 2/2672 useless extension candidates. Maximal degree in co-relation 3465. Up to 444 conditions per place. [2025-02-08 05:09:29,719 INFO L140 encePairwiseOnDemand]: 355/357 looper letters, 22 selfloop transitions, 0 changer transitions 1/308 dead transitions. [2025-02-08 05:09:29,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 308 transitions, 712 flow [2025-02-08 05:09:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2025-02-08 05:09:29,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9103641456582633 [2025-02-08 05:09:29,721 INFO L175 Difference]: Start difference. First operand has 314 places, 309 transitions, 671 flow. Second operand 3 states and 975 transitions. [2025-02-08 05:09:29,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 308 transitions, 712 flow [2025-02-08 05:09:29,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 308 transitions, 704 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 05:09:29,725 INFO L231 Difference]: Finished difference. Result has 313 places, 307 transitions, 658 flow [2025-02-08 05:09:29,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=313, PETRI_TRANSITIONS=307} [2025-02-08 05:09:29,727 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -28 predicate places. [2025-02-08 05:09:29,727 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 307 transitions, 658 flow [2025-02-08 05:09:29,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:29,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:29,728 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] [2025-02-08 05:09:29,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:09:29,728 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:29,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:29,728 INFO L85 PathProgramCache]: Analyzing trace with hash 448268964, now seen corresponding path program 1 times [2025-02-08 05:09:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:29,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541836093] [2025-02-08 05:09:29,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:29,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:09:29,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:09:29,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:29,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:29,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:29,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541836093] [2025-02-08 05:09:29,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541836093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:29,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:29,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:29,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467945660] [2025-02-08 05:09:29,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:29,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:29,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:29,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:29,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:29,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 357 [2025-02-08 05:09:29,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 307 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:29,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:29,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 357 [2025-02-08 05:09:29,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:30,005 INFO L124 PetriNetUnfolderBase]: 122/2376 cut-off events. [2025-02-08 05:09:30,005 INFO L125 PetriNetUnfolderBase]: For 242/302 co-relation queries the response was YES. [2025-02-08 05:09:30,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2794 conditions, 2376 events. 122/2376 cut-off events. For 242/302 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 17949 event pairs, 84 based on Foata normal form. 0/2064 useless extension candidates. Maximal degree in co-relation 2787. Up to 113 conditions per place. [2025-02-08 05:09:30,015 INFO L140 encePairwiseOnDemand]: 355/357 looper letters, 31 selfloop transitions, 1 changer transitions 0/321 dead transitions. [2025-02-08 05:09:30,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 321 transitions, 768 flow [2025-02-08 05:09:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2025-02-08 05:09:30,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938375350140056 [2025-02-08 05:09:30,018 INFO L175 Difference]: Start difference. First operand has 313 places, 307 transitions, 658 flow. Second operand 3 states and 1005 transitions. [2025-02-08 05:09:30,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 321 transitions, 768 flow [2025-02-08 05:09:30,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 321 transitions, 766 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:30,022 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 656 flow [2025-02-08 05:09:30,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2025-02-08 05:09:30,023 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -29 predicate places. [2025-02-08 05:09:30,023 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 656 flow [2025-02-08 05:09:30,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:30,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:30,023 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] [2025-02-08 05:09:30,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:09:30,024 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:30,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash -788732747, now seen corresponding path program 1 times [2025-02-08 05:09:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:30,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960611768] [2025-02-08 05:09:30,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:30,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:30,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:09:30,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:09:30,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:30,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:30,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960611768] [2025-02-08 05:09:30,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960611768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:30,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:30,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:30,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501934250] [2025-02-08 05:09:30,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:30,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:30,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:30,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:30,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:30,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 357 [2025-02-08 05:09:30,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:30,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:30,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 357 [2025-02-08 05:09:30,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:30,403 INFO L124 PetriNetUnfolderBase]: 488/4220 cut-off events. [2025-02-08 05:09:30,404 INFO L125 PetriNetUnfolderBase]: For 390/534 co-relation queries the response was YES. [2025-02-08 05:09:30,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5330 conditions, 4220 events. 488/4220 cut-off events. For 390/534 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 39624 event pairs, 412 based on Foata normal form. 0/3506 useless extension candidates. Maximal degree in co-relation 5323. Up to 830 conditions per place. [2025-02-08 05:09:30,494 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 25 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2025-02-08 05:09:30,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 305 transitions, 708 flow [2025-02-08 05:09:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-02-08 05:09:30,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9056956115779645 [2025-02-08 05:09:30,498 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 656 flow. Second operand 3 states and 970 transitions. [2025-02-08 05:09:30,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 305 transitions, 708 flow [2025-02-08 05:09:30,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 305 transitions, 707 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:30,505 INFO L231 Difference]: Finished difference. Result has 312 places, 305 transitions, 657 flow [2025-02-08 05:09:30,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=312, PETRI_TRANSITIONS=305} [2025-02-08 05:09:30,506 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -29 predicate places. [2025-02-08 05:09:30,507 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 305 transitions, 657 flow [2025-02-08 05:09:30,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:30,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:30,508 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] [2025-02-08 05:09:30,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:09:30,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:30,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash 495335272, now seen corresponding path program 1 times [2025-02-08 05:09:30,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:30,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300884442] [2025-02-08 05:09:30,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:30,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:30,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 05:09:30,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 05:09:30,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:30,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:30,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:30,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300884442] [2025-02-08 05:09:30,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300884442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:30,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:30,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:30,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550494703] [2025-02-08 05:09:30,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:30,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:30,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:30,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:30,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:30,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 357 [2025-02-08 05:09:30,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 305 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:30,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:30,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 357 [2025-02-08 05:09:30,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:30,877 INFO L124 PetriNetUnfolderBase]: 514/4563 cut-off events. [2025-02-08 05:09:30,878 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-02-08 05:09:30,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5667 conditions, 4563 events. 514/4563 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 43542 event pairs, 432 based on Foata normal form. 0/3846 useless extension candidates. Maximal degree in co-relation 5660. Up to 836 conditions per place. [2025-02-08 05:09:30,983 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 23 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-02-08 05:09:30,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 304 transitions, 705 flow [2025-02-08 05:09:30,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 974 transitions. [2025-02-08 05:09:30,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9094304388422035 [2025-02-08 05:09:30,986 INFO L175 Difference]: Start difference. First operand has 312 places, 305 transitions, 657 flow. Second operand 3 states and 974 transitions. [2025-02-08 05:09:30,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 304 transitions, 705 flow [2025-02-08 05:09:30,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 304 transitions, 701 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:30,989 INFO L231 Difference]: Finished difference. Result has 311 places, 304 transitions, 655 flow [2025-02-08 05:09:30,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=311, PETRI_TRANSITIONS=304} [2025-02-08 05:09:30,990 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -30 predicate places. [2025-02-08 05:09:30,991 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 304 transitions, 655 flow [2025-02-08 05:09:30,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:30,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:30,991 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] [2025-02-08 05:09:30,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:09:30,991 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:30,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash 414725569, now seen corresponding path program 1 times [2025-02-08 05:09:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:30,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724756603] [2025-02-08 05:09:30,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:30,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:09:30,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:09:30,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:30,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:31,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:31,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724756603] [2025-02-08 05:09:31,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724756603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:31,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:31,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:31,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402522286] [2025-02-08 05:09:31,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:31,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:31,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:31,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:31,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:31,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 357 [2025-02-08 05:09:31,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 304 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:31,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:31,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 357 [2025-02-08 05:09:31,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:31,343 INFO L124 PetriNetUnfolderBase]: 440/3867 cut-off events. [2025-02-08 05:09:31,344 INFO L125 PetriNetUnfolderBase]: For 310/386 co-relation queries the response was YES. [2025-02-08 05:09:31,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4885 conditions, 3867 events. 440/3867 cut-off events. For 310/386 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 35943 event pairs, 368 based on Foata normal form. 0/3282 useless extension candidates. Maximal degree in co-relation 4878. Up to 748 conditions per place. [2025-02-08 05:09:31,366 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 24 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2025-02-08 05:09:31,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 303 transitions, 705 flow [2025-02-08 05:09:31,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2025-02-08 05:09:31,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.907563025210084 [2025-02-08 05:09:31,368 INFO L175 Difference]: Start difference. First operand has 311 places, 304 transitions, 655 flow. Second operand 3 states and 972 transitions. [2025-02-08 05:09:31,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 303 transitions, 705 flow [2025-02-08 05:09:31,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 303 transitions, 701 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:31,372 INFO L231 Difference]: Finished difference. Result has 310 places, 303 transitions, 653 flow [2025-02-08 05:09:31,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=310, PETRI_TRANSITIONS=303} [2025-02-08 05:09:31,373 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -31 predicate places. [2025-02-08 05:09:31,373 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 303 transitions, 653 flow [2025-02-08 05:09:31,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:31,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:31,373 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] [2025-02-08 05:09:31,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:09:31,374 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:31,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash -210011069, now seen corresponding path program 1 times [2025-02-08 05:09:31,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:31,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372998324] [2025-02-08 05:09:31,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:31,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:09:31,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:09:31,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:31,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:31,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:31,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372998324] [2025-02-08 05:09:31,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372998324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:31,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:31,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:31,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660980166] [2025-02-08 05:09:31,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:31,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:31,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:31,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:31,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 357 [2025-02-08 05:09:31,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 303 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:31,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:31,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 357 [2025-02-08 05:09:31,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:31,830 INFO L124 PetriNetUnfolderBase]: 362/4085 cut-off events. [2025-02-08 05:09:31,830 INFO L125 PetriNetUnfolderBase]: For 594/1586 co-relation queries the response was YES. [2025-02-08 05:09:31,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5110 conditions, 4085 events. 362/4085 cut-off events. For 594/1586 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 37581 event pairs, 268 based on Foata normal form. 0/3580 useless extension candidates. Maximal degree in co-relation 5103. Up to 630 conditions per place. [2025-02-08 05:09:31,855 INFO L140 encePairwiseOnDemand]: 350/357 looper letters, 27 selfloop transitions, 1 changer transitions 0/297 dead transitions. [2025-02-08 05:09:31,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 297 transitions, 697 flow [2025-02-08 05:09:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2025-02-08 05:09:31,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944911297852475 [2025-02-08 05:09:31,858 INFO L175 Difference]: Start difference. First operand has 310 places, 303 transitions, 653 flow. Second operand 3 states and 958 transitions. [2025-02-08 05:09:31,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 297 transitions, 697 flow [2025-02-08 05:09:31,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 297 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:31,862 INFO L231 Difference]: Finished difference. Result has 304 places, 297 transitions, 639 flow [2025-02-08 05:09:31,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=304, PETRI_TRANSITIONS=297} [2025-02-08 05:09:31,863 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -37 predicate places. [2025-02-08 05:09:31,863 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 297 transitions, 639 flow [2025-02-08 05:09:31,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:31,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:31,863 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] [2025-02-08 05:09:31,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:09:31,864 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:31,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash 749386990, now seen corresponding path program 1 times [2025-02-08 05:09:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:31,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969224526] [2025-02-08 05:09:31,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:31,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:09:31,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:09:31,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:31,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:31,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:31,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969224526] [2025-02-08 05:09:31,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969224526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:31,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:31,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889458979] [2025-02-08 05:09:31,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:31,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:31,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:31,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:31,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:31,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 357 [2025-02-08 05:09:31,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 297 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:31,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:31,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 357 [2025-02-08 05:09:31,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:32,346 INFO L124 PetriNetUnfolderBase]: 322/3123 cut-off events. [2025-02-08 05:09:32,347 INFO L125 PetriNetUnfolderBase]: For 494/594 co-relation queries the response was YES. [2025-02-08 05:09:32,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4066 conditions, 3123 events. 322/3123 cut-off events. For 494/594 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 25942 event pairs, 228 based on Foata normal form. 0/2820 useless extension candidates. Maximal degree in co-relation 4059. Up to 574 conditions per place. [2025-02-08 05:09:32,368 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 25 selfloop transitions, 1 changer transitions 0/292 dead transitions. [2025-02-08 05:09:32,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 292 transitions, 681 flow [2025-02-08 05:09:32,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-02-08 05:09:32,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900093370681606 [2025-02-08 05:09:32,375 INFO L175 Difference]: Start difference. First operand has 304 places, 297 transitions, 639 flow. Second operand 3 states and 964 transitions. [2025-02-08 05:09:32,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 292 transitions, 681 flow [2025-02-08 05:09:32,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 292 transitions, 680 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:32,382 INFO L231 Difference]: Finished difference. Result has 300 places, 292 transitions, 630 flow [2025-02-08 05:09:32,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=300, PETRI_TRANSITIONS=292} [2025-02-08 05:09:32,383 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -41 predicate places. [2025-02-08 05:09:32,383 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 292 transitions, 630 flow [2025-02-08 05:09:32,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:32,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:32,386 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] [2025-02-08 05:09:32,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:09:32,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:32,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash -337902126, now seen corresponding path program 1 times [2025-02-08 05:09:32,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:32,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628187910] [2025-02-08 05:09:32,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:32,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:32,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:09:32,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:09:32,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:32,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:32,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:32,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628187910] [2025-02-08 05:09:32,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628187910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:32,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:32,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:09:32,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245746846] [2025-02-08 05:09:32,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:32,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:09:32,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:32,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:09:32,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:09:33,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 357 [2025-02-08 05:09:33,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 292 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 293.6666666666667) internal successors, (1762), 6 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:33,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:33,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 357 [2025-02-08 05:09:33,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:34,058 INFO L124 PetriNetUnfolderBase]: 2566/14595 cut-off events. [2025-02-08 05:09:34,058 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-02-08 05:09:34,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19374 conditions, 14595 events. 2566/14595 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 176886 event pairs, 1956 based on Foata normal form. 0/13200 useless extension candidates. Maximal degree in co-relation 19367. Up to 3973 conditions per place. [2025-02-08 05:09:34,104 INFO L140 encePairwiseOnDemand]: 350/357 looper letters, 59 selfloop transitions, 6 changer transitions 0/307 dead transitions. [2025-02-08 05:09:34,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 307 transitions, 790 flow [2025-02-08 05:09:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:09:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:09:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1818 transitions. [2025-02-08 05:09:34,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487394957983193 [2025-02-08 05:09:34,107 INFO L175 Difference]: Start difference. First operand has 300 places, 292 transitions, 630 flow. Second operand 6 states and 1818 transitions. [2025-02-08 05:09:34,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 307 transitions, 790 flow [2025-02-08 05:09:34,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 307 transitions, 789 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:34,112 INFO L231 Difference]: Finished difference. Result has 303 places, 291 transitions, 639 flow [2025-02-08 05:09:34,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=303, PETRI_TRANSITIONS=291} [2025-02-08 05:09:34,113 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -38 predicate places. [2025-02-08 05:09:34,113 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 291 transitions, 639 flow [2025-02-08 05:09:34,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.6666666666667) internal successors, (1762), 6 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:34,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:34,114 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] [2025-02-08 05:09:34,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:09:34,114 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:34,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:34,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2100778846, now seen corresponding path program 1 times [2025-02-08 05:09:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227726990] [2025-02-08 05:09:34,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:34,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 05:09:34,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 05:09:34,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:34,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:34,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:34,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227726990] [2025-02-08 05:09:34,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227726990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:34,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:34,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:09:34,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581877917] [2025-02-08 05:09:34,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:34,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:09:34,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:34,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:09:34,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:09:34,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 357 [2025-02-08 05:09:34,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 291 transitions, 639 flow. Second operand has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:34,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:34,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 357 [2025-02-08 05:09:34,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:34,577 INFO L124 PetriNetUnfolderBase]: 610/4941 cut-off events. [2025-02-08 05:09:34,577 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-02-08 05:09:34,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6270 conditions, 4941 events. 610/4941 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 47127 event pairs, 437 based on Foata normal form. 36/4498 useless extension candidates. Maximal degree in co-relation 6263. Up to 673 conditions per place. [2025-02-08 05:09:34,596 INFO L140 encePairwiseOnDemand]: 344/357 looper letters, 58 selfloop transitions, 11 changer transitions 1/331 dead transitions. [2025-02-08 05:09:34,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 331 transitions, 883 flow [2025-02-08 05:09:34,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:09:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:09:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1320 transitions. [2025-02-08 05:09:34,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243697478991597 [2025-02-08 05:09:34,599 INFO L175 Difference]: Start difference. First operand has 303 places, 291 transitions, 639 flow. Second operand 4 states and 1320 transitions. [2025-02-08 05:09:34,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 331 transitions, 883 flow [2025-02-08 05:09:34,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 331 transitions, 871 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:09:34,603 INFO L231 Difference]: Finished difference. Result has 303 places, 300 transitions, 709 flow [2025-02-08 05:09:34,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=709, PETRI_PLACES=303, PETRI_TRANSITIONS=300} [2025-02-08 05:09:34,605 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -38 predicate places. [2025-02-08 05:09:34,605 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 300 transitions, 709 flow [2025-02-08 05:09:34,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:34,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:34,606 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] [2025-02-08 05:09:34,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:09:34,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting funcAErr5ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:34,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:34,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1090696756, now seen corresponding path program 1 times [2025-02-08 05:09:34,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:34,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50159690] [2025-02-08 05:09:34,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:34,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:34,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:09:34,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:09:34,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:34,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:34,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50159690] [2025-02-08 05:09:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50159690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:34,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:34,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259039222] [2025-02-08 05:09:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:34,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:34,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:34,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:34,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 357 [2025-02-08 05:09:34,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 300 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:34,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:34,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 357 [2025-02-08 05:09:34,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:34,994 INFO L124 PetriNetUnfolderBase]: 268/2934 cut-off events. [2025-02-08 05:09:34,994 INFO L125 PetriNetUnfolderBase]: For 414/669 co-relation queries the response was YES. [2025-02-08 05:09:35,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 2934 events. 268/2934 cut-off events. For 414/669 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24343 event pairs, 166 based on Foata normal form. 0/2662 useless extension candidates. Maximal degree in co-relation 3888. Up to 443 conditions per place. [2025-02-08 05:09:35,007 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 30 selfloop transitions, 5 changer transitions 0/312 dead transitions. [2025-02-08 05:09:35,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 312 transitions, 812 flow [2025-02-08 05:09:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2025-02-08 05:09:35,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927170868347339 [2025-02-08 05:09:35,010 INFO L175 Difference]: Start difference. First operand has 303 places, 300 transitions, 709 flow. Second operand 3 states and 993 transitions. [2025-02-08 05:09:35,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 312 transitions, 812 flow [2025-02-08 05:09:35,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 312 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:35,017 INFO L231 Difference]: Finished difference. Result has 306 places, 304 transitions, 745 flow [2025-02-08 05:09:35,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=306, PETRI_TRANSITIONS=304} [2025-02-08 05:09:35,018 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -35 predicate places. [2025-02-08 05:09:35,018 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 304 transitions, 745 flow [2025-02-08 05:09:35,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:35,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:35,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:35,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:09:35,019 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting funcAErr2ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:35,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1385046391, now seen corresponding path program 1 times [2025-02-08 05:09:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:35,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593550850] [2025-02-08 05:09:35,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:35,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:09:35,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:09:35,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:35,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:35,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:35,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593550850] [2025-02-08 05:09:35,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593550850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:35,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:35,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:35,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085407072] [2025-02-08 05:09:35,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:35,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:35,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:35,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:35,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:35,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 357 [2025-02-08 05:09:35,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 304 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:35,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:35,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 357 [2025-02-08 05:09:35,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:35,614 INFO L124 PetriNetUnfolderBase]: 355/4187 cut-off events. [2025-02-08 05:09:35,614 INFO L125 PetriNetUnfolderBase]: For 684/1252 co-relation queries the response was YES. [2025-02-08 05:09:35,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5686 conditions, 4187 events. 355/4187 cut-off events. For 684/1252 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 40590 event pairs, 93 based on Foata normal form. 2/3860 useless extension candidates. Maximal degree in co-relation 5676. Up to 507 conditions per place. [2025-02-08 05:09:35,639 INFO L140 encePairwiseOnDemand]: 348/357 looper letters, 36 selfloop transitions, 8 changer transitions 0/321 dead transitions. [2025-02-08 05:09:35,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 321 transitions, 888 flow [2025-02-08 05:09:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 995 transitions. [2025-02-08 05:09:35,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9290382819794585 [2025-02-08 05:09:35,641 INFO L175 Difference]: Start difference. First operand has 306 places, 304 transitions, 745 flow. Second operand 3 states and 995 transitions. [2025-02-08 05:09:35,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 321 transitions, 888 flow [2025-02-08 05:09:35,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 321 transitions, 874 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:35,646 INFO L231 Difference]: Finished difference. Result has 307 places, 310 transitions, 805 flow [2025-02-08 05:09:35,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=307, PETRI_TRANSITIONS=310} [2025-02-08 05:09:35,647 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -34 predicate places. [2025-02-08 05:09:35,647 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 310 transitions, 805 flow [2025-02-08 05:09:35,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:35,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:35,648 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:09:35,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:09:35,648 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-08 05:09:35,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:35,648 INFO L85 PathProgramCache]: Analyzing trace with hash 65403678, now seen corresponding path program 1 times [2025-02-08 05:09:35,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:35,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141512769] [2025-02-08 05:09:35,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:35,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:35,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:09:35,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:09:35,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:35,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:09:35,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:09:35,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:09:35,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:09:35,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:35,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:09:35,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:09:35,749 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:09:35,750 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 61 remaining) [2025-02-08 05:09:35,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr6ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2025-02-08 05:09:35,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr5ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2025-02-08 05:09:35,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2025-02-08 05:09:35,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2025-02-08 05:09:35,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2025-02-08 05:09:35,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2025-02-08 05:09:35,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2025-02-08 05:09:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (52 of 61 remaining) [2025-02-08 05:09:35,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (51 of 61 remaining) [2025-02-08 05:09:35,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2025-02-08 05:09:35,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2025-02-08 05:09:35,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2025-02-08 05:09:35,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2025-02-08 05:09:35,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2025-02-08 05:09:35,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2025-02-08 05:09:35,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2025-02-08 05:09:35,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2025-02-08 05:09:35,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2025-02-08 05:09:35,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2025-02-08 05:09:35,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2025-02-08 05:09:35,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2025-02-08 05:09:35,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2025-02-08 05:09:35,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2025-02-08 05:09:35,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr8ASSERT_VIOLATIONDATA_RACE (24 of 61 remaining) [2025-02-08 05:09:35,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr7ASSERT_VIOLATIONDATA_RACE (23 of 61 remaining) [2025-02-08 05:09:35,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (22 of 61 remaining) [2025-02-08 05:09:35,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2025-02-08 05:09:35,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2025-02-08 05:09:35,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2025-02-08 05:09:35,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2025-02-08 05:09:35,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2025-02-08 05:09:35,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2025-02-08 05:09:35,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr6ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2025-02-08 05:09:35,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr5ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2025-02-08 05:09:35,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2025-02-08 05:09:35,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2025-02-08 05:09:35,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2025-02-08 05:09:35,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2025-02-08 05:09:35,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2025-02-08 05:09:35,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr8ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2025-02-08 05:09:35,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr7ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2025-02-08 05:09:35,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2025-02-08 05:09:35,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2025-02-08 05:09:35,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2025-02-08 05:09:35,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2025-02-08 05:09:35,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2025-02-08 05:09:35,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2025-02-08 05:09:35,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2025-02-08 05:09:35,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:09:35,760 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:35,762 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:09:35,762 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:09:35,845 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-02-08 05:09:35,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 458 transitions, 960 flow [2025-02-08 05:09:36,070 INFO L124 PetriNetUnfolderBase]: 163/1958 cut-off events. [2025-02-08 05:09:36,070 INFO L125 PetriNetUnfolderBase]: For 72/74 co-relation queries the response was YES. [2025-02-08 05:09:36,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 1958 events. 163/1958 cut-off events. For 72/74 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 12311 event pairs, 1 based on Foata normal form. 0/1599 useless extension candidates. Maximal degree in co-relation 1163. Up to 32 conditions per place. [2025-02-08 05:09:36,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 439 places, 458 transitions, 960 flow [2025-02-08 05:09:36,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 458 transitions, 960 flow [2025-02-08 05:09:36,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:36,101 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;@512a8b1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:36,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2025-02-08 05:09:36,102 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:36,102 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:09:36,102 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:09:36,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:36,102 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] [2025-02-08 05:09:36,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:09:36,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:36,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2131157501, now seen corresponding path program 1 times [2025-02-08 05:09:36,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:36,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410602036] [2025-02-08 05:09:36,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:36,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:36,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 05:09:36,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 05:09:36,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:36,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:36,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:36,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410602036] [2025-02-08 05:09:36,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410602036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:36,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:36,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:36,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043597800] [2025-02-08 05:09:36,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:36,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:36,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:36,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:36,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:36,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 458 [2025-02-08 05:09:36,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 458 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:36,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:36,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 458 [2025-02-08 05:09:36,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:46,281 INFO L124 PetriNetUnfolderBase]: 18400/85864 cut-off events. [2025-02-08 05:09:46,282 INFO L125 PetriNetUnfolderBase]: For 7767/7767 co-relation queries the response was YES. [2025-02-08 05:09:46,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113081 conditions, 85864 events. 18400/85864 cut-off events. For 7767/7767 co-relation queries the response was YES. Maximal size of possible extension queue 1659. Compared 1311913 event pairs, 16524 based on Foata normal form. 9795/81880 useless extension candidates. Maximal degree in co-relation 87518. Up to 24187 conditions per place. [2025-02-08 05:09:47,039 INFO L140 encePairwiseOnDemand]: 437/458 looper letters, 38 selfloop transitions, 1 changer transitions 8/434 dead transitions. [2025-02-08 05:09:47,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 434 transitions, 990 flow [2025-02-08 05:09:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:47,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1250 transitions. [2025-02-08 05:09:47,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9097525473071325 [2025-02-08 05:09:47,042 INFO L175 Difference]: Start difference. First operand has 439 places, 458 transitions, 960 flow. Second operand 3 states and 1250 transitions. [2025-02-08 05:09:47,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 434 transitions, 990 flow [2025-02-08 05:09:47,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 434 transitions, 990 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:47,058 INFO L231 Difference]: Finished difference. Result has 433 places, 426 transitions, 898 flow [2025-02-08 05:09:47,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=433, PETRI_TRANSITIONS=426} [2025-02-08 05:09:47,059 INFO L279 CegarLoopForPetriNet]: 439 programPoint places, -6 predicate places. [2025-02-08 05:09:47,059 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 426 transitions, 898 flow [2025-02-08 05:09:47,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:47,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:47,059 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] [2025-02-08 05:09:47,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:09:47,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:09:47,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:47,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1641441505, now seen corresponding path program 1 times [2025-02-08 05:09:47,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:47,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412782628] [2025-02-08 05:09:47,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:47,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:47,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:09:47,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:09:47,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:47,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:47,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:47,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412782628] [2025-02-08 05:09:47,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412782628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:47,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:47,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:47,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179824154] [2025-02-08 05:09:47,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:47,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:47,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:47,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:47,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:47,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 458 [2025-02-08 05:09:47,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 426 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:09:47,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:47,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 458 [2025-02-08 05:09:47,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:00,381 INFO L124 PetriNetUnfolderBase]: 15480/93326 cut-off events. [2025-02-08 05:10:00,381 INFO L125 PetriNetUnfolderBase]: For 15606/17112 co-relation queries the response was YES. [2025-02-08 05:10:01,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120191 conditions, 93326 events. 15480/93326 cut-off events. For 15606/17112 co-relation queries the response was YES. Maximal size of possible extension queue 2196. Compared 1536088 event pairs, 13384 based on Foata normal form. 0/79189 useless extension candidates. Maximal degree in co-relation 60064. Up to 10394 conditions per place. [2025-02-08 05:10:01,535 INFO L140 encePairwiseOnDemand]: 456/458 looper letters, 61 selfloop transitions, 1 changer transitions 0/455 dead transitions. [2025-02-08 05:10:01,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 455 transitions, 1120 flow [2025-02-08 05:10:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2025-02-08 05:10:01,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344978165938864 [2025-02-08 05:10:01,538 INFO L175 Difference]: Start difference. First operand has 433 places, 426 transitions, 898 flow. Second operand 3 states and 1284 transitions. [2025-02-08 05:10:01,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 455 transitions, 1120 flow [2025-02-08 05:10:01,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 455 transitions, 1119 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:10:01,584 INFO L231 Difference]: Finished difference. Result has 425 places, 425 transitions, 897 flow [2025-02-08 05:10:01,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=425, PETRI_TRANSITIONS=425} [2025-02-08 05:10:01,588 INFO L279 CegarLoopForPetriNet]: 439 programPoint places, -14 predicate places. [2025-02-08 05:10:01,588 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 425 transitions, 897 flow [2025-02-08 05:10:01,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:01,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:01,589 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] [2025-02-08 05:10:01,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:10:01,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:10:01,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash -654789702, now seen corresponding path program 1 times [2025-02-08 05:10:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028752052] [2025-02-08 05:10:01,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:01,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:10:01,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:10:01,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:01,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:01,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:01,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028752052] [2025-02-08 05:10:01,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028752052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:01,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:01,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:01,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565857480] [2025-02-08 05:10:01,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:01,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:01,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:01,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:01,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:01,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 458 [2025-02-08 05:10:01,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 425 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:01,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:01,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 458 [2025-02-08 05:10:01,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand