./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-subst.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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:08,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:08,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:37:08,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:08,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:08,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:08,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:08,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:08,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:08,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:08,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:08,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:08,343 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:08,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:08,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:08,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:08,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:08,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:08,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:08,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:08,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:08,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:08,344 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:08,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:08,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:08,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:08,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:08,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:08,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:08,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:08,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:08,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:08,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:08,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:08,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:08,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:08,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:08,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:08,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:08,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:08,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:08,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:08,346 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2025-02-08 05:37:08,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:08,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:08,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:08,614 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:08,614 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:08,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-02-08 05:37:09,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e9be87d5/c68dd8e4fe454b0cbe548fd8a64eba7c/FLAG343acab78 [2025-02-08 05:37:10,032 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:10,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-02-08 05:37:10,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e9be87d5/c68dd8e4fe454b0cbe548fd8a64eba7c/FLAG343acab78 [2025-02-08 05:37:10,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e9be87d5/c68dd8e4fe454b0cbe548fd8a64eba7c [2025-02-08 05:37:10,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:10,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:10,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:10,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:10,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:10,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e0d264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10, skipping insertion in model container [2025-02-08 05:37:10,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:10,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:10,562 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:10,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:10,615 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:10,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10 WrapperNode [2025-02-08 05:37:10,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:10,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:10,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:10,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:10,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,661 INFO L138 Inliner]: procedures = 25, calls = 33, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 428 [2025-02-08 05:37:10,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:10,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:10,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:10,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:10,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,686 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:10,695 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:10,695 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:10,695 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:10,695 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (1/1) ... [2025-02-08 05:37:10,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:10,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:10,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:37:10,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:37:10,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:10,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:10,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:10,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:10,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:10,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:10,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:10,749 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:10,859 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:10,861 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:11,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54: havoc #t~nondet5#1; [2025-02-08 05:37:11,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-1: havoc #t~ret4#1; [2025-02-08 05:37:11,040 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-2: havoc #t~mem3#1; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-3: assume #race~result_7~0 == #t~nondet5#1; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-3: assume !(#race~result_7~0 == #t~nondet5#1); [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-4: havoc #t~mem2#1; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-5: #race~result_7~0 := #t~nondet5#1; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-6: havoc #t~nondet5#1; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-7: ~result_7~0 := #t~ret4#1; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-11: #t~ret4#1 := minus_#res#1; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume 0 == #race~result_7~0; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume !(0 == #race~result_7~0); [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: ~stop~0#1 := (if 0 == (if 0 != ~result_7~0 then 1 else 0) then 0 else 1); [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: #race~result_7~0 := 0; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~post6#1; [2025-02-08 05:37:11,041 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: ~i~0#1 := 1 + #t~post6#1; [2025-02-08 05:37:11,042 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: #t~post6#1 := ~i~0#1; [2025-02-08 05:37:11,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: assume #race~result_10~0 == #t~nondet13#1; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: assume !(#race~result_10~0 == #t~nondet13#1); [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-4: havoc #t~mem10#1; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-5: #race~result_10~0 := #t~nondet13#1; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-6: havoc #t~nondet13#1; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-7: ~result_10~0 := #t~ret12#1; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret12#1 && #t~ret12#1 <= 2147483647; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-11: #t~ret12#1 := minus_#res#1; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: assume 0 == #race~result_10~0; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: assume !(0 == #race~result_10~0); [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-1: ~stop~1#1 := (if 0 == (if 0 != ~result_10~0 then 1 else 0) then 0 else 1); [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-2: #race~result_10~0 := 0; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~post14#1; [2025-02-08 05:37:11,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: ~i~1#1 := 1 + #t~post14#1; [2025-02-08 05:37:11,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: #t~post14#1 := ~i~1#1; [2025-02-08 05:37:11,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68: havoc #t~nondet13#1; [2025-02-08 05:37:11,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-1: havoc #t~ret12#1; [2025-02-08 05:37:11,147 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-2: havoc #t~mem11#1; [2025-02-08 05:37:11,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: havoc #t~nondet21#1; [2025-02-08 05:37:11,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-1: havoc #t~ret20#1; [2025-02-08 05:37:11,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-2: havoc #t~mem19#1; [2025-02-08 05:37:11,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-3: assume #race~result_13~0 == #t~nondet21#1; [2025-02-08 05:37:11,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-3: assume !(#race~result_13~0 == #t~nondet21#1); [2025-02-08 05:37:11,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-4: havoc #t~mem18#1; [2025-02-08 05:37:11,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-5: #race~result_13~0 := #t~nondet21#1; [2025-02-08 05:37:11,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-6: havoc #t~nondet21#1; [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-7: ~result_13~0 := #t~ret20#1; [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret20#1 && #t~ret20#1 <= 2147483647; [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-11: #t~ret20#1 := minus_#res#1; [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: assume 0 == #race~result_13~0; [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: assume !(0 == #race~result_13~0); [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-1: ~stop~2#1 := (if 0 == (if 0 != ~result_13~0 then 1 else 0) then 0 else 1); [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-2: #race~result_13~0 := 0; [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L84: havoc #t~post22#1; [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L84-1: ~i~2#1 := 1 + #t~post22#1; [2025-02-08 05:37:11,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L84-2: #t~post22#1 := ~i~2#1; [2025-02-08 05:37:11,395 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:11,395 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:11,416 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:11,416 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:11,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:11 BoogieIcfgContainer [2025-02-08 05:37:11,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:11,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:11,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:11,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:11,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:10" (1/3) ... [2025-02-08 05:37:11,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22eb5513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:11, skipping insertion in model container [2025-02-08 05:37:11,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:10" (2/3) ... [2025-02-08 05:37:11,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22eb5513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:11, skipping insertion in model container [2025-02-08 05:37:11,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:11" (3/3) ... [2025-02-08 05:37:11,423 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-02-08 05:37:11,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:11,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 500 locations, 1 initial locations, 6 loop locations, and 47 error locations. [2025-02-08 05:37:11,436 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:11,541 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:11,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 509 places, 523 transitions, 1067 flow [2025-02-08 05:37:11,734 INFO L124 PetriNetUnfolderBase]: 24/520 cut-off events. [2025-02-08 05:37:11,735 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:11,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 520 events. 24/520 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1077 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 391. Up to 2 conditions per place. [2025-02-08 05:37:11,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 509 places, 523 transitions, 1067 flow [2025-02-08 05:37:11,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 488 places, 500 transitions, 1018 flow [2025-02-08 05:37:11,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:11,764 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;@f71246e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:11,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-02-08 05:37:11,772 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:11,773 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2025-02-08 05:37:11,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:11,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:11,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:11,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:11,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash 847228494, now seen corresponding path program 1 times [2025-02-08 05:37:11,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:11,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698761795] [2025-02-08 05:37:11,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:11,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:11,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:37:11,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:37:11,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:11,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:12,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698761795] [2025-02-08 05:37:12,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698761795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050821693] [2025-02-08 05:37:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:12,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:12,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:12,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 433 out of 523 [2025-02-08 05:37:12,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 500 transitions, 1018 flow. Second operand has 6 states, 6 states have (on average 434.5) internal successors, (2607), 6 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:12,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 433 of 523 [2025-02-08 05:37:12,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,155 INFO L124 PetriNetUnfolderBase]: 1530/7462 cut-off events. [2025-02-08 05:37:14,156 INFO L125 PetriNetUnfolderBase]: For 360/362 co-relation queries the response was YES. [2025-02-08 05:37:14,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10209 conditions, 7462 events. 1530/7462 cut-off events. For 360/362 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 78231 event pairs, 1520 based on Foata normal form. 641/7122 useless extension candidates. Maximal degree in co-relation 8961. Up to 2455 conditions per place. [2025-02-08 05:37:14,207 INFO L140 encePairwiseOnDemand]: 489/523 looper letters, 54 selfloop transitions, 15 changer transitions 7/481 dead transitions. [2025-02-08 05:37:14,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 481 transitions, 1118 flow [2025-02-08 05:37:14,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2686 transitions. [2025-02-08 05:37:14,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8559592096876991 [2025-02-08 05:37:14,228 INFO L175 Difference]: Start difference. First operand has 488 places, 500 transitions, 1018 flow. Second operand 6 states and 2686 transitions. [2025-02-08 05:37:14,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 481 transitions, 1118 flow [2025-02-08 05:37:14,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 481 transitions, 1106 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:14,244 INFO L231 Difference]: Finished difference. Result has 484 places, 474 transitions, 984 flow [2025-02-08 05:37:14,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=984, PETRI_PLACES=484, PETRI_TRANSITIONS=474} [2025-02-08 05:37:14,250 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -4 predicate places. [2025-02-08 05:37:14,252 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 474 transitions, 984 flow [2025-02-08 05:37:14,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 434.5) internal successors, (2607), 6 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:14,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:14,255 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:14,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash 41284820, now seen corresponding path program 1 times [2025-02-08 05:37:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:14,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769722348] [2025-02-08 05:37:14,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:14,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:37:14,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:37:14,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:14,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:14,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769722348] [2025-02-08 05:37:14,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769722348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:14,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:14,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738635892] [2025-02-08 05:37:14,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:14,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:14,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:14,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:14,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:14,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 523 [2025-02-08 05:37:14,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 474 transitions, 984 flow. Second operand has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:14,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 523 [2025-02-08 05:37:14,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,402 INFO L124 PetriNetUnfolderBase]: 17/816 cut-off events. [2025-02-08 05:37:14,403 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-08 05:37:14,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 816 events. 17/816 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3176 event pairs, 7 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 819. Up to 25 conditions per place. [2025-02-08 05:37:14,411 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 11 selfloop transitions, 2 changer transitions 0/473 dead transitions. [2025-02-08 05:37:14,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 473 transitions, 1008 flow [2025-02-08 05:37:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-02-08 05:37:14,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9458253664754621 [2025-02-08 05:37:14,414 INFO L175 Difference]: Start difference. First operand has 484 places, 474 transitions, 984 flow. Second operand 3 states and 1484 transitions. [2025-02-08 05:37:14,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 473 transitions, 1008 flow [2025-02-08 05:37:14,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 473 transitions, 978 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:14,420 INFO L231 Difference]: Finished difference. Result has 473 places, 473 transitions, 956 flow [2025-02-08 05:37:14,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=956, PETRI_PLACES=473, PETRI_TRANSITIONS=473} [2025-02-08 05:37:14,421 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -15 predicate places. [2025-02-08 05:37:14,421 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 473 transitions, 956 flow [2025-02-08 05:37:14,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,422 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] [2025-02-08 05:37:14,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:14,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:14,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:14,423 INFO L85 PathProgramCache]: Analyzing trace with hash 400259264, now seen corresponding path program 1 times [2025-02-08 05:37:14,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:14,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956957986] [2025-02-08 05:37:14,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:14,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:14,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:37:14,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:37:14,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:14,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956957986] [2025-02-08 05:37:14,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956957986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:14,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838583531] [2025-02-08 05:37:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:14,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:14,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:14,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:14,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 523 [2025-02-08 05:37:14,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 473 transitions, 956 flow. Second operand has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:14,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 523 [2025-02-08 05:37:14,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,574 INFO L124 PetriNetUnfolderBase]: 13/648 cut-off events. [2025-02-08 05:37:14,574 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:14,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 648 events. 13/648 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2138 event pairs, 5 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 608. Up to 22 conditions per place. [2025-02-08 05:37:14,578 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 11 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2025-02-08 05:37:14,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 472 transitions, 980 flow [2025-02-08 05:37:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-02-08 05:37:14,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9458253664754621 [2025-02-08 05:37:14,581 INFO L175 Difference]: Start difference. First operand has 473 places, 473 transitions, 956 flow. Second operand 3 states and 1484 transitions. [2025-02-08 05:37:14,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 472 transitions, 980 flow [2025-02-08 05:37:14,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 472 transitions, 976 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:14,587 INFO L231 Difference]: Finished difference. Result has 472 places, 472 transitions, 954 flow [2025-02-08 05:37:14,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=472, PETRI_TRANSITIONS=472} [2025-02-08 05:37:14,588 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -16 predicate places. [2025-02-08 05:37:14,588 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 472 transitions, 954 flow [2025-02-08 05:37:14,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:14,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:14,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:14,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1142362476, now seen corresponding path program 1 times [2025-02-08 05:37:14,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:14,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965936868] [2025-02-08 05:37:14,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:14,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:14,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:37:14,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:37:14,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965936868] [2025-02-08 05:37:14,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965936868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:14,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:14,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163453725] [2025-02-08 05:37:14,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:14,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:14,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:14,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:14,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 523 [2025-02-08 05:37:14,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 472 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:14,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 523 [2025-02-08 05:37:14,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,727 INFO L124 PetriNetUnfolderBase]: 14/565 cut-off events. [2025-02-08 05:37:14,727 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:14,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 565 events. 14/565 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1614 event pairs, 7 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 480. Up to 25 conditions per place. [2025-02-08 05:37:14,733 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 11 selfloop transitions, 2 changer transitions 0/471 dead transitions. [2025-02-08 05:37:14,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 471 transitions, 978 flow [2025-02-08 05:37:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-02-08 05:37:14,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9458253664754621 [2025-02-08 05:37:14,740 INFO L175 Difference]: Start difference. First operand has 472 places, 472 transitions, 954 flow. Second operand 3 states and 1484 transitions. [2025-02-08 05:37:14,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 471 transitions, 978 flow [2025-02-08 05:37:14,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 471 transitions, 974 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:14,746 INFO L231 Difference]: Finished difference. Result has 471 places, 471 transitions, 952 flow [2025-02-08 05:37:14,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=471, PETRI_TRANSITIONS=471} [2025-02-08 05:37:14,747 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -17 predicate places. [2025-02-08 05:37:14,747 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 471 transitions, 952 flow [2025-02-08 05:37:14,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,749 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] [2025-02-08 05:37:14,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:14,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:14,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:14,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1008075716, now seen corresponding path program 1 times [2025-02-08 05:37:14,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:14,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328347182] [2025-02-08 05:37:14,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:14,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:14,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:14,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:14,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:14,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:14,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328347182] [2025-02-08 05:37:14,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328347182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:14,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:14,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:14,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977927607] [2025-02-08 05:37:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:14,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:14,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:14,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:14,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:14,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 523 [2025-02-08 05:37:14,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 471 transitions, 952 flow. Second operand has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:14,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 523 [2025-02-08 05:37:14,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,935 INFO L124 PetriNetUnfolderBase]: 19/951 cut-off events. [2025-02-08 05:37:14,936 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:14,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 951 events. 19/951 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4356 event pairs, 7 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 822. Up to 25 conditions per place. [2025-02-08 05:37:14,948 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 11 selfloop transitions, 2 changer transitions 0/470 dead transitions. [2025-02-08 05:37:14,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 470 transitions, 976 flow [2025-02-08 05:37:14,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-02-08 05:37:14,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9458253664754621 [2025-02-08 05:37:14,951 INFO L175 Difference]: Start difference. First operand has 471 places, 471 transitions, 952 flow. Second operand 3 states and 1484 transitions. [2025-02-08 05:37:14,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 470 transitions, 976 flow [2025-02-08 05:37:14,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 470 transitions, 972 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:14,957 INFO L231 Difference]: Finished difference. Result has 470 places, 470 transitions, 950 flow [2025-02-08 05:37:14,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=950, PETRI_PLACES=470, PETRI_TRANSITIONS=470} [2025-02-08 05:37:14,958 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -18 predicate places. [2025-02-08 05:37:14,958 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 470 transitions, 950 flow [2025-02-08 05:37:14,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,961 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] [2025-02-08 05:37:14,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:14,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:14,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:14,962 INFO L85 PathProgramCache]: Analyzing trace with hash -879032270, now seen corresponding path program 1 times [2025-02-08 05:37:14,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:14,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446538572] [2025-02-08 05:37:14,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:14,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:14,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 05:37:14,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 05:37:14,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:15,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446538572] [2025-02-08 05:37:15,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446538572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819918339] [2025-02-08 05:37:15,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 523 [2025-02-08 05:37:15,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 470 transitions, 950 flow. Second operand has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 523 [2025-02-08 05:37:15,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,110 INFO L124 PetriNetUnfolderBase]: 15/801 cut-off events. [2025-02-08 05:37:15,110 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-02-08 05:37:15,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 801 events. 15/801 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2811 event pairs, 5 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 659. Up to 22 conditions per place. [2025-02-08 05:37:15,121 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 11 selfloop transitions, 2 changer transitions 0/469 dead transitions. [2025-02-08 05:37:15,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 469 transitions, 974 flow [2025-02-08 05:37:15,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-02-08 05:37:15,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9458253664754621 [2025-02-08 05:37:15,125 INFO L175 Difference]: Start difference. First operand has 470 places, 470 transitions, 950 flow. Second operand 3 states and 1484 transitions. [2025-02-08 05:37:15,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 469 transitions, 974 flow [2025-02-08 05:37:15,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 469 transitions, 970 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:15,131 INFO L231 Difference]: Finished difference. Result has 469 places, 469 transitions, 948 flow [2025-02-08 05:37:15,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=469, PETRI_TRANSITIONS=469} [2025-02-08 05:37:15,134 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -19 predicate places. [2025-02-08 05:37:15,134 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 469 transitions, 948 flow [2025-02-08 05:37:15,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,135 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-02-08 05:37:15,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:15,135 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:15,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1302141771, now seen corresponding path program 1 times [2025-02-08 05:37:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445096833] [2025-02-08 05:37:15,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-08 05:37:15,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-08 05:37:15,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:15,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445096833] [2025-02-08 05:37:15,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445096833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583300318] [2025-02-08 05:37:15,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 523 [2025-02-08 05:37:15,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 469 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 523 [2025-02-08 05:37:15,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,291 INFO L124 PetriNetUnfolderBase]: 17/766 cut-off events. [2025-02-08 05:37:15,292 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-02-08 05:37:15,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 766 events. 17/766 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2528 event pairs, 7 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 618. Up to 25 conditions per place. [2025-02-08 05:37:15,300 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 11 selfloop transitions, 2 changer transitions 0/468 dead transitions. [2025-02-08 05:37:15,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 468 transitions, 972 flow [2025-02-08 05:37:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-02-08 05:37:15,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9458253664754621 [2025-02-08 05:37:15,303 INFO L175 Difference]: Start difference. First operand has 469 places, 469 transitions, 948 flow. Second operand 3 states and 1484 transitions. [2025-02-08 05:37:15,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 468 transitions, 972 flow [2025-02-08 05:37:15,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 468 transitions, 968 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:15,308 INFO L231 Difference]: Finished difference. Result has 468 places, 468 transitions, 946 flow [2025-02-08 05:37:15,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=468, PETRI_TRANSITIONS=468} [2025-02-08 05:37:15,309 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -20 predicate places. [2025-02-08 05:37:15,309 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 468 transitions, 946 flow [2025-02-08 05:37:15,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 491.3333333333333) internal successors, (1474), 3 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,314 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-02-08 05:37:15,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:15,314 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:15,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1183082964, now seen corresponding path program 1 times [2025-02-08 05:37:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672397170] [2025-02-08 05:37:15,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 05:37:15,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 05:37:15,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672397170] [2025-02-08 05:37:15,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672397170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745347816] [2025-02-08 05:37:15,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 523 [2025-02-08 05:37:15,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 468 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 493.3333333333333) internal successors, (1480), 3 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 523 [2025-02-08 05:37:15,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,489 INFO L124 PetriNetUnfolderBase]: 34/1110 cut-off events. [2025-02-08 05:37:15,490 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:15,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 1110 events. 34/1110 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5877 event pairs, 6 based on Foata normal form. 0/950 useless extension candidates. Maximal degree in co-relation 984. Up to 43 conditions per place. [2025-02-08 05:37:15,500 INFO L140 encePairwiseOnDemand]: 519/523 looper letters, 13 selfloop transitions, 2 changer transitions 0/470 dead transitions. [2025-02-08 05:37:15,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 470 transitions, 982 flow [2025-02-08 05:37:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1493 transitions. [2025-02-08 05:37:15,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515615041427661 [2025-02-08 05:37:15,502 INFO L175 Difference]: Start difference. First operand has 468 places, 468 transitions, 946 flow. Second operand 3 states and 1493 transitions. [2025-02-08 05:37:15,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 470 transitions, 982 flow [2025-02-08 05:37:15,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 470 transitions, 978 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:15,510 INFO L231 Difference]: Finished difference. Result has 467 places, 468 transitions, 952 flow [2025-02-08 05:37:15,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=467, PETRI_TRANSITIONS=468} [2025-02-08 05:37:15,514 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -21 predicate places. [2025-02-08 05:37:15,514 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 468 transitions, 952 flow [2025-02-08 05:37:15,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 493.3333333333333) internal successors, (1480), 3 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,515 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] [2025-02-08 05:37:15,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:15,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:15,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,516 INFO L85 PathProgramCache]: Analyzing trace with hash -640486223, now seen corresponding path program 1 times [2025-02-08 05:37:15,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727746428] [2025-02-08 05:37:15,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-08 05:37:15,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-08 05:37:15,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:15,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727746428] [2025-02-08 05:37:15,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727746428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303775255] [2025-02-08 05:37:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 523 [2025-02-08 05:37:15,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 468 transitions, 952 flow. Second operand has 3 states, 3 states have (on average 493.3333333333333) internal successors, (1480), 3 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 523 [2025-02-08 05:37:15,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,683 INFO L124 PetriNetUnfolderBase]: 26/1003 cut-off events. [2025-02-08 05:37:15,684 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:15,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 1003 events. 26/1003 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4546 event pairs, 6 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 773. Up to 31 conditions per place. [2025-02-08 05:37:15,693 INFO L140 encePairwiseOnDemand]: 519/523 looper letters, 13 selfloop transitions, 2 changer transitions 0/470 dead transitions. [2025-02-08 05:37:15,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 470 transitions, 988 flow [2025-02-08 05:37:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1493 transitions. [2025-02-08 05:37:15,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515615041427661 [2025-02-08 05:37:15,696 INFO L175 Difference]: Start difference. First operand has 467 places, 468 transitions, 952 flow. Second operand 3 states and 1493 transitions. [2025-02-08 05:37:15,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 470 transitions, 988 flow [2025-02-08 05:37:15,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 470 transitions, 988 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:15,701 INFO L231 Difference]: Finished difference. Result has 468 places, 468 transitions, 962 flow [2025-02-08 05:37:15,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=962, PETRI_PLACES=468, PETRI_TRANSITIONS=468} [2025-02-08 05:37:15,702 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -20 predicate places. [2025-02-08 05:37:15,702 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 468 transitions, 962 flow [2025-02-08 05:37:15,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 493.3333333333333) internal successors, (1480), 3 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,703 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] [2025-02-08 05:37:15,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:15,703 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:15,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1137885809, now seen corresponding path program 1 times [2025-02-08 05:37:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942663606] [2025-02-08 05:37:15,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 05:37:15,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 05:37:15,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:15,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942663606] [2025-02-08 05:37:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942663606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732522807] [2025-02-08 05:37:15,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 491 out of 523 [2025-02-08 05:37:15,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 468 transitions, 962 flow. Second operand has 3 states, 3 states have (on average 492.3333333333333) internal successors, (1477), 3 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 491 of 523 [2025-02-08 05:37:15,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,912 INFO L124 PetriNetUnfolderBase]: 26/924 cut-off events. [2025-02-08 05:37:15,912 INFO L125 PetriNetUnfolderBase]: For 2/14 co-relation queries the response was YES. [2025-02-08 05:37:15,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 924 events. 26/924 cut-off events. For 2/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4523 event pairs, 8 based on Foata normal form. 1/805 useless extension candidates. Maximal degree in co-relation 713. Up to 28 conditions per place. [2025-02-08 05:37:15,923 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 13 selfloop transitions, 2 changer transitions 0/469 dead transitions. [2025-02-08 05:37:15,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 469 transitions, 996 flow [2025-02-08 05:37:15,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1489 transitions. [2025-02-08 05:37:15,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490121096239643 [2025-02-08 05:37:15,926 INFO L175 Difference]: Start difference. First operand has 468 places, 468 transitions, 962 flow. Second operand 3 states and 1489 transitions. [2025-02-08 05:37:15,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 469 transitions, 996 flow [2025-02-08 05:37:15,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 469 transitions, 996 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:15,934 INFO L231 Difference]: Finished difference. Result has 469 places, 467 transitions, 964 flow [2025-02-08 05:37:15,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=469, PETRI_TRANSITIONS=467} [2025-02-08 05:37:15,935 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -19 predicate places. [2025-02-08 05:37:15,936 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 467 transitions, 964 flow [2025-02-08 05:37:15,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 492.3333333333333) internal successors, (1477), 3 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,937 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] [2025-02-08 05:37:15,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:15,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:15,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1116617134, now seen corresponding path program 1 times [2025-02-08 05:37:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619960207] [2025-02-08 05:37:15,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 05:37:15,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 05:37:15,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:16,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619960207] [2025-02-08 05:37:16,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619960207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042990075] [2025-02-08 05:37:16,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 523 [2025-02-08 05:37:16,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 467 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 523 [2025-02-08 05:37:16,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,247 INFO L124 PetriNetUnfolderBase]: 56/1729 cut-off events. [2025-02-08 05:37:16,247 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-02-08 05:37:16,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1826 conditions, 1729 events. 56/1729 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 11570 event pairs, 10 based on Foata normal form. 0/1479 useless extension candidates. Maximal degree in co-relation 1351. Up to 66 conditions per place. [2025-02-08 05:37:16,262 INFO L140 encePairwiseOnDemand]: 519/523 looper letters, 13 selfloop transitions, 2 changer transitions 0/469 dead transitions. [2025-02-08 05:37:16,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 469 transitions, 1000 flow [2025-02-08 05:37:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1493 transitions. [2025-02-08 05:37:16,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515615041427661 [2025-02-08 05:37:16,265 INFO L175 Difference]: Start difference. First operand has 469 places, 467 transitions, 964 flow. Second operand 3 states and 1493 transitions. [2025-02-08 05:37:16,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 469 transitions, 1000 flow [2025-02-08 05:37:16,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 469 transitions, 996 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:16,271 INFO L231 Difference]: Finished difference. Result has 468 places, 467 transitions, 970 flow [2025-02-08 05:37:16,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=970, PETRI_PLACES=468, PETRI_TRANSITIONS=467} [2025-02-08 05:37:16,272 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -20 predicate places. [2025-02-08 05:37:16,272 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 467 transitions, 970 flow [2025-02-08 05:37:16,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,273 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-02-08 05:37:16,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:16,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:16,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1520757593, now seen corresponding path program 1 times [2025-02-08 05:37:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661910418] [2025-02-08 05:37:16,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 05:37:16,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 05:37:16,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:16,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661910418] [2025-02-08 05:37:16,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661910418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600836463] [2025-02-08 05:37:16,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 523 [2025-02-08 05:37:16,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 467 transitions, 970 flow. Second operand has 3 states, 3 states have (on average 493.3333333333333) internal successors, (1480), 3 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 523 [2025-02-08 05:37:16,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,532 INFO L124 PetriNetUnfolderBase]: 38/1268 cut-off events. [2025-02-08 05:37:16,533 INFO L125 PetriNetUnfolderBase]: For 3/7 co-relation queries the response was YES. [2025-02-08 05:37:16,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 1268 events. 38/1268 cut-off events. For 3/7 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7649 event pairs, 4 based on Foata normal form. 1/1111 useless extension candidates. Maximal degree in co-relation 964. Up to 46 conditions per place. [2025-02-08 05:37:16,544 INFO L140 encePairwiseOnDemand]: 519/523 looper letters, 14 selfloop transitions, 2 changer transitions 0/470 dead transitions. [2025-02-08 05:37:16,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 470 transitions, 1011 flow [2025-02-08 05:37:16,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1494 transitions. [2025-02-08 05:37:16,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9521988527724665 [2025-02-08 05:37:16,547 INFO L175 Difference]: Start difference. First operand has 468 places, 467 transitions, 970 flow. Second operand 3 states and 1494 transitions. [2025-02-08 05:37:16,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 470 transitions, 1011 flow [2025-02-08 05:37:16,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 470 transitions, 1011 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:16,552 INFO L231 Difference]: Finished difference. Result has 469 places, 467 transitions, 980 flow [2025-02-08 05:37:16,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=980, PETRI_PLACES=469, PETRI_TRANSITIONS=467} [2025-02-08 05:37:16,554 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -19 predicate places. [2025-02-08 05:37:16,554 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 467 transitions, 980 flow [2025-02-08 05:37:16,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 493.3333333333333) internal successors, (1480), 3 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,555 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] [2025-02-08 05:37:16,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:16,555 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:16,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,555 INFO L85 PathProgramCache]: Analyzing trace with hash -101122953, now seen corresponding path program 1 times [2025-02-08 05:37:16,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206965156] [2025-02-08 05:37:16,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:37:16,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:37:16,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:16,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206965156] [2025-02-08 05:37:16,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206965156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446709777] [2025-02-08 05:37:16,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 491 out of 523 [2025-02-08 05:37:16,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 467 transitions, 980 flow. Second operand has 3 states, 3 states have (on average 492.3333333333333) internal successors, (1477), 3 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 491 of 523 [2025-02-08 05:37:16,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,763 INFO L124 PetriNetUnfolderBase]: 35/1348 cut-off events. [2025-02-08 05:37:16,763 INFO L125 PetriNetUnfolderBase]: For 3/7 co-relation queries the response was YES. [2025-02-08 05:37:16,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 1348 events. 35/1348 cut-off events. For 3/7 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8066 event pairs, 4 based on Foata normal form. 0/1176 useless extension candidates. Maximal degree in co-relation 1197. Up to 20 conditions per place. [2025-02-08 05:37:16,774 INFO L140 encePairwiseOnDemand]: 518/523 looper letters, 12 selfloop transitions, 3 changer transitions 0/468 dead transitions. [2025-02-08 05:37:16,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 468 transitions, 1014 flow [2025-02-08 05:37:16,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1490 transitions. [2025-02-08 05:37:16,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9496494582536648 [2025-02-08 05:37:16,777 INFO L175 Difference]: Start difference. First operand has 469 places, 467 transitions, 980 flow. Second operand 3 states and 1490 transitions. [2025-02-08 05:37:16,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 468 transitions, 1014 flow [2025-02-08 05:37:16,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 468 transitions, 1014 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:16,782 INFO L231 Difference]: Finished difference. Result has 470 places, 466 transitions, 989 flow [2025-02-08 05:37:16,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=989, PETRI_PLACES=470, PETRI_TRANSITIONS=466} [2025-02-08 05:37:16,784 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -18 predicate places. [2025-02-08 05:37:16,784 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 466 transitions, 989 flow [2025-02-08 05:37:16,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 492.3333333333333) internal successors, (1477), 3 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,785 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] [2025-02-08 05:37:16,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:16,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:16,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1354536701, now seen corresponding path program 1 times [2025-02-08 05:37:16,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783293388] [2025-02-08 05:37:16,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:37:16,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:37:16,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:16,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783293388] [2025-02-08 05:37:16,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783293388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924241280] [2025-02-08 05:37:16,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 523 [2025-02-08 05:37:16,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 466 transitions, 989 flow. Second operand has 3 states, 3 states have (on average 491.6666666666667) internal successors, (1475), 3 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 523 [2025-02-08 05:37:16,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,994 INFO L124 PetriNetUnfolderBase]: 43/1342 cut-off events. [2025-02-08 05:37:16,994 INFO L125 PetriNetUnfolderBase]: For 10/19 co-relation queries the response was YES. [2025-02-08 05:37:17,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 1342 events. 43/1342 cut-off events. For 10/19 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8438 event pairs, 12 based on Foata normal form. 1/1174 useless extension candidates. Maximal degree in co-relation 1436. Up to 41 conditions per place. [2025-02-08 05:37:17,010 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 14 selfloop transitions, 2 changer transitions 0/467 dead transitions. [2025-02-08 05:37:17,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 467 transitions, 1025 flow [2025-02-08 05:37:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1487 transitions. [2025-02-08 05:37:17,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477374123645634 [2025-02-08 05:37:17,014 INFO L175 Difference]: Start difference. First operand has 470 places, 466 transitions, 989 flow. Second operand 3 states and 1487 transitions. [2025-02-08 05:37:17,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 467 transitions, 1025 flow [2025-02-08 05:37:17,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 467 transitions, 1022 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:17,022 INFO L231 Difference]: Finished difference. Result has 470 places, 465 transitions, 988 flow [2025-02-08 05:37:17,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=988, PETRI_PLACES=470, PETRI_TRANSITIONS=465} [2025-02-08 05:37:17,024 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -18 predicate places. [2025-02-08 05:37:17,024 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 465 transitions, 988 flow [2025-02-08 05:37:17,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 491.6666666666667) internal successors, (1475), 3 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:17,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:17,025 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:17,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1751102784, now seen corresponding path program 1 times [2025-02-08 05:37:17,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89108125] [2025-02-08 05:37:17,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 05:37:17,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 05:37:17,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:17,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:17,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:17,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89108125] [2025-02-08 05:37:17,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89108125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:17,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:17,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:37:17,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852539145] [2025-02-08 05:37:17,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:37:17,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:37:17,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:37:17,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 493 out of 523 [2025-02-08 05:37:17,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 465 transitions, 988 flow. Second operand has 4 states, 4 states have (on average 494.25) internal successors, (1977), 4 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 493 of 523 [2025-02-08 05:37:17,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,318 INFO L124 PetriNetUnfolderBase]: 31/1247 cut-off events. [2025-02-08 05:37:17,318 INFO L125 PetriNetUnfolderBase]: For 2/12 co-relation queries the response was YES. [2025-02-08 05:37:17,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 1247 events. 31/1247 cut-off events. For 2/12 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7424 event pairs, 2 based on Foata normal form. 2/1096 useless extension candidates. Maximal degree in co-relation 1284. Up to 14 conditions per place. [2025-02-08 05:37:17,331 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 13 selfloop transitions, 2 changer transitions 0/466 dead transitions. [2025-02-08 05:37:17,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 466 transitions, 1022 flow [2025-02-08 05:37:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:37:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:37:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1988 transitions. [2025-02-08 05:37:17,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9502868068833652 [2025-02-08 05:37:17,335 INFO L175 Difference]: Start difference. First operand has 470 places, 465 transitions, 988 flow. Second operand 4 states and 1988 transitions. [2025-02-08 05:37:17,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 466 transitions, 1022 flow [2025-02-08 05:37:17,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 466 transitions, 1012 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:17,342 INFO L231 Difference]: Finished difference. Result has 468 places, 462 transitions, 974 flow [2025-02-08 05:37:17,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=974, PETRI_PLACES=468, PETRI_TRANSITIONS=462} [2025-02-08 05:37:17,344 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -20 predicate places. [2025-02-08 05:37:17,344 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 462 transitions, 974 flow [2025-02-08 05:37:17,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 494.25) internal successors, (1977), 4 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:17,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:17,346 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:17,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash 683965153, now seen corresponding path program 1 times [2025-02-08 05:37:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739450607] [2025-02-08 05:37:17,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:37:17,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:37:17,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:17,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:17,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:17,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739450607] [2025-02-08 05:37:17,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739450607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:17,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:17,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151644612] [2025-02-08 05:37:17,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:37:17,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:37:17,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:37:17,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 523 [2025-02-08 05:37:17,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 462 transitions, 974 flow. Second operand has 5 states, 5 states have (on average 477.0) internal successors, (2385), 5 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 523 [2025-02-08 05:37:17,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,701 INFO L124 PetriNetUnfolderBase]: 16/897 cut-off events. [2025-02-08 05:37:17,701 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-02-08 05:37:17,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 897 events. 16/897 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3787 event pairs, 0 based on Foata normal form. 3/806 useless extension candidates. Maximal degree in co-relation 844. Up to 15 conditions per place. [2025-02-08 05:37:17,707 INFO L140 encePairwiseOnDemand]: 502/523 looper letters, 18 selfloop transitions, 18 changer transitions 0/465 dead transitions. [2025-02-08 05:37:17,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 465 transitions, 1052 flow [2025-02-08 05:37:17,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:37:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:37:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2399 transitions. [2025-02-08 05:37:17,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173996175908222 [2025-02-08 05:37:17,711 INFO L175 Difference]: Start difference. First operand has 468 places, 462 transitions, 974 flow. Second operand 5 states and 2399 transitions. [2025-02-08 05:37:17,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 465 transitions, 1052 flow [2025-02-08 05:37:17,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 465 transitions, 1049 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:17,716 INFO L231 Difference]: Finished difference. Result has 471 places, 465 transitions, 1031 flow [2025-02-08 05:37:17,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1031, PETRI_PLACES=471, PETRI_TRANSITIONS=465} [2025-02-08 05:37:17,717 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -17 predicate places. [2025-02-08 05:37:17,717 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 465 transitions, 1031 flow [2025-02-08 05:37:17,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 477.0) internal successors, (2385), 5 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:17,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:17,718 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:17,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1888956171, now seen corresponding path program 1 times [2025-02-08 05:37:17,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136412731] [2025-02-08 05:37:17,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:37:17,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:37:17,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:17,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:37:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136412731] [2025-02-08 05:37:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136412731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:17,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:17,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:17,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599442446] [2025-02-08 05:37:17,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:17,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:17,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:17,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 491 out of 523 [2025-02-08 05:37:17,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 465 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 493.0) internal successors, (1479), 3 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 491 of 523 [2025-02-08 05:37:17,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,963 INFO L124 PetriNetUnfolderBase]: 40/1616 cut-off events. [2025-02-08 05:37:17,963 INFO L125 PetriNetUnfolderBase]: For 5/13 co-relation queries the response was YES. [2025-02-08 05:37:17,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 1616 events. 40/1616 cut-off events. For 5/13 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10323 event pairs, 8 based on Foata normal form. 1/1420 useless extension candidates. Maximal degree in co-relation 1543. Up to 28 conditions per place. [2025-02-08 05:37:17,993 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 13 selfloop transitions, 2 changer transitions 0/466 dead transitions. [2025-02-08 05:37:17,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 466 transitions, 1065 flow [2025-02-08 05:37:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1489 transitions. [2025-02-08 05:37:17,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490121096239643 [2025-02-08 05:37:17,999 INFO L175 Difference]: Start difference. First operand has 471 places, 465 transitions, 1031 flow. Second operand 3 states and 1489 transitions. [2025-02-08 05:37:17,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 466 transitions, 1065 flow [2025-02-08 05:37:18,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 466 transitions, 1035 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:37:18,005 INFO L231 Difference]: Finished difference. Result has 469 places, 464 transitions, 1003 flow [2025-02-08 05:37:18,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1003, PETRI_PLACES=469, PETRI_TRANSITIONS=464} [2025-02-08 05:37:18,006 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -19 predicate places. [2025-02-08 05:37:18,007 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 464 transitions, 1003 flow [2025-02-08 05:37:18,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 493.0) internal successors, (1479), 3 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:18,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:18,008 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:18,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,009 INFO L85 PathProgramCache]: Analyzing trace with hash 149162440, now seen corresponding path program 1 times [2025-02-08 05:37:18,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158541896] [2025-02-08 05:37:18,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:37:18,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:37:18,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158541896] [2025-02-08 05:37:18,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158541896] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:37:18,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591658377] [2025-02-08 05:37:18,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:37:18,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:18,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:37:18,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:37:18,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:37:18,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:37:18,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:37:18,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:37:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:18,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:37:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:18,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591658377] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:37:18,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:37:18,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-08 05:37:18,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072705364] [2025-02-08 05:37:18,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:37:18,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:37:18,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:37:19,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 523 [2025-02-08 05:37:19,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 464 transitions, 1003 flow. Second operand has 15 states, 15 states have (on average 466.46666666666664) internal successors, (6997), 15 states have internal predecessors, (6997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:19,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:19,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 523 [2025-02-08 05:37:19,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:19,364 INFO L124 PetriNetUnfolderBase]: 16/947 cut-off events. [2025-02-08 05:37:19,365 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:19,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 947 events. 16/947 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3678 event pairs, 0 based on Foata normal form. 6/859 useless extension candidates. Maximal degree in co-relation 1036. Up to 15 conditions per place. [2025-02-08 05:37:19,374 INFO L140 encePairwiseOnDemand]: 493/523 looper letters, 30 selfloop transitions, 39 changer transitions 0/488 dead transitions. [2025-02-08 05:37:19,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 488 transitions, 1195 flow [2025-02-08 05:37:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5168 transitions. [2025-02-08 05:37:19,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8983139231705197 [2025-02-08 05:37:19,382 INFO L175 Difference]: Start difference. First operand has 469 places, 464 transitions, 1003 flow. Second operand 11 states and 5168 transitions. [2025-02-08 05:37:19,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 488 transitions, 1195 flow [2025-02-08 05:37:19,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 488 transitions, 1191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:19,388 INFO L231 Difference]: Finished difference. Result has 480 places, 482 transitions, 1179 flow [2025-02-08 05:37:19,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1179, PETRI_PLACES=480, PETRI_TRANSITIONS=482} [2025-02-08 05:37:19,389 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -8 predicate places. [2025-02-08 05:37:19,389 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 482 transitions, 1179 flow [2025-02-08 05:37:19,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 466.46666666666664) internal successors, (6997), 15 states have internal predecessors, (6997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:19,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:19,391 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:19,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:37:19,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 05:37:19,596 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:19,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1555424296, now seen corresponding path program 2 times [2025-02-08 05:37:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:19,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686530061] [2025-02-08 05:37:19,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:37:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:19,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 306 statements into 2 equivalence classes. [2025-02-08 05:37:19,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 171 of 306 statements. [2025-02-08 05:37:19,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:37:19,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-08 05:37:19,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:19,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686530061] [2025-02-08 05:37:19,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686530061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:19,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:19,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026414883] [2025-02-08 05:37:19,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:19,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:19,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:19,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:19,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:20,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 523 [2025-02-08 05:37:20,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 482 transitions, 1179 flow. Second operand has 6 states, 6 states have (on average 481.5) internal successors, (2889), 6 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:20,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:20,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 523 [2025-02-08 05:37:20,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:20,421 INFO L124 PetriNetUnfolderBase]: 32/1260 cut-off events. [2025-02-08 05:37:20,421 INFO L125 PetriNetUnfolderBase]: For 20/32 co-relation queries the response was YES. [2025-02-08 05:37:20,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1260 events. 32/1260 cut-off events. For 20/32 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6546 event pairs, 2 based on Foata normal form. 4/1128 useless extension candidates. Maximal degree in co-relation 1164. Up to 50 conditions per place. [2025-02-08 05:37:20,429 INFO L140 encePairwiseOnDemand]: 518/523 looper letters, 30 selfloop transitions, 4 changer transitions 0/489 dead transitions. [2025-02-08 05:37:20,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 489 transitions, 1269 flow [2025-02-08 05:37:20,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2903 transitions. [2025-02-08 05:37:20,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9251115360101976 [2025-02-08 05:37:20,434 INFO L175 Difference]: Start difference. First operand has 480 places, 482 transitions, 1179 flow. Second operand 6 states and 2903 transitions. [2025-02-08 05:37:20,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 489 transitions, 1269 flow [2025-02-08 05:37:20,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 489 transitions, 1233 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-08 05:37:20,440 INFO L231 Difference]: Finished difference. Result has 481 places, 481 transitions, 1149 flow [2025-02-08 05:37:20,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1149, PETRI_PLACES=481, PETRI_TRANSITIONS=481} [2025-02-08 05:37:20,442 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -7 predicate places. [2025-02-08 05:37:20,442 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 481 transitions, 1149 flow [2025-02-08 05:37:20,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 481.5) internal successors, (2889), 6 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:20,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:20,444 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:20,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:20,444 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:20,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1805095625, now seen corresponding path program 1 times [2025-02-08 05:37:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:20,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243677316] [2025-02-08 05:37:20,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:20,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:20,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-08 05:37:20,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-08 05:37:20,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:20,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-08 05:37:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243677316] [2025-02-08 05:37:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243677316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:20,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117215749] [2025-02-08 05:37:20,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:20,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:20,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:20,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:20,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 523 [2025-02-08 05:37:20,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 481 transitions, 1149 flow. Second operand has 3 states, 3 states have (on average 492.0) internal successors, (1476), 3 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:20,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:20,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 523 [2025-02-08 05:37:20,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:20,779 INFO L124 PetriNetUnfolderBase]: 37/1148 cut-off events. [2025-02-08 05:37:20,780 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2025-02-08 05:37:20,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1148 events. 37/1148 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5333 event pairs, 12 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 1297. Up to 53 conditions per place. [2025-02-08 05:37:20,792 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 14 selfloop transitions, 2 changer transitions 0/482 dead transitions. [2025-02-08 05:37:20,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 482 transitions, 1185 flow [2025-02-08 05:37:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1487 transitions. [2025-02-08 05:37:20,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477374123645634 [2025-02-08 05:37:20,794 INFO L175 Difference]: Start difference. First operand has 481 places, 481 transitions, 1149 flow. Second operand 3 states and 1487 transitions. [2025-02-08 05:37:20,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 482 transitions, 1185 flow [2025-02-08 05:37:20,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 482 transitions, 1178 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:20,800 INFO L231 Difference]: Finished difference. Result has 478 places, 480 transitions, 1144 flow [2025-02-08 05:37:20,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1144, PETRI_PLACES=478, PETRI_TRANSITIONS=480} [2025-02-08 05:37:20,801 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -10 predicate places. [2025-02-08 05:37:20,801 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 480 transitions, 1144 flow [2025-02-08 05:37:20,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 492.0) internal successors, (1476), 3 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:20,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:20,802 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:20,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:20,802 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:20,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1673102402, now seen corresponding path program 1 times [2025-02-08 05:37:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:20,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547085000] [2025-02-08 05:37:20,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:20,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-08 05:37:20,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-08 05:37:20,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:20,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-08 05:37:20,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:20,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547085000] [2025-02-08 05:37:20,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547085000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:20,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:20,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107227675] [2025-02-08 05:37:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:20,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:20,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:20,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:20,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:20,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 488 out of 523 [2025-02-08 05:37:20,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 480 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 489.6666666666667) internal successors, (1469), 3 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:20,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:20,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 488 of 523 [2025-02-08 05:37:20,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,064 INFO L124 PetriNetUnfolderBase]: 39/1449 cut-off events. [2025-02-08 05:37:21,064 INFO L125 PetriNetUnfolderBase]: For 17/29 co-relation queries the response was YES. [2025-02-08 05:37:21,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 1449 events. 39/1449 cut-off events. For 17/29 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8323 event pairs, 6 based on Foata normal form. 1/1295 useless extension candidates. Maximal degree in co-relation 1490. Up to 28 conditions per place. [2025-02-08 05:37:21,078 INFO L140 encePairwiseOnDemand]: 517/523 looper letters, 14 selfloop transitions, 3 changer transitions 0/480 dead transitions. [2025-02-08 05:37:21,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 480 transitions, 1180 flow [2025-02-08 05:37:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-02-08 05:37:21,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9458253664754621 [2025-02-08 05:37:21,082 INFO L175 Difference]: Start difference. First operand has 478 places, 480 transitions, 1144 flow. Second operand 3 states and 1484 transitions. [2025-02-08 05:37:21,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 480 transitions, 1180 flow [2025-02-08 05:37:21,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 480 transitions, 1176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:21,088 INFO L231 Difference]: Finished difference. Result has 476 places, 478 transitions, 1147 flow [2025-02-08 05:37:21,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1147, PETRI_PLACES=476, PETRI_TRANSITIONS=478} [2025-02-08 05:37:21,089 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -12 predicate places. [2025-02-08 05:37:21,089 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 478 transitions, 1147 flow [2025-02-08 05:37:21,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 489.6666666666667) internal successors, (1469), 3 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:21,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,090 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:21,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:21,090 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:21,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash 114165354, now seen corresponding path program 1 times [2025-02-08 05:37:21,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990720255] [2025-02-08 05:37:21,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-08 05:37:21,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-08 05:37:21,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-08 05:37:21,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990720255] [2025-02-08 05:37:21,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990720255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398245304] [2025-02-08 05:37:21,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 523 [2025-02-08 05:37:21,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 478 transitions, 1147 flow. Second operand has 3 states, 3 states have (on average 493.3333333333333) internal successors, (1480), 3 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:21,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 523 [2025-02-08 05:37:21,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,367 INFO L124 PetriNetUnfolderBase]: 34/1340 cut-off events. [2025-02-08 05:37:21,367 INFO L125 PetriNetUnfolderBase]: For 22/24 co-relation queries the response was YES. [2025-02-08 05:37:21,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1340 events. 34/1340 cut-off events. For 22/24 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6796 event pairs, 4 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 1489. Up to 48 conditions per place. [2025-02-08 05:37:21,375 INFO L140 encePairwiseOnDemand]: 519/523 looper letters, 15 selfloop transitions, 2 changer transitions 0/482 dead transitions. [2025-02-08 05:37:21,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 482 transitions, 1193 flow [2025-02-08 05:37:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1495 transitions. [2025-02-08 05:37:21,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952836201402167 [2025-02-08 05:37:21,378 INFO L175 Difference]: Start difference. First operand has 476 places, 478 transitions, 1147 flow. Second operand 3 states and 1495 transitions. [2025-02-08 05:37:21,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 482 transitions, 1193 flow [2025-02-08 05:37:21,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 482 transitions, 1190 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:21,384 INFO L231 Difference]: Finished difference. Result has 476 places, 478 transitions, 1154 flow [2025-02-08 05:37:21,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=476, PETRI_TRANSITIONS=478} [2025-02-08 05:37:21,385 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -12 predicate places. [2025-02-08 05:37:21,386 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 478 transitions, 1154 flow [2025-02-08 05:37:21,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 493.3333333333333) internal successors, (1480), 3 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:21,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,387 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:21,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:21,387 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:21,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash 328985864, now seen corresponding path program 1 times [2025-02-08 05:37:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851746668] [2025-02-08 05:37:21,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-08 05:37:21,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-08 05:37:21,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-08 05:37:21,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851746668] [2025-02-08 05:37:21,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851746668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:37:21,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842917963] [2025-02-08 05:37:21,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:37:21,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:37:21,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:37:21,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 493 out of 523 [2025-02-08 05:37:21,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 478 transitions, 1154 flow. Second operand has 4 states, 4 states have (on average 494.5) internal successors, (1978), 4 states have internal predecessors, (1978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:21,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 493 of 523 [2025-02-08 05:37:21,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,725 INFO L124 PetriNetUnfolderBase]: 37/1502 cut-off events. [2025-02-08 05:37:21,725 INFO L125 PetriNetUnfolderBase]: For 19/35 co-relation queries the response was YES. [2025-02-08 05:37:21,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 1502 events. 37/1502 cut-off events. For 19/35 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8768 event pairs, 3 based on Foata normal form. 2/1354 useless extension candidates. Maximal degree in co-relation 1627. Up to 19 conditions per place. [2025-02-08 05:37:21,737 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 13 selfloop transitions, 2 changer transitions 0/479 dead transitions. [2025-02-08 05:37:21,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 479 transitions, 1188 flow [2025-02-08 05:37:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:37:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:37:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1988 transitions. [2025-02-08 05:37:21,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9502868068833652 [2025-02-08 05:37:21,740 INFO L175 Difference]: Start difference. First operand has 476 places, 478 transitions, 1154 flow. Second operand 4 states and 1988 transitions. [2025-02-08 05:37:21,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 479 transitions, 1188 flow [2025-02-08 05:37:21,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 479 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:21,745 INFO L231 Difference]: Finished difference. Result has 476 places, 475 transitions, 1144 flow [2025-02-08 05:37:21,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1144, PETRI_PLACES=476, PETRI_TRANSITIONS=475} [2025-02-08 05:37:21,747 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -12 predicate places. [2025-02-08 05:37:21,747 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 475 transitions, 1144 flow [2025-02-08 05:37:21,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 494.5) internal successors, (1978), 4 states have internal predecessors, (1978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:21,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,748 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:21,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:21,748 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:21,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,749 INFO L85 PathProgramCache]: Analyzing trace with hash -65807668, now seen corresponding path program 1 times [2025-02-08 05:37:21,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597686969] [2025-02-08 05:37:21,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-08 05:37:21,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-08 05:37:21,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-08 05:37:21,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597686969] [2025-02-08 05:37:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597686969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037009934] [2025-02-08 05:37:21,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 523 [2025-02-08 05:37:21,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 475 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 492.3333333333333) internal successors, (1477), 3 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:21,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 523 [2025-02-08 05:37:21,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,051 INFO L124 PetriNetUnfolderBase]: 49/1866 cut-off events. [2025-02-08 05:37:22,052 INFO L125 PetriNetUnfolderBase]: For 20/30 co-relation queries the response was YES. [2025-02-08 05:37:22,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2128 conditions, 1866 events. 49/1866 cut-off events. For 20/30 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12267 event pairs, 12 based on Foata normal form. 0/1676 useless extension candidates. Maximal degree in co-relation 1802. Up to 41 conditions per place. [2025-02-08 05:37:22,068 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 14 selfloop transitions, 2 changer transitions 0/476 dead transitions. [2025-02-08 05:37:22,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 476 transitions, 1180 flow [2025-02-08 05:37:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1487 transitions. [2025-02-08 05:37:22,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477374123645634 [2025-02-08 05:37:22,070 INFO L175 Difference]: Start difference. First operand has 476 places, 475 transitions, 1144 flow. Second operand 3 states and 1487 transitions. [2025-02-08 05:37:22,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 476 transitions, 1180 flow [2025-02-08 05:37:22,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 476 transitions, 1177 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:22,078 INFO L231 Difference]: Finished difference. Result has 475 places, 474 transitions, 1143 flow [2025-02-08 05:37:22,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1143, PETRI_PLACES=475, PETRI_TRANSITIONS=474} [2025-02-08 05:37:22,079 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -13 predicate places. [2025-02-08 05:37:22,079 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 474 transitions, 1143 flow [2025-02-08 05:37:22,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 492.3333333333333) internal successors, (1477), 3 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:22,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,080 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:22,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:37:22,080 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:22,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1805601399, now seen corresponding path program 1 times [2025-02-08 05:37:22,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962089158] [2025-02-08 05:37:22,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-08 05:37:22,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-08 05:37:22,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 05:37:22,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962089158] [2025-02-08 05:37:22,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962089158] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:37:22,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762173558] [2025-02-08 05:37:22,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:37:22,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:22,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:37:22,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:37:22,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-08 05:37:22,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-08 05:37:22,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 05:37:22,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:37:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 05:37:22,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:37:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 05:37:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762173558] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:37:22,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:37:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-02-08 05:37:22,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382742928] [2025-02-08 05:37:22,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 05:37:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 05:37:22,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-02-08 05:37:23,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 523 [2025-02-08 05:37:23,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 474 transitions, 1143 flow. Second operand has 22 states, 22 states have (on average 466.1363636363636) internal successors, (10255), 22 states have internal predecessors, (10255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:23,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:23,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 523 [2025-02-08 05:37:23,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:24,014 INFO L124 PetriNetUnfolderBase]: 16/1095 cut-off events. [2025-02-08 05:37:24,014 INFO L125 PetriNetUnfolderBase]: For 55/57 co-relation queries the response was YES. [2025-02-08 05:37:24,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 1095 events. 16/1095 cut-off events. For 55/57 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4002 event pairs, 0 based on Foata normal form. 6/1017 useless extension candidates. Maximal degree in co-relation 1318. Up to 25 conditions per place. [2025-02-08 05:37:24,022 INFO L140 encePairwiseOnDemand]: 493/523 looper letters, 36 selfloop transitions, 57 changer transitions 0/504 dead transitions. [2025-02-08 05:37:24,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 504 transitions, 1473 flow [2025-02-08 05:37:24,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 05:37:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 05:37:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 7970 transitions. [2025-02-08 05:37:24,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8964121021257452 [2025-02-08 05:37:24,030 INFO L175 Difference]: Start difference. First operand has 475 places, 474 transitions, 1143 flow. Second operand 17 states and 7970 transitions. [2025-02-08 05:37:24,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 504 transitions, 1473 flow [2025-02-08 05:37:24,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 504 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:24,037 INFO L231 Difference]: Finished difference. Result has 492 places, 495 transitions, 1415 flow [2025-02-08 05:37:24,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1415, PETRI_PLACES=492, PETRI_TRANSITIONS=495} [2025-02-08 05:37:24,038 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, 4 predicate places. [2025-02-08 05:37:24,038 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 495 transitions, 1415 flow [2025-02-08 05:37:24,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 466.1363636363636) internal successors, (10255), 22 states have internal predecessors, (10255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:24,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:24,040 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:24,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 05:37:24,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:37:24,241 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:24,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash -620011543, now seen corresponding path program 2 times [2025-02-08 05:37:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:24,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104950452] [2025-02-08 05:37:24,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:37:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:24,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes. [2025-02-08 05:37:24,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 177 of 402 statements. [2025-02-08 05:37:24,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:37:24,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-08 05:37:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:24,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104950452] [2025-02-08 05:37:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104950452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:24,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880997998] [2025-02-08 05:37:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:24,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:24,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:24,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:24,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:24,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 523 [2025-02-08 05:37:24,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 495 transitions, 1415 flow. Second operand has 6 states, 6 states have (on average 481.6666666666667) internal successors, (2890), 6 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:24,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:24,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 523 [2025-02-08 05:37:24,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:25,011 INFO L124 PetriNetUnfolderBase]: 44/1530 cut-off events. [2025-02-08 05:37:25,012 INFO L125 PetriNetUnfolderBase]: For 85/89 co-relation queries the response was YES. [2025-02-08 05:37:25,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 1530 events. 44/1530 cut-off events. For 85/89 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8119 event pairs, 3 based on Foata normal form. 1/1396 useless extension candidates. Maximal degree in co-relation 1465. Up to 77 conditions per place. [2025-02-08 05:37:25,027 INFO L140 encePairwiseOnDemand]: 518/523 looper letters, 30 selfloop transitions, 4 changer transitions 0/502 dead transitions. [2025-02-08 05:37:25,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 502 transitions, 1505 flow [2025-02-08 05:37:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2903 transitions. [2025-02-08 05:37:25,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9251115360101976 [2025-02-08 05:37:25,031 INFO L175 Difference]: Start difference. First operand has 492 places, 495 transitions, 1415 flow. Second operand 6 states and 2903 transitions. [2025-02-08 05:37:25,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 502 transitions, 1505 flow [2025-02-08 05:37:25,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 502 transitions, 1427 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-02-08 05:37:25,038 INFO L231 Difference]: Finished difference. Result has 488 places, 494 transitions, 1343 flow [2025-02-08 05:37:25,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1343, PETRI_PLACES=488, PETRI_TRANSITIONS=494} [2025-02-08 05:37:25,039 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, 0 predicate places. [2025-02-08 05:37:25,039 INFO L471 AbstractCegarLoop]: Abstraction has has 488 places, 494 transitions, 1343 flow [2025-02-08 05:37:25,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 481.6666666666667) internal successors, (2890), 6 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:25,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:25,040 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:25,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:37:25,040 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:25,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1201228445, now seen corresponding path program 1 times [2025-02-08 05:37:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:25,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759422776] [2025-02-08 05:37:25,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:25,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:25,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-08 05:37:25,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-08 05:37:25,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:25,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-08 05:37:25,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:25,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759422776] [2025-02-08 05:37:25,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759422776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:25,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:25,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554693966] [2025-02-08 05:37:25,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:25,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:25,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:25,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:25,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:25,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 488 out of 523 [2025-02-08 05:37:25,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 494 transitions, 1343 flow. Second operand has 3 states, 3 states have (on average 490.0) internal successors, (1470), 3 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:25,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:25,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 488 of 523 [2025-02-08 05:37:25,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:25,331 INFO L124 PetriNetUnfolderBase]: 31/1301 cut-off events. [2025-02-08 05:37:25,331 INFO L125 PetriNetUnfolderBase]: For 98/100 co-relation queries the response was YES. [2025-02-08 05:37:25,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 1301 events. 31/1301 cut-off events. For 98/100 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5699 event pairs, 6 based on Foata normal form. 1/1202 useless extension candidates. Maximal degree in co-relation 1479. Up to 37 conditions per place. [2025-02-08 05:37:25,338 INFO L140 encePairwiseOnDemand]: 517/523 looper letters, 10 selfloop transitions, 2 changer transitions 18/494 dead transitions. [2025-02-08 05:37:25,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 494 transitions, 1377 flow [2025-02-08 05:37:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1483 transitions. [2025-02-08 05:37:25,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9451880178457617 [2025-02-08 05:37:25,340 INFO L175 Difference]: Start difference. First operand has 488 places, 494 transitions, 1343 flow. Second operand 3 states and 1483 transitions. [2025-02-08 05:37:25,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 494 transitions, 1377 flow [2025-02-08 05:37:25,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 494 transitions, 1370 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:25,346 INFO L231 Difference]: Finished difference. Result has 484 places, 474 transitions, 1303 flow [2025-02-08 05:37:25,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1303, PETRI_PLACES=484, PETRI_TRANSITIONS=474} [2025-02-08 05:37:25,347 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -4 predicate places. [2025-02-08 05:37:25,347 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 474 transitions, 1303 flow [2025-02-08 05:37:25,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 490.0) internal successors, (1470), 3 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:25,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:25,348 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:25,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:37:25,348 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:25,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:25,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1962988563, now seen corresponding path program 1 times [2025-02-08 05:37:25,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:25,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231779964] [2025-02-08 05:37:25,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:25,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-08 05:37:25,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-08 05:37:25,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:25,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-08 05:37:26,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:26,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231779964] [2025-02-08 05:37:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231779964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:26,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:26,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389854423] [2025-02-08 05:37:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:26,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:26,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:26,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:26,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:26,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 523 [2025-02-08 05:37:26,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 474 transitions, 1303 flow. Second operand has 6 states, 6 states have (on average 481.5) internal successors, (2889), 6 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:26,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:26,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 523 [2025-02-08 05:37:26,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:26,592 INFO L124 PetriNetUnfolderBase]: 31/1370 cut-off events. [2025-02-08 05:37:26,592 INFO L125 PetriNetUnfolderBase]: For 93/105 co-relation queries the response was YES. [2025-02-08 05:37:26,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1370 events. 31/1370 cut-off events. For 93/105 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6672 event pairs, 2 based on Foata normal form. 4/1269 useless extension candidates. Maximal degree in co-relation 1679. Up to 73 conditions per place. [2025-02-08 05:37:26,602 INFO L140 encePairwiseOnDemand]: 518/523 looper letters, 29 selfloop transitions, 4 changer transitions 0/481 dead transitions. [2025-02-08 05:37:26,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 481 transitions, 1391 flow [2025-02-08 05:37:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2902 transitions. [2025-02-08 05:37:26,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247928616953474 [2025-02-08 05:37:26,604 INFO L175 Difference]: Start difference. First operand has 484 places, 474 transitions, 1303 flow. Second operand 6 states and 2902 transitions. [2025-02-08 05:37:26,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 481 transitions, 1391 flow [2025-02-08 05:37:26,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 481 transitions, 1389 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:26,611 INFO L231 Difference]: Finished difference. Result has 469 places, 473 transitions, 1307 flow [2025-02-08 05:37:26,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1307, PETRI_PLACES=469, PETRI_TRANSITIONS=473} [2025-02-08 05:37:26,612 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -19 predicate places. [2025-02-08 05:37:26,612 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 473 transitions, 1307 flow [2025-02-08 05:37:26,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 481.5) internal successors, (2889), 6 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:26,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:26,613 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:26,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:37:26,613 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:26,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1169399883, now seen corresponding path program 1 times [2025-02-08 05:37:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:26,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689439161] [2025-02-08 05:37:26,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:26,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:26,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-08 05:37:26,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-08 05:37:26,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:26,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-08 05:37:26,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:26,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689439161] [2025-02-08 05:37:26,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689439161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:26,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:26,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:26,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226477915] [2025-02-08 05:37:26,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:26,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:26,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:26,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:26,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 523 [2025-02-08 05:37:26,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 473 transitions, 1307 flow. Second operand has 3 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:26,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:26,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 523 [2025-02-08 05:37:26,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:26,941 INFO L124 PetriNetUnfolderBase]: 58/1826 cut-off events. [2025-02-08 05:37:26,942 INFO L125 PetriNetUnfolderBase]: For 97/99 co-relation queries the response was YES. [2025-02-08 05:37:26,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2192 conditions, 1826 events. 58/1826 cut-off events. For 97/99 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10466 event pairs, 12 based on Foata normal form. 0/1676 useless extension candidates. Maximal degree in co-relation 2147. Up to 100 conditions per place. [2025-02-08 05:37:26,953 INFO L140 encePairwiseOnDemand]: 519/523 looper letters, 13 selfloop transitions, 2 changer transitions 0/476 dead transitions. [2025-02-08 05:37:26,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 476 transitions, 1346 flow [2025-02-08 05:37:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1493 transitions. [2025-02-08 05:37:26,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515615041427661 [2025-02-08 05:37:26,956 INFO L175 Difference]: Start difference. First operand has 469 places, 473 transitions, 1307 flow. Second operand 3 states and 1493 transitions. [2025-02-08 05:37:26,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 476 transitions, 1346 flow [2025-02-08 05:37:26,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 476 transitions, 1339 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:26,963 INFO L231 Difference]: Finished difference. Result has 466 places, 473 transitions, 1310 flow [2025-02-08 05:37:26,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=466, PETRI_TRANSITIONS=473} [2025-02-08 05:37:26,964 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -22 predicate places. [2025-02-08 05:37:26,964 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 473 transitions, 1310 flow [2025-02-08 05:37:26,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:26,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:26,965 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:26,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:37:26,966 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:26,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:26,967 INFO L85 PathProgramCache]: Analyzing trace with hash 159975104, now seen corresponding path program 1 times [2025-02-08 05:37:26,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:26,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528082644] [2025-02-08 05:37:26,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:26,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:26,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-08 05:37:27,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-08 05:37:27,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-08 05:37:27,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528082644] [2025-02-08 05:37:27,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528082644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:37:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759164101] [2025-02-08 05:37:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:37:27,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:37:27,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:37:27,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 493 out of 523 [2025-02-08 05:37:27,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 473 transitions, 1310 flow. Second operand has 4 states, 4 states have (on average 494.75) internal successors, (1979), 4 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 493 of 523 [2025-02-08 05:37:27,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,311 INFO L124 PetriNetUnfolderBase]: 32/1421 cut-off events. [2025-02-08 05:37:27,311 INFO L125 PetriNetUnfolderBase]: For 100/102 co-relation queries the response was YES. [2025-02-08 05:37:27,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 1421 events. 32/1421 cut-off events. For 100/102 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6732 event pairs, 3 based on Foata normal form. 0/1323 useless extension candidates. Maximal degree in co-relation 1649. Up to 25 conditions per place. [2025-02-08 05:37:27,319 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 12 selfloop transitions, 2 changer transitions 0/474 dead transitions. [2025-02-08 05:37:27,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 474 transitions, 1342 flow [2025-02-08 05:37:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:37:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:37:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1987 transitions. [2025-02-08 05:37:27,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498087954110899 [2025-02-08 05:37:27,321 INFO L175 Difference]: Start difference. First operand has 466 places, 473 transitions, 1310 flow. Second operand 4 states and 1987 transitions. [2025-02-08 05:37:27,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 474 transitions, 1342 flow [2025-02-08 05:37:27,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 474 transitions, 1338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,328 INFO L231 Difference]: Finished difference. Result has 466 places, 470 transitions, 1302 flow [2025-02-08 05:37:27,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1302, PETRI_PLACES=466, PETRI_TRANSITIONS=470} [2025-02-08 05:37:27,329 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -22 predicate places. [2025-02-08 05:37:27,329 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 470 transitions, 1302 flow [2025-02-08 05:37:27,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 494.75) internal successors, (1979), 4 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,330 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:27,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:37:27,330 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:27,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,331 INFO L85 PathProgramCache]: Analyzing trace with hash 723611876, now seen corresponding path program 1 times [2025-02-08 05:37:27,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650852799] [2025-02-08 05:37:27,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-08 05:37:27,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-08 05:37:27,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-08 05:37:27,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650852799] [2025-02-08 05:37:27,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650852799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107281376] [2025-02-08 05:37:27,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 523 [2025-02-08 05:37:27,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 470 transitions, 1302 flow. Second operand has 3 states, 3 states have (on average 492.6666666666667) internal successors, (1478), 3 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 523 [2025-02-08 05:37:27,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,618 INFO L124 PetriNetUnfolderBase]: 35/1407 cut-off events. [2025-02-08 05:37:27,618 INFO L125 PetriNetUnfolderBase]: For 103/105 co-relation queries the response was YES. [2025-02-08 05:37:27,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 1407 events. 35/1407 cut-off events. For 103/105 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6724 event pairs, 12 based on Foata normal form. 0/1325 useless extension candidates. Maximal degree in co-relation 1311. Up to 50 conditions per place. [2025-02-08 05:37:27,634 INFO L140 encePairwiseOnDemand]: 520/523 looper letters, 10 selfloop transitions, 2 changer transitions 1/471 dead transitions. [2025-02-08 05:37:27,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 471 transitions, 1332 flow [2025-02-08 05:37:27,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-02-08 05:37:27,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9458253664754621 [2025-02-08 05:37:27,639 INFO L175 Difference]: Start difference. First operand has 466 places, 470 transitions, 1302 flow. Second operand 3 states and 1484 transitions. [2025-02-08 05:37:27,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 471 transitions, 1332 flow [2025-02-08 05:37:27,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 471 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,648 INFO L231 Difference]: Finished difference. Result has 465 places, 469 transitions, 1301 flow [2025-02-08 05:37:27,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1301, PETRI_PLACES=465, PETRI_TRANSITIONS=469} [2025-02-08 05:37:27,650 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -23 predicate places. [2025-02-08 05:37:27,650 INFO L471 AbstractCegarLoop]: Abstraction has has 465 places, 469 transitions, 1301 flow [2025-02-08 05:37:27,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 492.6666666666667) internal successors, (1478), 3 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,651 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:27,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:37:27,651 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:27,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1016181855, now seen corresponding path program 1 times [2025-02-08 05:37:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021470903] [2025-02-08 05:37:27,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-08 05:37:27,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-08 05:37:27,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-08 05:37:28,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021470903] [2025-02-08 05:37:28,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021470903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:28,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761332578] [2025-02-08 05:37:28,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:28,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:28,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:28,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 523 [2025-02-08 05:37:28,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 469 transitions, 1301 flow. Second operand has 6 states, 6 states have (on average 481.8333333333333) internal successors, (2891), 6 states have internal predecessors, (2891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 523 [2025-02-08 05:37:28,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,657 INFO L124 PetriNetUnfolderBase]: 35/1388 cut-off events. [2025-02-08 05:37:28,657 INFO L125 PetriNetUnfolderBase]: For 103/105 co-relation queries the response was YES. [2025-02-08 05:37:28,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1388 events. 35/1388 cut-off events. For 103/105 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6523 event pairs, 3 based on Foata normal form. 0/1308 useless extension candidates. Maximal degree in co-relation 1755. Up to 79 conditions per place. [2025-02-08 05:37:28,666 INFO L140 encePairwiseOnDemand]: 518/523 looper letters, 29 selfloop transitions, 4 changer transitions 0/476 dead transitions. [2025-02-08 05:37:28,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 476 transitions, 1389 flow [2025-02-08 05:37:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2902 transitions. [2025-02-08 05:37:28,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247928616953474 [2025-02-08 05:37:28,668 INFO L175 Difference]: Start difference. First operand has 465 places, 469 transitions, 1301 flow. Second operand 6 states and 2902 transitions. [2025-02-08 05:37:28,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 476 transitions, 1389 flow [2025-02-08 05:37:28,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 476 transitions, 1385 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,674 INFO L231 Difference]: Finished difference. Result has 467 places, 468 transitions, 1303 flow [2025-02-08 05:37:28,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1303, PETRI_PLACES=467, PETRI_TRANSITIONS=468} [2025-02-08 05:37:28,675 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -21 predicate places. [2025-02-08 05:37:28,675 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 468 transitions, 1303 flow [2025-02-08 05:37:28,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 481.8333333333333) internal successors, (2891), 6 states have internal predecessors, (2891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,675 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:28,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:37:28,675 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:28,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1382457906, now seen corresponding path program 1 times [2025-02-08 05:37:28,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363454261] [2025-02-08 05:37:28,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-02-08 05:37:28,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-02-08 05:37:28,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-08 05:37:29,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363454261] [2025-02-08 05:37:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363454261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:29,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:29,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857389451] [2025-02-08 05:37:29,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:29,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:29,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:29,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:29,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:29,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 523 [2025-02-08 05:37:29,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 468 transitions, 1303 flow. Second operand has 6 states, 6 states have (on average 481.6666666666667) internal successors, (2890), 6 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:29,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:29,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 523 [2025-02-08 05:37:29,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:29,825 INFO L124 PetriNetUnfolderBase]: 41/1559 cut-off events. [2025-02-08 05:37:29,825 INFO L125 PetriNetUnfolderBase]: For 91/94 co-relation queries the response was YES. [2025-02-08 05:37:29,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1559 events. 41/1559 cut-off events. For 91/94 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8203 event pairs, 3 based on Foata normal form. 0/1467 useless extension candidates. Maximal degree in co-relation 1482. Up to 76 conditions per place. [2025-02-08 05:37:29,836 INFO L140 encePairwiseOnDemand]: 518/523 looper letters, 29 selfloop transitions, 4 changer transitions 0/475 dead transitions. [2025-02-08 05:37:29,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 475 transitions, 1391 flow [2025-02-08 05:37:29,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2902 transitions. [2025-02-08 05:37:29,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247928616953474 [2025-02-08 05:37:29,838 INFO L175 Difference]: Start difference. First operand has 467 places, 468 transitions, 1303 flow. Second operand 6 states and 2902 transitions. [2025-02-08 05:37:29,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 475 transitions, 1391 flow [2025-02-08 05:37:29,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 475 transitions, 1384 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:29,846 INFO L231 Difference]: Finished difference. Result has 467 places, 467 transitions, 1302 flow [2025-02-08 05:37:29,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1302, PETRI_PLACES=467, PETRI_TRANSITIONS=467} [2025-02-08 05:37:29,847 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -21 predicate places. [2025-02-08 05:37:29,847 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 467 transitions, 1302 flow [2025-02-08 05:37:29,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 481.6666666666667) internal successors, (2890), 6 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:29,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:29,848 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:29,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:37:29,848 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-02-08 05:37:29,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:29,849 INFO L85 PathProgramCache]: Analyzing trace with hash -569201914, now seen corresponding path program 1 times [2025-02-08 05:37:29,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:29,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130836321] [2025-02-08 05:37:29,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:29,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-02-08 05:37:29,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-02-08 05:37:29,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:29,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-08 05:37:30,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130836321] [2025-02-08 05:37:30,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130836321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:30,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776102706] [2025-02-08 05:37:30,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:30,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:30,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:30,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 523 [2025-02-08 05:37:30,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 467 transitions, 1302 flow. Second operand has 6 states, 6 states have (on average 481.8333333333333) internal successors, (2891), 6 states have internal predecessors, (2891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 523 [2025-02-08 05:37:30,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,865 INFO L124 PetriNetUnfolderBase]: 40/1374 cut-off events. [2025-02-08 05:37:30,865 INFO L125 PetriNetUnfolderBase]: For 108/110 co-relation queries the response was YES. [2025-02-08 05:37:30,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1862 conditions, 1374 events. 40/1374 cut-off events. For 108/110 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6524 event pairs, 3 based on Foata normal form. 0/1313 useless extension candidates. Maximal degree in co-relation 1759. Up to 79 conditions per place. [2025-02-08 05:37:30,871 INFO L140 encePairwiseOnDemand]: 518/523 looper letters, 0 selfloop transitions, 0 changer transitions 474/474 dead transitions. [2025-02-08 05:37:30,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 474 transitions, 1390 flow [2025-02-08 05:37:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2902 transitions. [2025-02-08 05:37:30,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247928616953474 [2025-02-08 05:37:30,873 INFO L175 Difference]: Start difference. First operand has 467 places, 467 transitions, 1302 flow. Second operand 6 states and 2902 transitions. [2025-02-08 05:37:30,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 474 transitions, 1390 flow [2025-02-08 05:37:30,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 474 transitions, 1383 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:30,877 INFO L231 Difference]: Finished difference. Result has 467 places, 0 transitions, 0 flow [2025-02-08 05:37:30,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=523, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=467, PETRI_TRANSITIONS=0} [2025-02-08 05:37:30,877 INFO L279 CegarLoopForPetriNet]: 488 programPoint places, -21 predicate places. [2025-02-08 05:37:30,877 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 0 transitions, 0 flow [2025-02-08 05:37:30,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 481.8333333333333) internal successors, (2891), 6 states have internal predecessors, (2891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-02-08 05:37:30,881 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-02-08 05:37:30,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-02-08 05:37:30,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-02-08 05:37:30,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-02-08 05:37:30,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-02-08 05:37:30,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-02-08 05:37:30,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:37:30,883 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:30,887 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:30,887 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:30,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:30 BasicIcfg [2025-02-08 05:37:30,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:30,892 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:30,892 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:30,892 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:30,893 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:11" (3/4) ... [2025-02-08 05:37:30,894 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:30,896 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:30,896 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:30,896 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:30,902 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-02-08 05:37:30,902 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:30,902 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:30,902 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:30,989 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:30,989 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:30,989 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:30,990 INFO L158 Benchmark]: Toolchain (without parser) took 20620.82ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 157.8MB in the beginning and 1.0GB in the end (delta: -850.2MB). Peak memory consumption was 155.5MB. Max. memory is 16.1GB. [2025-02-08 05:37:30,990 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:30,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.08ms. Allocated memory is still 201.3MB. Free memory was 157.8MB in the beginning and 144.5MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:30,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.16ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 140.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:30,991 INFO L158 Benchmark]: Boogie Preprocessor took 31.59ms. Allocated memory is still 201.3MB. Free memory was 140.9MB in the beginning and 138.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:30,992 INFO L158 Benchmark]: IcfgBuilder took 721.99ms. Allocated memory is still 201.3MB. Free memory was 138.4MB in the beginning and 97.4MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:37:30,992 INFO L158 Benchmark]: TraceAbstraction took 19473.40ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 96.8MB in the beginning and 1.0GB in the end (delta: -919.6MB). Peak memory consumption was 767.9MB. Max. memory is 16.1GB. [2025-02-08 05:37:30,992 INFO L158 Benchmark]: Witness Printer took 97.36ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:30,993 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.36ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.08ms. Allocated memory is still 201.3MB. Free memory was 157.8MB in the beginning and 144.5MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.16ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 140.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.59ms. Allocated memory is still 201.3MB. Free memory was 140.9MB in the beginning and 138.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 721.99ms. Allocated memory is still 201.3MB. Free memory was 138.4MB in the beginning and 97.4MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19473.40ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 96.8MB in the beginning and 1.0GB in the end (delta: -919.6MB). Peak memory consumption was 767.9MB. Max. memory is 16.1GB. * Witness Printer took 97.36ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 1.0GB 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: 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 68]: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: 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: 121]: 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: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: 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 7 procedures, 743 locations, 71 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: 19.3s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3523 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2360 mSDsluCounter, 1368 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1111 mSDsCounter, 708 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6742 IncrementalHoareTripleChecker+Invalid, 7450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 708 mSolverCounterUnsat, 257 mSDtfsCounter, 6742 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1198 GetRequests, 1075 SyntacticMatches, 5 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1415occurred in iteration=25, InterpolantAutomatonStates: 150, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 8929 NumberOfCodeBlocks, 8569 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 9419 ConstructedInterpolants, 0 QuantifiedInterpolants, 11475 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 38 InterpolantComputations, 32 PerfectInterpolantSequences, 5346/5493 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 47 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:31,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE