./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c -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 a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:01,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:01,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:32:01,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:01,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:01,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:01,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:01,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:01,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:01,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:01,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:01,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:01,660 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:01,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:01,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:01,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:01,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:01,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:01,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:01,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:01,663 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 -> a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a [2025-01-09 21:32:01,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:01,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:01,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:01,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:01,912 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:01,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2025-01-09 21:32:03,016 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d5fc188a/b4d765fcd3864a12bea980f7afc48ee7/FLAGbbd73559e [2025-01-09 21:32:03,276 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:03,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2025-01-09 21:32:03,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d5fc188a/b4d765fcd3864a12bea980f7afc48ee7/FLAGbbd73559e [2025-01-09 21:32:03,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d5fc188a/b4d765fcd3864a12bea980f7afc48ee7 [2025-01-09 21:32:03,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:03,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:03,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:03,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:03,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:03,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f608f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03, skipping insertion in model container [2025-01-09 21:32:03,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:03,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:03,740 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:03,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:03,777 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:03,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03 WrapperNode [2025-01-09 21:32:03,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:03,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:03,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:03,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:03,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,805 INFO L138 Inliner]: procedures = 22, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 305 [2025-01-09 21:32:03,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:03,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:03,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:03,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:03,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:03,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:03,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:03,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:03,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (1/1) ... [2025-01-09 21:32:03,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:03,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:03,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:32:03,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:32:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:03,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:03,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:03,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:32:03,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:32:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-01-09 21:32:03,896 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-01-09 21:32:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-01-09 21:32:03,896 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-01-09 21:32:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:03,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:03,897 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:32:04,032 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:04,034 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:04,385 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:04,385 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:04,405 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:04,405 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:32:04,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:04 BoogieIcfgContainer [2025-01-09 21:32:04,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:04,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:04,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:04,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:04,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:03" (1/3) ... [2025-01-09 21:32:04,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6d984e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:04, skipping insertion in model container [2025-01-09 21:32:04,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:03" (2/3) ... [2025-01-09 21:32:04,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6d984e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:04, skipping insertion in model container [2025-01-09 21:32:04,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:04" (3/3) ... [2025-01-09 21:32:04,413 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2025-01-09 21:32:04,423 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:04,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier-loop.wvr.c that has 7 procedures, 379 locations, 1 initial locations, 4 loop locations, and 24 error locations. [2025-01-09 21:32:04,425 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:04,551 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-01-09 21:32:04,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 408 transitions, 882 flow [2025-01-09 21:32:04,708 INFO L124 PetriNetUnfolderBase]: 22/394 cut-off events. [2025-01-09 21:32:04,709 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:32:04,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 394 events. 22/394 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 925 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 335. Up to 3 conditions per place. [2025-01-09 21:32:04,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 405 places, 408 transitions, 882 flow [2025-01-09 21:32:04,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 377 transitions, 799 flow [2025-01-09 21:32:04,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:04,735 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;@3a8c42e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:04,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-09 21:32:04,742 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:04,742 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2025-01-09 21:32:04,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:04,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:04,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:04,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:04,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1620941756, now seen corresponding path program 1 times [2025-01-09 21:32:04,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:04,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492922135] [2025-01-09 21:32:04,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:04,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:32:04,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:32:04,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:04,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:04,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492922135] [2025-01-09 21:32:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492922135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:04,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:04,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350803366] [2025-01-09 21:32:04,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:04,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:04,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:04,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:04,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2025-01-09 21:32:04,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:04,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:04,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2025-01-09 21:32:04,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:05,230 INFO L124 PetriNetUnfolderBase]: 116/1711 cut-off events. [2025-01-09 21:32:05,231 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-01-09 21:32:05,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1711 events. 116/1711 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12329 event pairs, 56 based on Foata normal form. 157/1625 useless extension candidates. Maximal degree in co-relation 1869. Up to 151 conditions per place. [2025-01-09 21:32:05,249 INFO L140 encePairwiseOnDemand]: 396/412 looper letters, 20 selfloop transitions, 2 changer transitions 1/363 dead transitions. [2025-01-09 21:32:05,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 363 transitions, 815 flow [2025-01-09 21:32:05,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-01-09 21:32:05,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2025-01-09 21:32:05,261 INFO L175 Difference]: Start difference. First operand has 375 places, 377 transitions, 799 flow. Second operand 3 states and 1128 transitions. [2025-01-09 21:32:05,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 363 transitions, 815 flow [2025-01-09 21:32:05,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 363 transitions, 786 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-01-09 21:32:05,271 INFO L231 Difference]: Finished difference. Result has 365 places, 362 transitions, 744 flow [2025-01-09 21:32:05,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=365, PETRI_TRANSITIONS=362} [2025-01-09 21:32:05,276 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -10 predicate places. [2025-01-09 21:32:05,276 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 744 flow [2025-01-09 21:32:05,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:05,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:05,277 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] [2025-01-09 21:32:05,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:05,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:05,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:05,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2027469597, now seen corresponding path program 1 times [2025-01-09 21:32:05,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:05,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300090460] [2025-01-09 21:32:05,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:05,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:05,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:32:05,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:32:05,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:05,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:05,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300090460] [2025-01-09 21:32:05,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300090460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:05,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:05,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:05,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331922981] [2025-01-09 21:32:05,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:05,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:05,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:05,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:05,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2025-01-09 21:32:05,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 362 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:05,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:05,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2025-01-09 21:32:05,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:05,609 INFO L124 PetriNetUnfolderBase]: 116/1709 cut-off events. [2025-01-09 21:32:05,610 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-09 21:32:05,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 1709 events. 116/1709 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11786 event pairs, 56 based on Foata normal form. 0/1464 useless extension candidates. Maximal degree in co-relation 1878. Up to 151 conditions per place. [2025-01-09 21:32:05,633 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2025-01-09 21:32:05,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 786 flow [2025-01-09 21:32:05,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2025-01-09 21:32:05,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2025-01-09 21:32:05,636 INFO L175 Difference]: Start difference. First operand has 365 places, 362 transitions, 744 flow. Second operand 3 states and 1115 transitions. [2025-01-09 21:32:05,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 786 flow [2025-01-09 21:32:05,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 361 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:05,642 INFO L231 Difference]: Finished difference. Result has 363 places, 361 transitions, 742 flow [2025-01-09 21:32:05,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=363, PETRI_TRANSITIONS=361} [2025-01-09 21:32:05,643 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2025-01-09 21:32:05,644 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 361 transitions, 742 flow [2025-01-09 21:32:05,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:05,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:05,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:05,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:05,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:05,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1106190760, now seen corresponding path program 1 times [2025-01-09 21:32:05,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011193720] [2025-01-09 21:32:05,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:05,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:32:05,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:32:05,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:05,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:05,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:05,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011193720] [2025-01-09 21:32:05,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011193720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:05,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:05,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633106571] [2025-01-09 21:32:05,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:05,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:05,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:05,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:05,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2025-01-09 21:32:05,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 361 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:05,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:05,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2025-01-09 21:32:05,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:05,917 INFO L124 PetriNetUnfolderBase]: 116/1156 cut-off events. [2025-01-09 21:32:05,917 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-09 21:32:05,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1156 events. 116/1156 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6967 event pairs, 56 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1318. Up to 163 conditions per place. [2025-01-09 21:32:05,935 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-01-09 21:32:05,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 360 transitions, 784 flow [2025-01-09 21:32:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2025-01-09 21:32:05,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2025-01-09 21:32:05,939 INFO L175 Difference]: Start difference. First operand has 363 places, 361 transitions, 742 flow. Second operand 3 states and 1115 transitions. [2025-01-09 21:32:05,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 360 transitions, 784 flow [2025-01-09 21:32:05,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 360 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:05,948 INFO L231 Difference]: Finished difference. Result has 362 places, 360 transitions, 740 flow [2025-01-09 21:32:05,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=362, PETRI_TRANSITIONS=360} [2025-01-09 21:32:05,949 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2025-01-09 21:32:05,950 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 360 transitions, 740 flow [2025-01-09 21:32:05,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:05,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:05,951 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] [2025-01-09 21:32:05,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:05,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:05,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash -965930030, now seen corresponding path program 1 times [2025-01-09 21:32:05,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:05,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445526516] [2025-01-09 21:32:05,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:05,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:05,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:32:05,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:32:05,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:05,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:06,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:06,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445526516] [2025-01-09 21:32:06,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445526516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:06,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:06,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:06,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457888417] [2025-01-09 21:32:06,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:06,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:06,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:06,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:06,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2025-01-09 21:32:06,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 360 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:06,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:06,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2025-01-09 21:32:06,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:06,263 INFO L124 PetriNetUnfolderBase]: 116/1155 cut-off events. [2025-01-09 21:32:06,266 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-09 21:32:06,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 1155 events. 116/1155 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6840 event pairs, 56 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 1310. Up to 163 conditions per place. [2025-01-09 21:32:06,289 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-01-09 21:32:06,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 359 transitions, 782 flow [2025-01-09 21:32:06,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2025-01-09 21:32:06,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2025-01-09 21:32:06,291 INFO L175 Difference]: Start difference. First operand has 362 places, 360 transitions, 740 flow. Second operand 3 states and 1115 transitions. [2025-01-09 21:32:06,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 359 transitions, 782 flow [2025-01-09 21:32:06,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 359 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:06,295 INFO L231 Difference]: Finished difference. Result has 361 places, 359 transitions, 738 flow [2025-01-09 21:32:06,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=361, PETRI_TRANSITIONS=359} [2025-01-09 21:32:06,296 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -14 predicate places. [2025-01-09 21:32:06,296 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 738 flow [2025-01-09 21:32:06,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:06,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:06,297 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-01-09 21:32:06,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:06,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:06,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash -603121257, now seen corresponding path program 1 times [2025-01-09 21:32:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:06,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960083468] [2025-01-09 21:32:06,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:06,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:32:06,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:32:06,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:06,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:06,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:06,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960083468] [2025-01-09 21:32:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960083468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:06,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:06,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:06,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775746974] [2025-01-09 21:32:06,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:06,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:06,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:06,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:06,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:06,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2025-01-09 21:32:06,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 359 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:06,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:06,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2025-01-09 21:32:06,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:06,521 INFO L124 PetriNetUnfolderBase]: 110/1386 cut-off events. [2025-01-09 21:32:06,522 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-09 21:32:06,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 1386 events. 110/1386 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8900 event pairs, 56 based on Foata normal form. 0/1188 useless extension candidates. Maximal degree in co-relation 1526. Up to 151 conditions per place. [2025-01-09 21:32:06,536 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-01-09 21:32:06,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 358 transitions, 780 flow [2025-01-09 21:32:06,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2025-01-09 21:32:06,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2025-01-09 21:32:06,539 INFO L175 Difference]: Start difference. First operand has 361 places, 359 transitions, 738 flow. Second operand 3 states and 1115 transitions. [2025-01-09 21:32:06,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 358 transitions, 780 flow [2025-01-09 21:32:06,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 358 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:06,542 INFO L231 Difference]: Finished difference. Result has 360 places, 358 transitions, 736 flow [2025-01-09 21:32:06,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=360, PETRI_TRANSITIONS=358} [2025-01-09 21:32:06,543 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -15 predicate places. [2025-01-09 21:32:06,543 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 358 transitions, 736 flow [2025-01-09 21:32:06,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:06,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:06,544 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] [2025-01-09 21:32:06,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:06,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:06,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:06,545 INFO L85 PathProgramCache]: Analyzing trace with hash 680766678, now seen corresponding path program 1 times [2025-01-09 21:32:06,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:06,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796211074] [2025-01-09 21:32:06,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:06,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:06,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:32:06,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:32:06,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:06,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:06,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:06,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796211074] [2025-01-09 21:32:06,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796211074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:06,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:06,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252717953] [2025-01-09 21:32:06,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:06,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:06,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:06,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:06,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:06,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2025-01-09 21:32:06,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 358 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:06,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:06,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2025-01-09 21:32:06,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:06,744 INFO L124 PetriNetUnfolderBase]: 110/1385 cut-off events. [2025-01-09 21:32:06,744 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-09 21:32:06,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 1385 events. 110/1385 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8370 event pairs, 56 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1518. Up to 151 conditions per place. [2025-01-09 21:32:06,758 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-01-09 21:32:06,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 357 transitions, 778 flow [2025-01-09 21:32:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2025-01-09 21:32:06,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2025-01-09 21:32:06,761 INFO L175 Difference]: Start difference. First operand has 360 places, 358 transitions, 736 flow. Second operand 3 states and 1115 transitions. [2025-01-09 21:32:06,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 357 transitions, 778 flow [2025-01-09 21:32:06,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 357 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:06,764 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 734 flow [2025-01-09 21:32:06,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=359, PETRI_TRANSITIONS=357} [2025-01-09 21:32:06,765 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -16 predicate places. [2025-01-09 21:32:06,765 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 734 flow [2025-01-09 21:32:06,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:06,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:06,766 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] [2025-01-09 21:32:06,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:06,766 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:06,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash 797241780, now seen corresponding path program 1 times [2025-01-09 21:32:06,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:06,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397454975] [2025-01-09 21:32:06,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:06,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:06,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:32:06,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:32:06,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:06,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:06,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:06,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397454975] [2025-01-09 21:32:06,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397454975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:06,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:06,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:06,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147268606] [2025-01-09 21:32:06,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:06,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:06,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:06,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:06,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:06,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2025-01-09 21:32:06,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 357 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:06,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:06,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2025-01-09 21:32:06,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:06,899 INFO L124 PetriNetUnfolderBase]: 112/926 cut-off events. [2025-01-09 21:32:06,900 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-01-09 21:32:06,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 926 events. 112/926 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4905 event pairs, 56 based on Foata normal form. 0/793 useless extension candidates. Maximal degree in co-relation 1052. Up to 163 conditions per place. [2025-01-09 21:32:06,909 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2025-01-09 21:32:06,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 356 transitions, 776 flow [2025-01-09 21:32:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2025-01-09 21:32:06,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2025-01-09 21:32:06,911 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 734 flow. Second operand 3 states and 1115 transitions. [2025-01-09 21:32:06,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 356 transitions, 776 flow [2025-01-09 21:32:06,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 356 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:06,914 INFO L231 Difference]: Finished difference. Result has 358 places, 356 transitions, 732 flow [2025-01-09 21:32:06,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=358, PETRI_TRANSITIONS=356} [2025-01-09 21:32:06,915 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2025-01-09 21:32:06,915 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 356 transitions, 732 flow [2025-01-09 21:32:06,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:06,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:06,916 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-01-09 21:32:06,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:06,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:06,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash -589384487, now seen corresponding path program 1 times [2025-01-09 21:32:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:06,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455009939] [2025-01-09 21:32:06,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:06,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:32:06,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:32:06,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:06,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:06,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455009939] [2025-01-09 21:32:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455009939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:06,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119747092] [2025-01-09 21:32:06,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:06,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:06,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:06,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:06,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2025-01-09 21:32:06,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 356 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:06,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:06,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2025-01-09 21:32:06,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:07,045 INFO L124 PetriNetUnfolderBase]: 112/925 cut-off events. [2025-01-09 21:32:07,045 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-01-09 21:32:07,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 925 events. 112/925 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4917 event pairs, 56 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1044. Up to 163 conditions per place. [2025-01-09 21:32:07,054 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2025-01-09 21:32:07,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 355 transitions, 774 flow [2025-01-09 21:32:07,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2025-01-09 21:32:07,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2025-01-09 21:32:07,056 INFO L175 Difference]: Start difference. First operand has 358 places, 356 transitions, 732 flow. Second operand 3 states and 1115 transitions. [2025-01-09 21:32:07,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 355 transitions, 774 flow [2025-01-09 21:32:07,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 355 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:07,081 INFO L231 Difference]: Finished difference. Result has 357 places, 355 transitions, 730 flow [2025-01-09 21:32:07,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=357, PETRI_TRANSITIONS=355} [2025-01-09 21:32:07,082 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -18 predicate places. [2025-01-09 21:32:07,082 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 355 transitions, 730 flow [2025-01-09 21:32:07,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:07,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:07,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:07,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:07,082 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:07,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1636526129, now seen corresponding path program 1 times [2025-01-09 21:32:07,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:07,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466324258] [2025-01-09 21:32:07,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:07,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:07,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:32:07,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:32:07,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:07,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:07,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:07,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466324258] [2025-01-09 21:32:07,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466324258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:07,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:07,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:07,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370787665] [2025-01-09 21:32:07,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:07,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:07,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:07,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:07,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:07,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2025-01-09 21:32:07,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 355 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:07,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:07,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2025-01-09 21:32:07,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:07,349 INFO L124 PetriNetUnfolderBase]: 191/1845 cut-off events. [2025-01-09 21:32:07,350 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:07,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 1845 events. 191/1845 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13704 event pairs, 72 based on Foata normal form. 0/1576 useless extension candidates. Maximal degree in co-relation 2122. Up to 204 conditions per place. [2025-01-09 21:32:07,372 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2025-01-09 21:32:07,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 811 flow [2025-01-09 21:32:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-01-09 21:32:07,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2025-01-09 21:32:07,375 INFO L175 Difference]: Start difference. First operand has 357 places, 355 transitions, 730 flow. Second operand 3 states and 1128 transitions. [2025-01-09 21:32:07,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 811 flow [2025-01-09 21:32:07,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:07,379 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 728 flow [2025-01-09 21:32:07,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=356, PETRI_TRANSITIONS=354} [2025-01-09 21:32:07,380 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2025-01-09 21:32:07,381 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 728 flow [2025-01-09 21:32:07,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:07,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:07,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:07,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:07,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:07,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1577050702, now seen corresponding path program 1 times [2025-01-09 21:32:07,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:07,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668656808] [2025-01-09 21:32:07,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:07,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:07,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 21:32:07,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 21:32:07,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:07,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668656808] [2025-01-09 21:32:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668656808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:07,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:07,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952846146] [2025-01-09 21:32:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:07,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:07,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:07,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:07,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:07,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2025-01-09 21:32:07,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 354 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:07,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:07,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2025-01-09 21:32:07,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:07,738 INFO L124 PetriNetUnfolderBase]: 171/1831 cut-off events. [2025-01-09 21:32:07,739 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-01-09 21:32:07,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 1831 events. 171/1831 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 13513 event pairs, 40 based on Foata normal form. 0/1575 useless extension candidates. Maximal degree in co-relation 1175. Up to 129 conditions per place. [2025-01-09 21:32:07,759 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 31 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-01-09 21:32:07,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 836 flow [2025-01-09 21:32:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2025-01-09 21:32:07,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2025-01-09 21:32:07,762 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 728 flow. Second operand 3 states and 1138 transitions. [2025-01-09 21:32:07,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 836 flow [2025-01-09 21:32:07,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:07,769 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 732 flow [2025-01-09 21:32:07,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=356, PETRI_TRANSITIONS=354} [2025-01-09 21:32:07,770 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2025-01-09 21:32:07,770 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 732 flow [2025-01-09 21:32:07,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:07,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:07,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:07,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:07,771 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:07,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1476346227, now seen corresponding path program 1 times [2025-01-09 21:32:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:07,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920538830] [2025-01-09 21:32:07,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:07,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:32:07,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:32:07,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:07,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:07,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920538830] [2025-01-09 21:32:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920538830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:07,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:07,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672506669] [2025-01-09 21:32:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:07,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:07,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:07,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:07,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2025-01-09 21:32:07,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 354 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:07,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:07,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2025-01-09 21:32:07,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:08,076 INFO L124 PetriNetUnfolderBase]: 362/2143 cut-off events. [2025-01-09 21:32:08,076 INFO L125 PetriNetUnfolderBase]: For 146/152 co-relation queries the response was YES. [2025-01-09 21:32:08,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 2143 events. 362/2143 cut-off events. For 146/152 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 15416 event pairs, 119 based on Foata normal form. 0/1742 useless extension candidates. Maximal degree in co-relation 1935. Up to 364 conditions per place. [2025-01-09 21:32:08,102 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2025-01-09 21:32:08,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 362 transitions, 818 flow [2025-01-09 21:32:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2025-01-09 21:32:08,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2025-01-09 21:32:08,105 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 732 flow. Second operand 3 states and 1129 transitions. [2025-01-09 21:32:08,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 362 transitions, 818 flow [2025-01-09 21:32:08,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:08,108 INFO L231 Difference]: Finished difference. Result has 356 places, 353 transitions, 732 flow [2025-01-09 21:32:08,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=356, PETRI_TRANSITIONS=353} [2025-01-09 21:32:08,109 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2025-01-09 21:32:08,110 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 353 transitions, 732 flow [2025-01-09 21:32:08,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:08,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:08,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:08,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:08,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:08,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:08,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1976516329, now seen corresponding path program 1 times [2025-01-09 21:32:08,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:08,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555607704] [2025-01-09 21:32:08,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:08,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:08,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:32:08,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:32:08,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:08,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:08,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:08,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555607704] [2025-01-09 21:32:08,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555607704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:08,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:08,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:08,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264972213] [2025-01-09 21:32:08,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:08,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:08,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:08,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:08,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:08,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2025-01-09 21:32:08,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 353 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:08,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:08,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2025-01-09 21:32:08,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:08,378 INFO L124 PetriNetUnfolderBase]: 294/1955 cut-off events. [2025-01-09 21:32:08,378 INFO L125 PetriNetUnfolderBase]: For 113/129 co-relation queries the response was YES. [2025-01-09 21:32:08,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 1955 events. 294/1955 cut-off events. For 113/129 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 13299 event pairs, 113 based on Foata normal form. 0/1648 useless extension candidates. Maximal degree in co-relation 2452. Up to 316 conditions per place. [2025-01-09 21:32:08,403 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-01-09 21:32:08,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 360 transitions, 812 flow [2025-01-09 21:32:08,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-01-09 21:32:08,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2025-01-09 21:32:08,405 INFO L175 Difference]: Start difference. First operand has 356 places, 353 transitions, 732 flow. Second operand 3 states and 1128 transitions. [2025-01-09 21:32:08,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 360 transitions, 812 flow [2025-01-09 21:32:08,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 360 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:08,409 INFO L231 Difference]: Finished difference. Result has 355 places, 352 transitions, 730 flow [2025-01-09 21:32:08,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=355, PETRI_TRANSITIONS=352} [2025-01-09 21:32:08,410 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2025-01-09 21:32:08,410 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 352 transitions, 730 flow [2025-01-09 21:32:08,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:08,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:08,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:08,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:08,411 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:08,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1366303740, now seen corresponding path program 1 times [2025-01-09 21:32:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190435749] [2025-01-09 21:32:08,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:08,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 21:32:08,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 21:32:08,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:08,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:08,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:08,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190435749] [2025-01-09 21:32:08,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190435749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:08,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:08,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451047837] [2025-01-09 21:32:08,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:08,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:08,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:08,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:08,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:08,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2025-01-09 21:32:08,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 352 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:08,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:08,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2025-01-09 21:32:08,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:08,708 INFO L124 PetriNetUnfolderBase]: 286/2077 cut-off events. [2025-01-09 21:32:08,708 INFO L125 PetriNetUnfolderBase]: For 127/133 co-relation queries the response was YES. [2025-01-09 21:32:08,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 2077 events. 286/2077 cut-off events. For 127/133 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 14747 event pairs, 65 based on Foata normal form. 0/1745 useless extension candidates. Maximal degree in co-relation 2342. Up to 215 conditions per place. [2025-01-09 21:32:08,725 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2025-01-09 21:32:08,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 364 transitions, 831 flow [2025-01-09 21:32:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2025-01-09 21:32:08,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2025-01-09 21:32:08,727 INFO L175 Difference]: Start difference. First operand has 355 places, 352 transitions, 730 flow. Second operand 3 states and 1137 transitions. [2025-01-09 21:32:08,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 364 transitions, 831 flow [2025-01-09 21:32:08,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 364 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:08,731 INFO L231 Difference]: Finished difference. Result has 355 places, 352 transitions, 734 flow [2025-01-09 21:32:08,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=355, PETRI_TRANSITIONS=352} [2025-01-09 21:32:08,732 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2025-01-09 21:32:08,732 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 352 transitions, 734 flow [2025-01-09 21:32:08,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:08,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:08,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:08,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:32:08,733 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:08,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1602636181, now seen corresponding path program 1 times [2025-01-09 21:32:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:08,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142692609] [2025-01-09 21:32:08,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:08,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 21:32:08,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 21:32:08,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:08,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:08,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:08,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142692609] [2025-01-09 21:32:08,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142692609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:08,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:08,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:08,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334633796] [2025-01-09 21:32:08,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:08,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:08,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:08,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:08,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2025-01-09 21:32:08,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 352 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:08,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:08,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2025-01-09 21:32:08,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:09,082 INFO L124 PetriNetUnfolderBase]: 371/2780 cut-off events. [2025-01-09 21:32:09,082 INFO L125 PetriNetUnfolderBase]: For 165/189 co-relation queries the response was YES. [2025-01-09 21:32:09,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3436 conditions, 2780 events. 371/2780 cut-off events. For 165/189 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 20999 event pairs, 93 based on Foata normal form. 0/2326 useless extension candidates. Maximal degree in co-relation 2472. Up to 295 conditions per place. [2025-01-09 21:32:09,100 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2025-01-09 21:32:09,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 364 transitions, 834 flow [2025-01-09 21:32:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2025-01-09 21:32:09,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2025-01-09 21:32:09,102 INFO L175 Difference]: Start difference. First operand has 355 places, 352 transitions, 734 flow. Second operand 3 states and 1137 transitions. [2025-01-09 21:32:09,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 364 transitions, 834 flow [2025-01-09 21:32:09,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 364 transitions, 832 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:09,106 INFO L231 Difference]: Finished difference. Result has 356 places, 352 transitions, 740 flow [2025-01-09 21:32:09,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=356, PETRI_TRANSITIONS=352} [2025-01-09 21:32:09,106 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2025-01-09 21:32:09,107 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 352 transitions, 740 flow [2025-01-09 21:32:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:09,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:09,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:09,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:32:09,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread6Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:09,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1659433820, now seen corresponding path program 1 times [2025-01-09 21:32:09,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:09,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31380957] [2025-01-09 21:32:09,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:09,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:09,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 21:32:09,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 21:32:09,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:09,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:09,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:09,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31380957] [2025-01-09 21:32:09,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31380957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:09,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:09,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:09,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908728976] [2025-01-09 21:32:09,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:09,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:09,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:09,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:09,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:09,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2025-01-09 21:32:09,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 352 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:09,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:09,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2025-01-09 21:32:09,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:09,501 INFO L124 PetriNetUnfolderBase]: 808/3108 cut-off events. [2025-01-09 21:32:09,501 INFO L125 PetriNetUnfolderBase]: For 423/466 co-relation queries the response was YES. [2025-01-09 21:32:09,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4329 conditions, 3108 events. 808/3108 cut-off events. For 423/466 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 22281 event pairs, 266 based on Foata normal form. 0/2371 useless extension candidates. Maximal degree in co-relation 3189. Up to 797 conditions per place. [2025-01-09 21:32:09,522 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-01-09 21:32:09,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 360 transitions, 825 flow [2025-01-09 21:32:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2025-01-09 21:32:09,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2025-01-09 21:32:09,525 INFO L175 Difference]: Start difference. First operand has 356 places, 352 transitions, 740 flow. Second operand 3 states and 1129 transitions. [2025-01-09 21:32:09,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 360 transitions, 825 flow [2025-01-09 21:32:09,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:09,528 INFO L231 Difference]: Finished difference. Result has 356 places, 351 transitions, 740 flow [2025-01-09 21:32:09,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=356, PETRI_TRANSITIONS=351} [2025-01-09 21:32:09,529 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2025-01-09 21:32:09,529 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 351 transitions, 740 flow [2025-01-09 21:32:09,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:09,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:09,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:09,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:32:09,530 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:09,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash -223287786, now seen corresponding path program 1 times [2025-01-09 21:32:09,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:09,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022243233] [2025-01-09 21:32:09,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:09,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:32:09,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:32:09,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:09,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:09,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:09,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022243233] [2025-01-09 21:32:09,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022243233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:09,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:09,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917680402] [2025-01-09 21:32:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:09,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:09,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:09,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:09,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:09,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2025-01-09 21:32:09,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 351 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:09,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:09,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2025-01-09 21:32:09,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:09,839 INFO L124 PetriNetUnfolderBase]: 368/2573 cut-off events. [2025-01-09 21:32:09,839 INFO L125 PetriNetUnfolderBase]: For 145/224 co-relation queries the response was YES. [2025-01-09 21:32:09,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3338 conditions, 2573 events. 368/2573 cut-off events. For 145/224 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 19667 event pairs, 146 based on Foata normal form. 7/2201 useless extension candidates. Maximal degree in co-relation 3087. Up to 435 conditions per place. [2025-01-09 21:32:09,873 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-01-09 21:32:09,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 821 flow [2025-01-09 21:32:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-01-09 21:32:09,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2025-01-09 21:32:09,876 INFO L175 Difference]: Start difference. First operand has 356 places, 351 transitions, 740 flow. Second operand 3 states and 1128 transitions. [2025-01-09 21:32:09,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 821 flow [2025-01-09 21:32:09,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 817 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:09,880 INFO L231 Difference]: Finished difference. Result has 355 places, 350 transitions, 738 flow [2025-01-09 21:32:09,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=355, PETRI_TRANSITIONS=350} [2025-01-09 21:32:09,881 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2025-01-09 21:32:09,881 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 350 transitions, 738 flow [2025-01-09 21:32:09,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:09,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:09,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:09,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:32:09,882 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread6Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:09,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:09,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1120437064, now seen corresponding path program 1 times [2025-01-09 21:32:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:09,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392903370] [2025-01-09 21:32:09,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:09,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:09,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:32:09,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:32:09,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:09,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:09,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:09,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392903370] [2025-01-09 21:32:09,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392903370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:09,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:09,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:09,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568164086] [2025-01-09 21:32:09,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:09,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:09,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:09,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:09,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:09,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2025-01-09 21:32:09,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 350 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:09,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:09,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2025-01-09 21:32:09,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:10,396 INFO L124 PetriNetUnfolderBase]: 609/3335 cut-off events. [2025-01-09 21:32:10,396 INFO L125 PetriNetUnfolderBase]: For 323/356 co-relation queries the response was YES. [2025-01-09 21:32:10,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 3335 events. 609/3335 cut-off events. For 323/356 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 24931 event pairs, 142 based on Foata normal form. 1/2704 useless extension candidates. Maximal degree in co-relation 3053. Up to 466 conditions per place. [2025-01-09 21:32:10,437 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 29 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2025-01-09 21:32:10,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 361 transitions, 833 flow [2025-01-09 21:32:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-01-09 21:32:10,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2025-01-09 21:32:10,440 INFO L175 Difference]: Start difference. First operand has 355 places, 350 transitions, 738 flow. Second operand 3 states and 1136 transitions. [2025-01-09 21:32:10,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 361 transitions, 833 flow [2025-01-09 21:32:10,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 361 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:10,444 INFO L231 Difference]: Finished difference. Result has 355 places, 350 transitions, 742 flow [2025-01-09 21:32:10,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=355, PETRI_TRANSITIONS=350} [2025-01-09 21:32:10,445 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2025-01-09 21:32:10,445 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 350 transitions, 742 flow [2025-01-09 21:32:10,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:10,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:10,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:10,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:32:10,446 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:10,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:10,447 INFO L85 PathProgramCache]: Analyzing trace with hash 938846204, now seen corresponding path program 1 times [2025-01-09 21:32:10,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:10,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903518076] [2025-01-09 21:32:10,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:10,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:10,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:32:10,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:32:10,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:10,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:10,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:10,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903518076] [2025-01-09 21:32:10,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903518076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:10,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:10,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:10,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692927834] [2025-01-09 21:32:10,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:10,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:10,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:10,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:10,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:10,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2025-01-09 21:32:10,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 350 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:10,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:10,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2025-01-09 21:32:10,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:10,911 INFO L124 PetriNetUnfolderBase]: 406/2971 cut-off events. [2025-01-09 21:32:10,911 INFO L125 PetriNetUnfolderBase]: For 185/263 co-relation queries the response was YES. [2025-01-09 21:32:10,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 2971 events. 406/2971 cut-off events. For 185/263 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 23255 event pairs, 89 based on Foata normal form. 9/2535 useless extension candidates. Maximal degree in co-relation 2914. Up to 299 conditions per place. [2025-01-09 21:32:10,933 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 31 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2025-01-09 21:32:10,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 363 transitions, 848 flow [2025-01-09 21:32:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2025-01-09 21:32:10,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2025-01-09 21:32:10,935 INFO L175 Difference]: Start difference. First operand has 355 places, 350 transitions, 742 flow. Second operand 3 states and 1138 transitions. [2025-01-09 21:32:10,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 363 transitions, 848 flow [2025-01-09 21:32:10,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 363 transitions, 846 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:10,939 INFO L231 Difference]: Finished difference. Result has 356 places, 350 transitions, 748 flow [2025-01-09 21:32:10,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=356, PETRI_TRANSITIONS=350} [2025-01-09 21:32:10,939 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2025-01-09 21:32:10,939 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 350 transitions, 748 flow [2025-01-09 21:32:10,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:10,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:10,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:10,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:32:10,940 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:10,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1353168580, now seen corresponding path program 1 times [2025-01-09 21:32:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:10,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648878668] [2025-01-09 21:32:10,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:10,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:10,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:32:10,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:32:10,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:10,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:10,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648878668] [2025-01-09 21:32:10,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648878668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:10,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:10,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238327020] [2025-01-09 21:32:10,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:10,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:10,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:10,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:10,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:10,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2025-01-09 21:32:10,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 350 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:10,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:10,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2025-01-09 21:32:10,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:11,345 INFO L124 PetriNetUnfolderBase]: 712/3268 cut-off events. [2025-01-09 21:32:11,345 INFO L125 PetriNetUnfolderBase]: For 342/400 co-relation queries the response was YES. [2025-01-09 21:32:11,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4485 conditions, 3268 events. 712/3268 cut-off events. For 342/400 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 25122 event pairs, 245 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 3435. Up to 744 conditions per place. [2025-01-09 21:32:11,392 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-01-09 21:32:11,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 834 flow [2025-01-09 21:32:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2025-01-09 21:32:11,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2025-01-09 21:32:11,394 INFO L175 Difference]: Start difference. First operand has 356 places, 350 transitions, 748 flow. Second operand 3 states and 1129 transitions. [2025-01-09 21:32:11,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 834 flow [2025-01-09 21:32:11,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 358 transitions, 832 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:11,398 INFO L231 Difference]: Finished difference. Result has 356 places, 349 transitions, 748 flow [2025-01-09 21:32:11,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=356, PETRI_TRANSITIONS=349} [2025-01-09 21:32:11,399 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2025-01-09 21:32:11,399 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 349 transitions, 748 flow [2025-01-09 21:32:11,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:11,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:11,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:11,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:32:11,400 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread5Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:11,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1021539955, now seen corresponding path program 1 times [2025-01-09 21:32:11,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:11,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036782672] [2025-01-09 21:32:11,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:11,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:11,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:32:11,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:32:11,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:11,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:11,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:11,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036782672] [2025-01-09 21:32:11,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036782672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:11,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:11,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:11,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372831791] [2025-01-09 21:32:11,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:11,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:11,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:11,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:11,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:11,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2025-01-09 21:32:11,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 349 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:11,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:11,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2025-01-09 21:32:11,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:11,789 INFO L124 PetriNetUnfolderBase]: 528/2946 cut-off events. [2025-01-09 21:32:11,789 INFO L125 PetriNetUnfolderBase]: For 253/389 co-relation queries the response was YES. [2025-01-09 21:32:11,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 2946 events. 528/2946 cut-off events. For 253/389 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 22474 event pairs, 215 based on Foata normal form. 10/2465 useless extension candidates. Maximal degree in co-relation 3009. Up to 610 conditions per place. [2025-01-09 21:32:11,821 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2025-01-09 21:32:11,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 356 transitions, 828 flow [2025-01-09 21:32:11,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-01-09 21:32:11,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2025-01-09 21:32:11,823 INFO L175 Difference]: Start difference. First operand has 356 places, 349 transitions, 748 flow. Second operand 3 states and 1128 transitions. [2025-01-09 21:32:11,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 356 transitions, 828 flow [2025-01-09 21:32:11,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 356 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:11,827 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 746 flow [2025-01-09 21:32:11,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=355, PETRI_TRANSITIONS=348} [2025-01-09 21:32:11,828 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2025-01-09 21:32:11,828 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 746 flow [2025-01-09 21:32:11,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:11,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:11,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:11,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:32:11,829 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:11,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:11,829 INFO L85 PathProgramCache]: Analyzing trace with hash -316888386, now seen corresponding path program 1 times [2025-01-09 21:32:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:11,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824985066] [2025-01-09 21:32:11,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:11,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:11,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 21:32:11,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 21:32:11,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:11,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:11,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:11,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824985066] [2025-01-09 21:32:11,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824985066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:11,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:11,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:11,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394377045] [2025-01-09 21:32:11,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:11,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:11,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:11,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:11,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:11,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2025-01-09 21:32:11,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 348 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:11,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:11,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2025-01-09 21:32:11,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:12,211 INFO L124 PetriNetUnfolderBase]: 542/3039 cut-off events. [2025-01-09 21:32:12,212 INFO L125 PetriNetUnfolderBase]: For 265/311 co-relation queries the response was YES. [2025-01-09 21:32:12,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 3039 events. 542/3039 cut-off events. For 265/311 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 22742 event pairs, 117 based on Foata normal form. 0/2517 useless extension candidates. Maximal degree in co-relation 3073. Up to 399 conditions per place. [2025-01-09 21:32:12,256 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-01-09 21:32:12,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 847 flow [2025-01-09 21:32:12,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2025-01-09 21:32:12,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2025-01-09 21:32:12,258 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 746 flow. Second operand 3 states and 1137 transitions. [2025-01-09 21:32:12,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 847 flow [2025-01-09 21:32:12,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 360 transitions, 843 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:12,262 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 750 flow [2025-01-09 21:32:12,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=355, PETRI_TRANSITIONS=348} [2025-01-09 21:32:12,263 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2025-01-09 21:32:12,263 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 750 flow [2025-01-09 21:32:12,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:12,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:12,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:12,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:32:12,264 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread5Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:12,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1440406444, now seen corresponding path program 1 times [2025-01-09 21:32:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935565539] [2025-01-09 21:32:12,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:12,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 21:32:12,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 21:32:12,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:12,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:12,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:12,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935565539] [2025-01-09 21:32:12,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935565539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:12,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:12,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:12,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763246993] [2025-01-09 21:32:12,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:12,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:12,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:12,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:12,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:12,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2025-01-09 21:32:12,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 348 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:12,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:12,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2025-01-09 21:32:12,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:12,667 INFO L124 PetriNetUnfolderBase]: 433/3160 cut-off events. [2025-01-09 21:32:12,667 INFO L125 PetriNetUnfolderBase]: For 211/327 co-relation queries the response was YES. [2025-01-09 21:32:12,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4036 conditions, 3160 events. 433/3160 cut-off events. For 211/327 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 24576 event pairs, 105 based on Foata normal form. 10/2715 useless extension candidates. Maximal degree in co-relation 3067. Up to 339 conditions per place. [2025-01-09 21:32:12,711 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-01-09 21:32:12,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 850 flow [2025-01-09 21:32:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2025-01-09 21:32:12,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2025-01-09 21:32:12,713 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 750 flow. Second operand 3 states and 1137 transitions. [2025-01-09 21:32:12,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 850 flow [2025-01-09 21:32:12,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 360 transitions, 848 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:12,717 INFO L231 Difference]: Finished difference. Result has 356 places, 348 transitions, 756 flow [2025-01-09 21:32:12,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=356, PETRI_TRANSITIONS=348} [2025-01-09 21:32:12,717 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2025-01-09 21:32:12,717 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 348 transitions, 756 flow [2025-01-09 21:32:12,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:12,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:12,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:12,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:32:12,718 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread6Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:12,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash -615611440, now seen corresponding path program 1 times [2025-01-09 21:32:12,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:12,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759890537] [2025-01-09 21:32:12,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:12,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:12,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:32:12,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:32:12,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:12,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:12,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:12,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759890537] [2025-01-09 21:32:12,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759890537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:12,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:12,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:12,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855245732] [2025-01-09 21:32:12,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:12,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:12,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:12,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:12,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:12,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2025-01-09 21:32:12,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 348 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:12,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:12,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2025-01-09 21:32:12,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:13,223 INFO L124 PetriNetUnfolderBase]: 821/3691 cut-off events. [2025-01-09 21:32:13,223 INFO L125 PetriNetUnfolderBase]: For 443/468 co-relation queries the response was YES. [2025-01-09 21:32:13,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5085 conditions, 3691 events. 821/3691 cut-off events. For 443/468 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 28678 event pairs, 290 based on Foata normal form. 0/2960 useless extension candidates. Maximal degree in co-relation 3609. Up to 836 conditions per place. [2025-01-09 21:32:13,267 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2025-01-09 21:32:13,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 356 transitions, 841 flow [2025-01-09 21:32:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2025-01-09 21:32:13,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2025-01-09 21:32:13,269 INFO L175 Difference]: Start difference. First operand has 356 places, 348 transitions, 756 flow. Second operand 3 states and 1129 transitions. [2025-01-09 21:32:13,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 356 transitions, 841 flow [2025-01-09 21:32:13,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 356 transitions, 839 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:13,273 INFO L231 Difference]: Finished difference. Result has 356 places, 347 transitions, 756 flow [2025-01-09 21:32:13,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=356, PETRI_TRANSITIONS=347} [2025-01-09 21:32:13,274 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2025-01-09 21:32:13,274 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 347 transitions, 756 flow [2025-01-09 21:32:13,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:13,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:13,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:13,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:32:13,275 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread6Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:32:13,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:13,281 INFO L85 PathProgramCache]: Analyzing trace with hash -168953849, now seen corresponding path program 1 times [2025-01-09 21:32:13,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:13,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408762397] [2025-01-09 21:32:13,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:13,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:13,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:32:13,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:32:13,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:13,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:13,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:13,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408762397] [2025-01-09 21:32:13,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408762397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:13,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:13,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26316454] [2025-01-09 21:32:13,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:13,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:13,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:13,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:13,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:13,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2025-01-09 21:32:13,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 347 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:13,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:13,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2025-01-09 21:32:13,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:13,885 INFO L124 PetriNetUnfolderBase]: 609/3532 cut-off events. [2025-01-09 21:32:13,885 INFO L125 PetriNetUnfolderBase]: For 401/426 co-relation queries the response was YES. [2025-01-09 21:32:13,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 3532 events. 609/3532 cut-off events. For 401/426 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 26979 event pairs, 142 based on Foata normal form. 0/2964 useless extension candidates. Maximal degree in co-relation 3375. Up to 466 conditions per place. [2025-01-09 21:32:13,923 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 0 selfloop transitions, 0 changer transitions 358/358 dead transitions. [2025-01-09 21:32:13,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 853 flow [2025-01-09 21:32:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-01-09 21:32:13,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2025-01-09 21:32:13,924 INFO L175 Difference]: Start difference. First operand has 356 places, 347 transitions, 756 flow. Second operand 3 states and 1136 transitions. [2025-01-09 21:32:13,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 853 flow [2025-01-09 21:32:13,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 847 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:13,927 INFO L231 Difference]: Finished difference. Result has 355 places, 0 transitions, 0 flow [2025-01-09 21:32:13,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=355, PETRI_TRANSITIONS=0} [2025-01-09 21:32:13,928 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2025-01-09 21:32:13,928 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 0 transitions, 0 flow [2025-01-09 21:32:13,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:13,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2025-01-09 21:32:13,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork4Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2025-01-09 21:32:13,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2025-01-09 21:32:13,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2025-01-09 21:32:13,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 50 remaining) [2025-01-09 21:32:13,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 50 remaining) [2025-01-09 21:32:13,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2025-01-09 21:32:13,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2025-01-09 21:32:13,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2025-01-09 21:32:13,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2025-01-09 21:32:13,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2025-01-09 21:32:13,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2025-01-09 21:32:13,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2025-01-09 21:32:13,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2025-01-09 21:32:13,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:32:13,936 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-09 21:32:13,940 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:13,940 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:13,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:13 BasicIcfg [2025-01-09 21:32:13,943 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:13,944 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:13,944 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:13,944 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:13,944 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:04" (3/4) ... [2025-01-09 21:32:13,945 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:13,947 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:13,947 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:13,947 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:32:13,948 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:32:13,948 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-01-09 21:32:13,948 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-01-09 21:32:13,950 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 21:32:13,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:13,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:32:13,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:14,035 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:14,035 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:14,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:14,036 INFO L158 Benchmark]: Toolchain (without parser) took 10447.35ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 106.7MB in the beginning and 548.6MB in the end (delta: -441.9MB). Peak memory consumption was 429.6MB. Max. memory is 16.1GB. [2025-01-09 21:32:14,036 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 226.5MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:14,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.58ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:14,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.36ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:14,037 INFO L158 Benchmark]: Boogie Preprocessor took 25.69ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:14,038 INFO L158 Benchmark]: RCFGBuilder took 573.62ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 64.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:32:14,038 INFO L158 Benchmark]: TraceAbstraction took 9536.02ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 64.4MB in the beginning and 556.9MB in the end (delta: -492.5MB). Peak memory consumption was 379.3MB. Max. memory is 16.1GB. [2025-01-09 21:32:14,038 INFO L158 Benchmark]: Witness Printer took 91.44ms. Allocated memory is still 1.0GB. Free memory was 556.9MB in the beginning and 548.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:14,039 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54ms. Allocated memory is still 226.5MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.58ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.36ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.69ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 573.62ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 64.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9536.02ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 64.4MB in the beginning and 556.9MB in the end (delta: -492.5MB). Peak memory consumption was 379.3MB. Max. memory is 16.1GB. * Witness Printer took 91.44ms. Allocated memory is still 1.0GB. Free memory was 556.9MB in the beginning and 548.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 613 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.4s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 574 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1274 IncrementalHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 92 mSDtfsCounter, 1274 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=799occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2988 NumberOfCodeBlocks, 2988 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2964 ConstructedInterpolants, 0 QuantifiedInterpolants, 3012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:14,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE