./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-trans.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-trans.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 f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:15,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:15,521 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:15,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:15,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:15,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:15,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:15,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:15,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:15,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:15,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:15,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:15,540 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:15,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:15,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:15,540 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:15,541 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:15,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:15,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:15,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:15,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:15,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:15,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:15,543 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:15,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:15,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:15,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:15,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:15,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:15,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:15,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:15,543 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 -> f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 [2025-02-08 05:37:15,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:15,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:15,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:15,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:15,796 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:15,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-02-08 05:37:17,019 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7370ab382/b5dde9e45f354fbb9eae18d9430463c7/FLAGf8debba80 [2025-02-08 05:37:17,294 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:17,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-02-08 05:37:17,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7370ab382/b5dde9e45f354fbb9eae18d9430463c7/FLAGf8debba80 [2025-02-08 05:37:17,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7370ab382/b5dde9e45f354fbb9eae18d9430463c7 [2025-02-08 05:37:17,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:17,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:17,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:17,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:17,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:17,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:17" (1/1) ... [2025-02-08 05:37:17,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40242edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:17, skipping insertion in model container [2025-02-08 05:37:17,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:17" (1/1) ... [2025-02-08 05:37:17,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:17,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:17,792 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:17,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:17,831 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:17,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:17 WrapperNode [2025-02-08 05:37:17,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:17,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:17,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:17,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:17,836 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:17" (1/1) ... [2025-02-08 05:37:17,845 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:17" (1/1) ... [2025-02-08 05:37:17,876 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 424 [2025-02-08 05:37:17,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:17,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:17,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:17,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:17,884 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:17" (1/1) ... [2025-02-08 05:37:17,884 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:17" (1/1) ... [2025-02-08 05:37:17,892 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:17" (1/1) ... [2025-02-08 05:37:17,893 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:17" (1/1) ... [2025-02-08 05:37:17,909 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:17" (1/1) ... [2025-02-08 05:37:17,911 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:17" (1/1) ... [2025-02-08 05:37:17,912 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:17" (1/1) ... [2025-02-08 05:37:17,913 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:17" (1/1) ... [2025-02-08 05:37:17,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:17,921 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:17,922 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:17,922 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:17,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:17" (1/1) ... [2025-02-08 05:37:17,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:17,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:17,948 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:17,952 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:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:17,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:17,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:17,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:17,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:17,971 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:18,072 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:18,074 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:18,237 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54: havoc #t~nondet5#1; [2025-02-08 05:37:18,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-1: havoc #t~ret4#1; [2025-02-08 05:37:18,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-2: havoc #t~mem3#1; [2025-02-08 05:37:18,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-3: assume #race~result_7~0 == #t~nondet5#1; [2025-02-08 05:37:18,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-3: assume !(#race~result_7~0 == #t~nondet5#1); [2025-02-08 05:37:18,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-4: havoc #t~mem2#1; [2025-02-08 05:37:18,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-5: #race~result_7~0 := #t~nondet5#1; [2025-02-08 05:37:18,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-6: havoc #t~nondet5#1; [2025-02-08 05:37:18,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-7: ~result_7~0 := #t~ret4#1; [2025-02-08 05:37:18,238 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:18,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:18,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:18,238 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-11: #t~ret4#1 := minus_#res#1; [2025-02-08 05:37:18,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume 0 == #race~result_7~0; [2025-02-08 05:37:18,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume !(0 == #race~result_7~0); [2025-02-08 05:37:18,239 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:18,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: #race~result_7~0 := 0; [2025-02-08 05:37:18,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~post6#1; [2025-02-08 05:37:18,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: ~i~0#1 := 1 + #t~post6#1; [2025-02-08 05:37:18,239 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: #t~post6#1 := ~i~0#1; [2025-02-08 05:37:18,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: assume #race~result_10~0 == #t~nondet13#1; [2025-02-08 05:37:18,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: assume !(#race~result_10~0 == #t~nondet13#1); [2025-02-08 05:37:18,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-4: havoc #t~mem10#1; [2025-02-08 05:37:18,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-5: #race~result_10~0 := #t~nondet13#1; [2025-02-08 05:37:18,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-6: havoc #t~nondet13#1; [2025-02-08 05:37:18,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-7: ~result_10~0 := #t~ret12#1; [2025-02-08 05:37:18,371 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:18,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:18,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:18,371 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-11: #t~ret12#1 := minus_#res#1; [2025-02-08 05:37:18,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: assume 0 == #race~result_10~0; [2025-02-08 05:37:18,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: assume !(0 == #race~result_10~0); [2025-02-08 05:37:18,372 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:18,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-2: #race~result_10~0 := 0; [2025-02-08 05:37:18,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~post14#1; [2025-02-08 05:37:18,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: ~i~1#1 := 1 + #t~post14#1; [2025-02-08 05:37:18,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: #t~post14#1 := ~i~1#1; [2025-02-08 05:37:18,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68: havoc #t~nondet13#1; [2025-02-08 05:37:18,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-1: havoc #t~ret12#1; [2025-02-08 05:37:18,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-2: havoc #t~mem11#1; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: havoc #t~nondet21#1; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-1: havoc #t~ret20#1; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-2: havoc #t~mem19#1; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-3: assume #race~result_13~0 == #t~nondet21#1; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-3: assume !(#race~result_13~0 == #t~nondet21#1); [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-4: havoc #t~mem18#1; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-5: #race~result_13~0 := #t~nondet21#1; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-6: havoc #t~nondet21#1; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-7: ~result_13~0 := #t~ret20#1; [2025-02-08 05:37:18,477 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:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-11: #t~ret20#1 := minus_#res#1; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: assume 0 == #race~result_13~0; [2025-02-08 05:37:18,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: assume !(0 == #race~result_13~0); [2025-02-08 05:37:18,478 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:18,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-2: #race~result_13~0 := 0; [2025-02-08 05:37:18,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L84: havoc #t~post22#1; [2025-02-08 05:37:18,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L84-1: ~i~2#1 := 1 + #t~post22#1; [2025-02-08 05:37:18,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L84-2: #t~post22#1 := ~i~2#1; [2025-02-08 05:37:18,660 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:18,660 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:18,673 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:18,673 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:18,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:18 BoogieIcfgContainer [2025-02-08 05:37:18,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:18,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:18,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:18,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:18,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:17" (1/3) ... [2025-02-08 05:37:18,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694e27d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:18, skipping insertion in model container [2025-02-08 05:37:18,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:17" (2/3) ... [2025-02-08 05:37:18,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694e27d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:18, skipping insertion in model container [2025-02-08 05:37:18,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:18" (3/3) ... [2025-02-08 05:37:18,680 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2025-02-08 05:37:18,689 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:18,690 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-trans.wvr.c that has 4 procedures, 491 locations, 1 initial locations, 6 loop locations, and 45 error locations. [2025-02-08 05:37:18,690 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:18,785 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:18,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 500 places, 514 transitions, 1049 flow [2025-02-08 05:37:18,959 INFO L124 PetriNetUnfolderBase]: 24/511 cut-off events. [2025-02-08 05:37:18,961 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:18,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 511 events. 24/511 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1072 event pairs, 0 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 391. Up to 2 conditions per place. [2025-02-08 05:37:18,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 500 places, 514 transitions, 1049 flow [2025-02-08 05:37:18,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 478 places, 490 transitions, 998 flow [2025-02-08 05:37:18,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:18,993 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;@2827c4a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:18,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 05:37:19,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:19,006 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2025-02-08 05:37:19,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:19,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:19,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] [2025-02-08 05:37:19,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:19,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 394136464, now seen corresponding path program 1 times [2025-02-08 05:37:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:19,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177119834] [2025-02-08 05:37:19,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:19,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:37:19,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:37:19,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:19,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:19,690 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:19,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:19,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177119834] [2025-02-08 05:37:19,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177119834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:19,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:19,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:19,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224733064] [2025-02-08 05:37:19,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:19,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:19,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:19,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:19,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:20,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 514 [2025-02-08 05:37:20,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 490 transitions, 998 flow. Second operand has 6 states, 6 states have (on average 426.5) internal successors, (2559), 6 states have internal predecessors, (2559), 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,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:20,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 514 [2025-02-08 05:37:20,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,365 INFO L124 PetriNetUnfolderBase]: 1531/7513 cut-off events. [2025-02-08 05:37:21,367 INFO L125 PetriNetUnfolderBase]: For 358/360 co-relation queries the response was YES. [2025-02-08 05:37:21,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10260 conditions, 7513 events. 1531/7513 cut-off events. For 358/360 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 79027 event pairs, 1520 based on Foata normal form. 641/7165 useless extension candidates. Maximal degree in co-relation 9015. Up to 2455 conditions per place. [2025-02-08 05:37:21,431 INFO L140 encePairwiseOnDemand]: 481/514 looper letters, 54 selfloop transitions, 15 changer transitions 6/472 dead transitions. [2025-02-08 05:37:21,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 472 transitions, 1100 flow [2025-02-08 05:37:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-02-08 05:37:21,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8550583657587548 [2025-02-08 05:37:21,453 INFO L175 Difference]: Start difference. First operand has 478 places, 490 transitions, 998 flow. Second operand 6 states and 2637 transitions. [2025-02-08 05:37:21,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 472 transitions, 1100 flow [2025-02-08 05:37:21,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 472 transitions, 1088 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:21,465 INFO L231 Difference]: Finished difference. Result has 474 places, 466 transitions, 968 flow [2025-02-08 05:37:21,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=968, PETRI_PLACES=474, PETRI_TRANSITIONS=466} [2025-02-08 05:37:21,470 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -4 predicate places. [2025-02-08 05:37:21,470 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 466 transitions, 968 flow [2025-02-08 05:37:21,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 426.5) internal successors, (2559), 6 states have internal predecessors, (2559), 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,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,471 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:21,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:21,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:21,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash -226155504, now seen corresponding path program 1 times [2025-02-08 05:37:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462701319] [2025-02-08 05:37:21,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:37:21,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:37:21,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,502 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:21,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462701319] [2025-02-08 05:37:21,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462701319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067499354] [2025-02-08 05:37:21,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 514 [2025-02-08 05:37:21,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 466 transitions, 968 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 514 [2025-02-08 05:37:21,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,607 INFO L124 PetriNetUnfolderBase]: 14/641 cut-off events. [2025-02-08 05:37:21,607 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:21,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 641 events. 14/641 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2228 event pairs, 5 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 639. Up to 22 conditions per place. [2025-02-08 05:37:21,614 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 11 selfloop transitions, 2 changer transitions 0/465 dead transitions. [2025-02-08 05:37:21,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 465 transitions, 992 flow [2025-02-08 05:37:21,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-02-08 05:37:21,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468223086900129 [2025-02-08 05:37:21,617 INFO L175 Difference]: Start difference. First operand has 474 places, 466 transitions, 968 flow. Second operand 3 states and 1460 transitions. [2025-02-08 05:37:21,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 465 transitions, 992 flow [2025-02-08 05:37:21,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 465 transitions, 962 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:21,624 INFO L231 Difference]: Finished difference. Result has 464 places, 465 transitions, 940 flow [2025-02-08 05:37:21,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=462, 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=940, PETRI_PLACES=464, PETRI_TRANSITIONS=465} [2025-02-08 05:37:21,625 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -14 predicate places. [2025-02-08 05:37:21,625 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 465 transitions, 940 flow [2025-02-08 05:37:21,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,626 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:21,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:21,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:21,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1422156568, now seen corresponding path program 1 times [2025-02-08 05:37:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784270989] [2025-02-08 05:37:21,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:37:21,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:37:21,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,666 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:21,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784270989] [2025-02-08 05:37:21,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784270989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556045705] [2025-02-08 05:37:21,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 514 [2025-02-08 05:37:21,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 465 transitions, 940 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 514 [2025-02-08 05:37:21,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,790 INFO L124 PetriNetUnfolderBase]: 18/807 cut-off events. [2025-02-08 05:37:21,790 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-08 05:37:21,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 807 events. 18/807 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3108 event pairs, 7 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 772. Up to 25 conditions per place. [2025-02-08 05:37:21,797 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 11 selfloop transitions, 2 changer transitions 0/464 dead transitions. [2025-02-08 05:37:21,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 464 transitions, 964 flow [2025-02-08 05:37:21,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-02-08 05:37:21,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468223086900129 [2025-02-08 05:37:21,800 INFO L175 Difference]: Start difference. First operand has 464 places, 465 transitions, 940 flow. Second operand 3 states and 1460 transitions. [2025-02-08 05:37:21,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 464 transitions, 964 flow [2025-02-08 05:37:21,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 464 transitions, 960 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:21,806 INFO L231 Difference]: Finished difference. Result has 463 places, 464 transitions, 938 flow [2025-02-08 05:37:21,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=461, 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=938, PETRI_PLACES=463, PETRI_TRANSITIONS=464} [2025-02-08 05:37:21,807 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -15 predicate places. [2025-02-08 05:37:21,807 INFO L471 AbstractCegarLoop]: Abstraction has has 463 places, 464 transitions, 938 flow [2025-02-08 05:37:21,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,808 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:21,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:21,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash -279060408, now seen corresponding path program 1 times [2025-02-08 05:37:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582295752] [2025-02-08 05:37:21,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:37:21,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:37:21,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,879 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:21,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582295752] [2025-02-08 05:37:21,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582295752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639785506] [2025-02-08 05:37:21,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 514 [2025-02-08 05:37:21,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 464 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 514 [2025-02-08 05:37:21,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,976 INFO L124 PetriNetUnfolderBase]: 15/557 cut-off events. [2025-02-08 05:37:21,976 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:21,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 557 events. 15/557 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1610 event pairs, 7 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 472. Up to 25 conditions per place. [2025-02-08 05:37:21,982 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 11 selfloop transitions, 2 changer transitions 0/463 dead transitions. [2025-02-08 05:37:21,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 463 transitions, 962 flow [2025-02-08 05:37:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-02-08 05:37:21,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468223086900129 [2025-02-08 05:37:21,990 INFO L175 Difference]: Start difference. First operand has 463 places, 464 transitions, 938 flow. Second operand 3 states and 1460 transitions. [2025-02-08 05:37:21,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 463 transitions, 962 flow [2025-02-08 05:37:21,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 463 transitions, 958 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:21,998 INFO L231 Difference]: Finished difference. Result has 462 places, 463 transitions, 936 flow [2025-02-08 05:37:21,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=462, PETRI_TRANSITIONS=463} [2025-02-08 05:37:22,000 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -16 predicate places. [2025-02-08 05:37:22,001 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 463 transitions, 936 flow [2025-02-08 05:37:22,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,002 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:22,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:22,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:22,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash 777907737, now seen corresponding path program 1 times [2025-02-08 05:37:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061464932] [2025-02-08 05:37:22,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:22,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:22,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,107 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:22,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061464932] [2025-02-08 05:37:22,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061464932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:22,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:22,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:22,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456351481] [2025-02-08 05:37:22,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:22,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:22,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 514 [2025-02-08 05:37:22,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 463 transitions, 936 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:22,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 514 [2025-02-08 05:37:22,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,251 INFO L124 PetriNetUnfolderBase]: 15/706 cut-off events. [2025-02-08 05:37:22,251 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:22,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 706 events. 15/706 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2784 event pairs, 5 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 572. Up to 22 conditions per place. [2025-02-08 05:37:22,257 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 11 selfloop transitions, 2 changer transitions 0/462 dead transitions. [2025-02-08 05:37:22,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 462 transitions, 960 flow [2025-02-08 05:37:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-02-08 05:37:22,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468223086900129 [2025-02-08 05:37:22,260 INFO L175 Difference]: Start difference. First operand has 462 places, 463 transitions, 936 flow. Second operand 3 states and 1460 transitions. [2025-02-08 05:37:22,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 462 transitions, 960 flow [2025-02-08 05:37:22,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 462 transitions, 956 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:22,266 INFO L231 Difference]: Finished difference. Result has 461 places, 462 transitions, 934 flow [2025-02-08 05:37:22,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=459, 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=3, PETRI_FLOW=934, PETRI_PLACES=461, PETRI_TRANSITIONS=462} [2025-02-08 05:37:22,269 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -17 predicate places. [2025-02-08 05:37:22,269 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 462 transitions, 934 flow [2025-02-08 05:37:22,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,270 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:22,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:22,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:22,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,270 INFO L85 PathProgramCache]: Analyzing trace with hash 661170889, now seen corresponding path program 1 times [2025-02-08 05:37:22,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111628543] [2025-02-08 05:37:22,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 05:37:22,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 05:37:22,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,322 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:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111628543] [2025-02-08 05:37:22,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111628543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:22,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:22,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931079616] [2025-02-08 05:37:22,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:22,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:22,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:22,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 514 [2025-02-08 05:37:22,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 462 transitions, 934 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:22,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 514 [2025-02-08 05:37:22,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,419 INFO L124 PetriNetUnfolderBase]: 19/874 cut-off events. [2025-02-08 05:37:22,420 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-02-08 05:37:22,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 874 events. 19/874 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3802 event pairs, 7 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 737. Up to 25 conditions per place. [2025-02-08 05:37:22,428 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 11 selfloop transitions, 2 changer transitions 0/461 dead transitions. [2025-02-08 05:37:22,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 461 transitions, 958 flow [2025-02-08 05:37:22,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-02-08 05:37:22,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468223086900129 [2025-02-08 05:37:22,431 INFO L175 Difference]: Start difference. First operand has 461 places, 462 transitions, 934 flow. Second operand 3 states and 1460 transitions. [2025-02-08 05:37:22,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 461 transitions, 958 flow [2025-02-08 05:37:22,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 461 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:22,436 INFO L231 Difference]: Finished difference. Result has 460 places, 461 transitions, 932 flow [2025-02-08 05:37:22,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=932, PETRI_PLACES=460, PETRI_TRANSITIONS=461} [2025-02-08 05:37:22,437 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -18 predicate places. [2025-02-08 05:37:22,437 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 461 transitions, 932 flow [2025-02-08 05:37:22,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,438 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:22,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:22,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:22,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,439 INFO L85 PathProgramCache]: Analyzing trace with hash -674636384, now seen corresponding path program 1 times [2025-02-08 05:37:22,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623631103] [2025-02-08 05:37:22,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-08 05:37:22,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-08 05:37:22,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,479 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:22,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623631103] [2025-02-08 05:37:22,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623631103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:22,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:22,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:22,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139272584] [2025-02-08 05:37:22,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:22,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:22,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:22,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 514 [2025-02-08 05:37:22,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 461 transitions, 932 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:22,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 514 [2025-02-08 05:37:22,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,562 INFO L124 PetriNetUnfolderBase]: 18/758 cut-off events. [2025-02-08 05:37:22,562 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-02-08 05:37:22,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 758 events. 18/758 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2491 event pairs, 7 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 610. Up to 25 conditions per place. [2025-02-08 05:37:22,568 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 11 selfloop transitions, 2 changer transitions 0/460 dead transitions. [2025-02-08 05:37:22,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 460 transitions, 956 flow [2025-02-08 05:37:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-02-08 05:37:22,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468223086900129 [2025-02-08 05:37:22,571 INFO L175 Difference]: Start difference. First operand has 460 places, 461 transitions, 932 flow. Second operand 3 states and 1460 transitions. [2025-02-08 05:37:22,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 460 transitions, 956 flow [2025-02-08 05:37:22,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 460 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:22,576 INFO L231 Difference]: Finished difference. Result has 459 places, 460 transitions, 930 flow [2025-02-08 05:37:22,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=459, PETRI_TRANSITIONS=460} [2025-02-08 05:37:22,577 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -19 predicate places. [2025-02-08 05:37:22,577 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 460 transitions, 930 flow [2025-02-08 05:37:22,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 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,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,578 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:22,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:22,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:22,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash 931742351, now seen corresponding path program 1 times [2025-02-08 05:37:22,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761379063] [2025-02-08 05:37:22,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 05:37:22,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 05:37:22,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,618 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:22,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761379063] [2025-02-08 05:37:22,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761379063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:22,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:22,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:22,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014923554] [2025-02-08 05:37:22,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:22,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:22,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:22,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 514 [2025-02-08 05:37:22,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 460 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 485.3333333333333) internal successors, (1456), 3 states have internal predecessors, (1456), 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,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:22,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 514 [2025-02-08 05:37:22,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,745 INFO L124 PetriNetUnfolderBase]: 26/1026 cut-off events. [2025-02-08 05:37:22,745 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:22,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 1026 events. 26/1026 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5250 event pairs, 8 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 882. Up to 31 conditions per place. [2025-02-08 05:37:22,751 INFO L140 encePairwiseOnDemand]: 510/514 looper letters, 13 selfloop transitions, 2 changer transitions 0/462 dead transitions. [2025-02-08 05:37:22,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 462 transitions, 966 flow [2025-02-08 05:37:22,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1469 transitions. [2025-02-08 05:37:22,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9526588845654993 [2025-02-08 05:37:22,754 INFO L175 Difference]: Start difference. First operand has 459 places, 460 transitions, 930 flow. Second operand 3 states and 1469 transitions. [2025-02-08 05:37:22,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 462 transitions, 966 flow [2025-02-08 05:37:22,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 462 transitions, 962 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:22,760 INFO L231 Difference]: Finished difference. Result has 458 places, 460 transitions, 936 flow [2025-02-08 05:37:22,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=458, PETRI_TRANSITIONS=460} [2025-02-08 05:37:22,762 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -20 predicate places. [2025-02-08 05:37:22,762 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 460 transitions, 936 flow [2025-02-08 05:37:22,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.3333333333333) internal successors, (1456), 3 states have internal predecessors, (1456), 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,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:22,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:22,763 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:22,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,763 INFO L85 PathProgramCache]: Analyzing trace with hash -836216847, now seen corresponding path program 1 times [2025-02-08 05:37:22,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438534294] [2025-02-08 05:37:22,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:37:22,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:37:22,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,802 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:22,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438534294] [2025-02-08 05:37:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438534294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:22,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:22,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539414519] [2025-02-08 05:37:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:22,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:22,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:22,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 514 [2025-02-08 05:37:22,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 460 transitions, 936 flow. Second operand has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 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,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:22,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 514 [2025-02-08 05:37:22,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,921 INFO L124 PetriNetUnfolderBase]: 41/1360 cut-off events. [2025-02-08 05:37:22,922 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:22,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 1360 events. 41/1360 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 9027 event pairs, 11 based on Foata normal form. 0/1170 useless extension candidates. Maximal degree in co-relation 1071. Up to 43 conditions per place. [2025-02-08 05:37:22,931 INFO L140 encePairwiseOnDemand]: 510/514 looper letters, 13 selfloop transitions, 2 changer transitions 0/462 dead transitions. [2025-02-08 05:37:22,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 462 transitions, 972 flow [2025-02-08 05:37:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1469 transitions. [2025-02-08 05:37:22,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9526588845654993 [2025-02-08 05:37:22,934 INFO L175 Difference]: Start difference. First operand has 458 places, 460 transitions, 936 flow. Second operand 3 states and 1469 transitions. [2025-02-08 05:37:22,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 462 transitions, 972 flow [2025-02-08 05:37:22,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 462 transitions, 972 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:22,939 INFO L231 Difference]: Finished difference. Result has 459 places, 460 transitions, 946 flow [2025-02-08 05:37:22,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=459, PETRI_TRANSITIONS=460} [2025-02-08 05:37:22,940 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -19 predicate places. [2025-02-08 05:37:22,940 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 460 transitions, 946 flow [2025-02-08 05:37:22,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 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,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,941 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:22,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:22,941 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:22,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1751352228, now seen corresponding path program 1 times [2025-02-08 05:37:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110096114] [2025-02-08 05:37:22,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 05:37:22,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 05:37:22,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,981 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:22,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110096114] [2025-02-08 05:37:22,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110096114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:22,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:22,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:22,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683289650] [2025-02-08 05:37:22,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:22,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:22,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 514 [2025-02-08 05:37:22,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 460 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 484.3333333333333) internal successors, (1453), 3 states have internal predecessors, (1453), 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,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:22,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 514 [2025-02-08 05:37:22,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:23,085 INFO L124 PetriNetUnfolderBase]: 35/979 cut-off events. [2025-02-08 05:37:23,085 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:23,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 979 events. 35/979 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5157 event pairs, 12 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 794. Up to 41 conditions per place. [2025-02-08 05:37:23,093 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 13 selfloop transitions, 2 changer transitions 0/461 dead transitions. [2025-02-08 05:37:23,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 461 transitions, 980 flow [2025-02-08 05:37:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1465 transitions. [2025-02-08 05:37:23,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9500648508430609 [2025-02-08 05:37:23,096 INFO L175 Difference]: Start difference. First operand has 459 places, 460 transitions, 946 flow. Second operand 3 states and 1465 transitions. [2025-02-08 05:37:23,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 461 transitions, 980 flow [2025-02-08 05:37:23,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 461 transitions, 980 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:23,101 INFO L231 Difference]: Finished difference. Result has 460 places, 459 transitions, 948 flow [2025-02-08 05:37:23,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=460, PETRI_TRANSITIONS=459} [2025-02-08 05:37:23,102 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -18 predicate places. [2025-02-08 05:37:23,102 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 459 transitions, 948 flow [2025-02-08 05:37:23,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 484.3333333333333) internal successors, (1453), 3 states have internal predecessors, (1453), 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,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:23,103 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:23,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:23,103 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:23,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:23,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1947668982, now seen corresponding path program 1 times [2025-02-08 05:37:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:23,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030499257] [2025-02-08 05:37:23,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:23,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 05:37:23,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 05:37:23,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:23,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:23,143 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:23,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:23,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030499257] [2025-02-08 05:37:23,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030499257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:23,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:23,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:23,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690865415] [2025-02-08 05:37:23,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:23,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:23,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:23,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:23,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:23,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 514 [2025-02-08 05:37:23,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 459 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 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,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:23,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 514 [2025-02-08 05:37:23,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:23,321 INFO L124 PetriNetUnfolderBase]: 50/1506 cut-off events. [2025-02-08 05:37:23,322 INFO L125 PetriNetUnfolderBase]: For 16/21 co-relation queries the response was YES. [2025-02-08 05:37:23,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 1506 events. 50/1506 cut-off events. For 16/21 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 9313 event pairs, 15 based on Foata normal form. 0/1288 useless extension candidates. Maximal degree in co-relation 1236. Up to 56 conditions per place. [2025-02-08 05:37:23,331 INFO L140 encePairwiseOnDemand]: 510/514 looper letters, 13 selfloop transitions, 2 changer transitions 0/461 dead transitions. [2025-02-08 05:37:23,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 461 transitions, 984 flow [2025-02-08 05:37:23,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1469 transitions. [2025-02-08 05:37:23,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9526588845654993 [2025-02-08 05:37:23,334 INFO L175 Difference]: Start difference. First operand has 460 places, 459 transitions, 948 flow. Second operand 3 states and 1469 transitions. [2025-02-08 05:37:23,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 461 transitions, 984 flow [2025-02-08 05:37:23,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 461 transitions, 980 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:23,339 INFO L231 Difference]: Finished difference. Result has 459 places, 459 transitions, 954 flow [2025-02-08 05:37:23,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=459, PETRI_TRANSITIONS=459} [2025-02-08 05:37:23,340 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -19 predicate places. [2025-02-08 05:37:23,340 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 459 transitions, 954 flow [2025-02-08 05:37:23,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 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,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:23,341 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:23,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:23,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:23,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1023643836, now seen corresponding path program 1 times [2025-02-08 05:37:23,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:23,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590590350] [2025-02-08 05:37:23,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:23,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:23,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 05:37:23,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 05:37:23,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:23,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:23,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:23,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590590350] [2025-02-08 05:37:23,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590590350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:23,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:23,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:23,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875745725] [2025-02-08 05:37:23,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:23,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:23,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:23,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:23,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:23,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 514 [2025-02-08 05:37:23,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 459 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 485.3333333333333) internal successors, (1456), 3 states have internal predecessors, (1456), 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,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:23,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 514 [2025-02-08 05:37:23,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:23,520 INFO L124 PetriNetUnfolderBase]: 41/1376 cut-off events. [2025-02-08 05:37:23,520 INFO L125 PetriNetUnfolderBase]: For 10/13 co-relation queries the response was YES. [2025-02-08 05:37:23,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1376 events. 41/1376 cut-off events. For 10/13 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8353 event pairs, 6 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 1127. Up to 64 conditions per place. [2025-02-08 05:37:23,531 INFO L140 encePairwiseOnDemand]: 510/514 looper letters, 15 selfloop transitions, 2 changer transitions 0/463 dead transitions. [2025-02-08 05:37:23,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 463 transitions, 1000 flow [2025-02-08 05:37:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1471 transitions. [2025-02-08 05:37:23,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539559014267186 [2025-02-08 05:37:23,533 INFO L175 Difference]: Start difference. First operand has 459 places, 459 transitions, 954 flow. Second operand 3 states and 1471 transitions. [2025-02-08 05:37:23,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 463 transitions, 1000 flow [2025-02-08 05:37:23,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 463 transitions, 1000 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:23,538 INFO L231 Difference]: Finished difference. Result has 460 places, 459 transitions, 964 flow [2025-02-08 05:37:23,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=460, PETRI_TRANSITIONS=459} [2025-02-08 05:37:23,539 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -18 predicate places. [2025-02-08 05:37:23,539 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 459 transitions, 964 flow [2025-02-08 05:37:23,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.3333333333333) internal successors, (1456), 3 states have internal predecessors, (1456), 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,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:23,540 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:23,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:23,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:23,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:23,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1668219746, now seen corresponding path program 1 times [2025-02-08 05:37:23,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:23,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096465981] [2025-02-08 05:37:23,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:23,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:23,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:37:23,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:37:23,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:23,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:23,583 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:23,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:23,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096465981] [2025-02-08 05:37:23,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096465981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:23,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:23,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433148321] [2025-02-08 05:37:23,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:23,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:23,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:23,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:23,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:23,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 514 [2025-02-08 05:37:23,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 459 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 484.3333333333333) internal successors, (1453), 3 states have internal predecessors, (1453), 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,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:23,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 514 [2025-02-08 05:37:23,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:23,724 INFO L124 PetriNetUnfolderBase]: 43/1357 cut-off events. [2025-02-08 05:37:23,724 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:37:23,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1357 events. 43/1357 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8121 event pairs, 6 based on Foata normal form. 0/1197 useless extension candidates. Maximal degree in co-relation 1137. Up to 29 conditions per place. [2025-02-08 05:37:23,735 INFO L140 encePairwiseOnDemand]: 509/514 looper letters, 12 selfloop transitions, 3 changer transitions 0/460 dead transitions. [2025-02-08 05:37:23,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 460 transitions, 998 flow [2025-02-08 05:37:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1466 transitions. [2025-02-08 05:37:23,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9507133592736705 [2025-02-08 05:37:23,738 INFO L175 Difference]: Start difference. First operand has 460 places, 459 transitions, 964 flow. Second operand 3 states and 1466 transitions. [2025-02-08 05:37:23,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 460 transitions, 998 flow [2025-02-08 05:37:23,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 460 transitions, 998 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:23,743 INFO L231 Difference]: Finished difference. Result has 461 places, 458 transitions, 973 flow [2025-02-08 05:37:23,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=973, PETRI_PLACES=461, PETRI_TRANSITIONS=458} [2025-02-08 05:37:23,744 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -17 predicate places. [2025-02-08 05:37:23,744 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 458 transitions, 973 flow [2025-02-08 05:37:23,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 484.3333333333333) internal successors, (1453), 3 states have internal predecessors, (1453), 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,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:23,745 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:23,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:23,745 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:23,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1779017805, now seen corresponding path program 1 times [2025-02-08 05:37:23,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:23,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851686531] [2025-02-08 05:37:23,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:23,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:23,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:37:23,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:37:23,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:23,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:23,801 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:23,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:23,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851686531] [2025-02-08 05:37:23,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851686531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:23,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:23,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:23,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717276412] [2025-02-08 05:37:23,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:23,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:23,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:23,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:23,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:23,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 514 [2025-02-08 05:37:23,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 458 transitions, 973 flow. Second operand has 3 states, 3 states have (on average 484.6666666666667) internal successors, (1454), 3 states have internal predecessors, (1454), 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,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:23,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 514 [2025-02-08 05:37:23,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:23,985 INFO L124 PetriNetUnfolderBase]: 36/1188 cut-off events. [2025-02-08 05:37:23,985 INFO L125 PetriNetUnfolderBase]: For 12/35 co-relation queries the response was YES. [2025-02-08 05:37:23,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 1188 events. 36/1188 cut-off events. For 12/35 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6798 event pairs, 8 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1263. Up to 29 conditions per place. [2025-02-08 05:37:23,997 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 13 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-02-08 05:37:23,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 459 transitions, 1007 flow [2025-02-08 05:37:23,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1465 transitions. [2025-02-08 05:37:24,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9500648508430609 [2025-02-08 05:37:24,000 INFO L175 Difference]: Start difference. First operand has 461 places, 458 transitions, 973 flow. Second operand 3 states and 1465 transitions. [2025-02-08 05:37:24,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 459 transitions, 1007 flow [2025-02-08 05:37:24,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 459 transitions, 1004 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:24,006 INFO L231 Difference]: Finished difference. Result has 461 places, 457 transitions, 972 flow [2025-02-08 05:37:24,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=461, PETRI_TRANSITIONS=457} [2025-02-08 05:37:24,007 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -17 predicate places. [2025-02-08 05:37:24,007 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 457 transitions, 972 flow [2025-02-08 05:37:24,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 484.6666666666667) internal successors, (1454), 3 states have internal predecessors, (1454), 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,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:24,008 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:24,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:24,008 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:24,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:24,009 INFO L85 PathProgramCache]: Analyzing trace with hash 898568739, now seen corresponding path program 1 times [2025-02-08 05:37:24,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:24,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694855638] [2025-02-08 05:37:24,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:24,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:24,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 05:37:24,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 05:37:24,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:24,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:24,104 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:24,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:24,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694855638] [2025-02-08 05:37:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694855638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:24,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:37:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538412038] [2025-02-08 05:37:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:24,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:37:24,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:24,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:37:24,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:37:24,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 514 [2025-02-08 05:37:24,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 457 transitions, 972 flow. Second operand has 4 states, 4 states have (on average 486.25) internal successors, (1945), 4 states have internal predecessors, (1945), 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,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:24,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 514 [2025-02-08 05:37:24,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:24,334 INFO L124 PetriNetUnfolderBase]: 36/1260 cut-off events. [2025-02-08 05:37:24,335 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:24,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 1260 events. 36/1260 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7515 event pairs, 3 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 1317. Up to 20 conditions per place. [2025-02-08 05:37:24,347 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 13 selfloop transitions, 2 changer transitions 0/458 dead transitions. [2025-02-08 05:37:24,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 458 transitions, 1006 flow [2025-02-08 05:37:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:37:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:37:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1956 transitions. [2025-02-08 05:37:24,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513618677042801 [2025-02-08 05:37:24,351 INFO L175 Difference]: Start difference. First operand has 461 places, 457 transitions, 972 flow. Second operand 4 states and 1956 transitions. [2025-02-08 05:37:24,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 458 transitions, 1006 flow [2025-02-08 05:37:24,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 458 transitions, 996 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:24,357 INFO L231 Difference]: Finished difference. Result has 459 places, 454 transitions, 958 flow [2025-02-08 05:37:24,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=958, PETRI_PLACES=459, PETRI_TRANSITIONS=454} [2025-02-08 05:37:24,358 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -19 predicate places. [2025-02-08 05:37:24,358 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 454 transitions, 958 flow [2025-02-08 05:37:24,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 486.25) internal successors, (1945), 4 states have internal predecessors, (1945), 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,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:24,359 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:24,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:24,359 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:24,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:24,360 INFO L85 PathProgramCache]: Analyzing trace with hash 102691652, now seen corresponding path program 1 times [2025-02-08 05:37:24,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:24,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725811169] [2025-02-08 05:37:24,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:24,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:24,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:37:24,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:37:24,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:24,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:24,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:24,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:24,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725811169] [2025-02-08 05:37:24,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725811169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:24,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:24,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:24,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586531373] [2025-02-08 05:37:24,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:24,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:37:24,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:24,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:37:24,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:37:24,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 514 [2025-02-08 05:37:24,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 454 transitions, 958 flow. Second operand has 5 states, 5 states have (on average 469.0) internal successors, (2345), 5 states have internal predecessors, (2345), 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,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:24,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 514 [2025-02-08 05:37:24,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:24,750 INFO L124 PetriNetUnfolderBase]: 16/886 cut-off events. [2025-02-08 05:37:24,751 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-08 05:37:24,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 886 events. 16/886 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3643 event pairs, 0 based on Foata normal form. 3/804 useless extension candidates. Maximal degree in co-relation 705. Up to 15 conditions per place. [2025-02-08 05:37:24,760 INFO L140 encePairwiseOnDemand]: 493/514 looper letters, 18 selfloop transitions, 18 changer transitions 0/457 dead transitions. [2025-02-08 05:37:24,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 457 transitions, 1036 flow [2025-02-08 05:37:24,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:37:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:37:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2359 transitions. [2025-02-08 05:37:24,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178988326848249 [2025-02-08 05:37:24,764 INFO L175 Difference]: Start difference. First operand has 459 places, 454 transitions, 958 flow. Second operand 5 states and 2359 transitions. [2025-02-08 05:37:24,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 457 transitions, 1036 flow [2025-02-08 05:37:24,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 457 transitions, 1033 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:24,769 INFO L231 Difference]: Finished difference. Result has 462 places, 457 transitions, 1015 flow [2025-02-08 05:37:24,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1015, PETRI_PLACES=462, PETRI_TRANSITIONS=457} [2025-02-08 05:37:24,770 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -16 predicate places. [2025-02-08 05:37:24,770 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 457 transitions, 1015 flow [2025-02-08 05:37:24,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 469.0) internal successors, (2345), 5 states have internal predecessors, (2345), 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,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:24,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:24,772 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:24,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash -43933289, now seen corresponding path program 1 times [2025-02-08 05:37:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208453285] [2025-02-08 05:37:24,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:24,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:24,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:37:24,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:37:24,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:24,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:24,968 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:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:24,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208453285] [2025-02-08 05:37:24,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208453285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:37:24,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051955484] [2025-02-08 05:37:24,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:24,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:37:24,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:24,972 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:24,973 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:25,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:37:25,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:37:25,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:25,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:25,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:37:25,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:37:25,233 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:25,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:37:25,364 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:25,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051955484] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:37:25,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:37:25,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-08 05:37:25,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13494235] [2025-02-08 05:37:25,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:37:25,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:37:25,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:25,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:37:25,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:37:25,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 514 [2025-02-08 05:37:25,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 457 transitions, 1015 flow. Second operand has 15 states, 15 states have (on average 458.46666666666664) internal successors, (6877), 15 states have internal predecessors, (6877), 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,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:25,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 514 [2025-02-08 05:37:25,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:26,229 INFO L124 PetriNetUnfolderBase]: 16/937 cut-off events. [2025-02-08 05:37:26,230 INFO L125 PetriNetUnfolderBase]: For 17/20 co-relation queries the response was YES. [2025-02-08 05:37:26,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 937 events. 16/937 cut-off events. For 17/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3571 event pairs, 0 based on Foata normal form. 6/856 useless extension candidates. Maximal degree in co-relation 751. Up to 15 conditions per place. [2025-02-08 05:37:26,235 INFO L140 encePairwiseOnDemand]: 484/514 looper letters, 30 selfloop transitions, 39 changer transitions 0/481 dead transitions. [2025-02-08 05:37:26,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 481 transitions, 1207 flow [2025-02-08 05:37:26,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5080 transitions. [2025-02-08 05:37:26,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8984789529536611 [2025-02-08 05:37:26,242 INFO L175 Difference]: Start difference. First operand has 462 places, 457 transitions, 1015 flow. Second operand 11 states and 5080 transitions. [2025-02-08 05:37:26,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 481 transitions, 1207 flow [2025-02-08 05:37:26,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 481 transitions, 1177 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:37:26,248 INFO L231 Difference]: Finished difference. Result has 472 places, 475 transitions, 1165 flow [2025-02-08 05:37:26,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1165, PETRI_PLACES=472, PETRI_TRANSITIONS=475} [2025-02-08 05:37:26,249 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -6 predicate places. [2025-02-08 05:37:26,249 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 475 transitions, 1165 flow [2025-02-08 05:37:26,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 458.46666666666664) internal successors, (6877), 15 states have internal predecessors, (6877), 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,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:26,257 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:26,264 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:26,457 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,SelfDestructingSolverStorable16 [2025-02-08 05:37:26,458 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:26,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1680699575, now seen corresponding path program 2 times [2025-02-08 05:37:26,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:26,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70187974] [2025-02-08 05:37:26,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:37:26,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:26,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 306 statements into 2 equivalence classes. [2025-02-08 05:37:26,494 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:26,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:37:26,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:26,894 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:26,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:26,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70187974] [2025-02-08 05:37:26,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70187974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:26,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:26,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:26,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953709460] [2025-02-08 05:37:26,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:26,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:26,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:26,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:26,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:27,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 514 [2025-02-08 05:37:27,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 475 transitions, 1165 flow. Second operand has 6 states, 6 states have (on average 473.5) internal successors, (2841), 6 states have internal predecessors, (2841), 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,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 514 [2025-02-08 05:37:27,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,350 INFO L124 PetriNetUnfolderBase]: 39/1294 cut-off events. [2025-02-08 05:37:27,350 INFO L125 PetriNetUnfolderBase]: For 20/21 co-relation queries the response was YES. [2025-02-08 05:37:27,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1566 conditions, 1294 events. 39/1294 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6774 event pairs, 3 based on Foata normal form. 0/1164 useless extension candidates. Maximal degree in co-relation 1187. Up to 54 conditions per place. [2025-02-08 05:37:27,360 INFO L140 encePairwiseOnDemand]: 509/514 looper letters, 30 selfloop transitions, 4 changer transitions 0/482 dead transitions. [2025-02-08 05:37:27,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 482 transitions, 1255 flow [2025-02-08 05:37:27,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2855 transitions. [2025-02-08 05:37:27,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9257457846952011 [2025-02-08 05:37:27,365 INFO L175 Difference]: Start difference. First operand has 472 places, 475 transitions, 1165 flow. Second operand 6 states and 2855 transitions. [2025-02-08 05:37:27,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 482 transitions, 1255 flow [2025-02-08 05:37:27,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 482 transitions, 1219 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-08 05:37:27,371 INFO L231 Difference]: Finished difference. Result has 473 places, 474 transitions, 1135 flow [2025-02-08 05:37:27,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1135, PETRI_PLACES=473, PETRI_TRANSITIONS=474} [2025-02-08 05:37:27,372 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -5 predicate places. [2025-02-08 05:37:27,372 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 474 transitions, 1135 flow [2025-02-08 05:37:27,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 473.5) internal successors, (2841), 6 states have internal predecessors, (2841), 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,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,377 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:27,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:27,377 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:27,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,378 INFO L85 PathProgramCache]: Analyzing trace with hash -874473990, now seen corresponding path program 1 times [2025-02-08 05:37:27,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327801233] [2025-02-08 05:37:27,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-08 05:37:27,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-08 05:37:27,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,475 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:27,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327801233] [2025-02-08 05:37:27,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327801233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963087658] [2025-02-08 05:37:27,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 514 [2025-02-08 05:37:27,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 474 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 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,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 514 [2025-02-08 05:37:27,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,707 INFO L124 PetriNetUnfolderBase]: 49/1677 cut-off events. [2025-02-08 05:37:27,707 INFO L125 PetriNetUnfolderBase]: For 15/20 co-relation queries the response was YES. [2025-02-08 05:37:27,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1932 conditions, 1677 events. 49/1677 cut-off events. For 15/20 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10315 event pairs, 12 based on Foata normal form. 1/1496 useless extension candidates. Maximal degree in co-relation 1843. Up to 41 conditions per place. [2025-02-08 05:37:27,716 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 13 selfloop transitions, 2 changer transitions 0/475 dead transitions. [2025-02-08 05:37:27,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 475 transitions, 1169 flow [2025-02-08 05:37:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1465 transitions. [2025-02-08 05:37:27,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9500648508430609 [2025-02-08 05:37:27,719 INFO L175 Difference]: Start difference. First operand has 473 places, 474 transitions, 1135 flow. Second operand 3 states and 1465 transitions. [2025-02-08 05:37:27,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 475 transitions, 1169 flow [2025-02-08 05:37:27,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 475 transitions, 1162 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:27,724 INFO L231 Difference]: Finished difference. Result has 470 places, 473 transitions, 1130 flow [2025-02-08 05:37:27,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=468, 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=1130, PETRI_PLACES=470, PETRI_TRANSITIONS=473} [2025-02-08 05:37:27,725 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -8 predicate places. [2025-02-08 05:37:27,725 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 473 transitions, 1130 flow [2025-02-08 05:37:27,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 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,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,726 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:27,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:27,726 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:27,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1159744625, now seen corresponding path program 1 times [2025-02-08 05:37:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070690308] [2025-02-08 05:37:27,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-08 05:37:27,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-08 05:37:27,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,803 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:27,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070690308] [2025-02-08 05:37:27,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070690308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003385398] [2025-02-08 05:37:27,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 514 [2025-02-08 05:37:27,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 473 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 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,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 514 [2025-02-08 05:37:27,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,966 INFO L124 PetriNetUnfolderBase]: 38/1307 cut-off events. [2025-02-08 05:37:27,967 INFO L125 PetriNetUnfolderBase]: For 16/21 co-relation queries the response was YES. [2025-02-08 05:37:27,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 1307 events. 38/1307 cut-off events. For 16/21 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6994 event pairs, 4 based on Foata normal form. 0/1178 useless extension candidates. Maximal degree in co-relation 1414. Up to 46 conditions per place. [2025-02-08 05:37:27,978 INFO L140 encePairwiseOnDemand]: 510/514 looper letters, 14 selfloop transitions, 2 changer transitions 0/476 dead transitions. [2025-02-08 05:37:27,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 476 transitions, 1171 flow [2025-02-08 05:37:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1470 transitions. [2025-02-08 05:37:27,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.953307392996109 [2025-02-08 05:37:27,980 INFO L175 Difference]: Start difference. First operand has 470 places, 473 transitions, 1130 flow. Second operand 3 states and 1470 transitions. [2025-02-08 05:37:27,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 476 transitions, 1171 flow [2025-02-08 05:37:27,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 476 transitions, 1167 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,985 INFO L231 Difference]: Finished difference. Result has 469 places, 473 transitions, 1136 flow [2025-02-08 05:37:27,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=466, 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=1136, PETRI_PLACES=469, PETRI_TRANSITIONS=473} [2025-02-08 05:37:27,986 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -9 predicate places. [2025-02-08 05:37:27,986 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 473 transitions, 1136 flow [2025-02-08 05:37:27,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 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,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,987 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:27,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:27,987 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:27,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1592376992, now seen corresponding path program 1 times [2025-02-08 05:37:27,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262691677] [2025-02-08 05:37:27,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-08 05:37:28,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-08 05:37:28,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,061 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:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262691677] [2025-02-08 05:37:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262691677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414085635] [2025-02-08 05:37:28,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 514 [2025-02-08 05:37:28,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 473 transitions, 1136 flow. Second operand has 3 states, 3 states have (on average 484.6666666666667) internal successors, (1454), 3 states have internal predecessors, (1454), 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,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 514 [2025-02-08 05:37:28,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,234 INFO L124 PetriNetUnfolderBase]: 34/1381 cut-off events. [2025-02-08 05:37:28,234 INFO L125 PetriNetUnfolderBase]: For 18/45 co-relation queries the response was YES. [2025-02-08 05:37:28,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 1381 events. 34/1381 cut-off events. For 18/45 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7485 event pairs, 4 based on Foata normal form. 0/1241 useless extension candidates. Maximal degree in co-relation 1433. Up to 21 conditions per place. [2025-02-08 05:37:28,245 INFO L140 encePairwiseOnDemand]: 509/514 looper letters, 12 selfloop transitions, 3 changer transitions 0/474 dead transitions. [2025-02-08 05:37:28,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 474 transitions, 1170 flow [2025-02-08 05:37:28,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1466 transitions. [2025-02-08 05:37:28,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9507133592736705 [2025-02-08 05:37:28,248 INFO L175 Difference]: Start difference. First operand has 469 places, 473 transitions, 1136 flow. Second operand 3 states and 1466 transitions. [2025-02-08 05:37:28,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 474 transitions, 1170 flow [2025-02-08 05:37:28,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 474 transitions, 1170 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:28,253 INFO L231 Difference]: Finished difference. Result has 470 places, 472 transitions, 1145 flow [2025-02-08 05:37:28,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1145, PETRI_PLACES=470, PETRI_TRANSITIONS=472} [2025-02-08 05:37:28,254 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -8 predicate places. [2025-02-08 05:37:28,254 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 472 transitions, 1145 flow [2025-02-08 05:37:28,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 484.6666666666667) internal successors, (1454), 3 states have internal predecessors, (1454), 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,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,254 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:28,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:28,255 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:28,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1066955549, now seen corresponding path program 1 times [2025-02-08 05:37:28,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98070356] [2025-02-08 05:37:28,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-08 05:37:28,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-08 05:37:28,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,332 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:28,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98070356] [2025-02-08 05:37:28,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98070356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635243678] [2025-02-08 05:37:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 514 [2025-02-08 05:37:28,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 472 transitions, 1145 flow. Second operand has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 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,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 514 [2025-02-08 05:37:28,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,487 INFO L124 PetriNetUnfolderBase]: 43/1177 cut-off events. [2025-02-08 05:37:28,488 INFO L125 PetriNetUnfolderBase]: For 39/42 co-relation queries the response was YES. [2025-02-08 05:37:28,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 1177 events. 43/1177 cut-off events. For 39/42 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6057 event pairs, 10 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 1378. Up to 58 conditions per place. [2025-02-08 05:37:28,499 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 13 selfloop transitions, 2 changer transitions 0/473 dead transitions. [2025-02-08 05:37:28,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 473 transitions, 1179 flow [2025-02-08 05:37:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1465 transitions. [2025-02-08 05:37:28,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9500648508430609 [2025-02-08 05:37:28,502 INFO L175 Difference]: Start difference. First operand has 470 places, 472 transitions, 1145 flow. Second operand 3 states and 1465 transitions. [2025-02-08 05:37:28,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 473 transitions, 1179 flow [2025-02-08 05:37:28,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 473 transitions, 1176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:28,508 INFO L231 Difference]: Finished difference. Result has 470 places, 471 transitions, 1144 flow [2025-02-08 05:37:28,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=468, 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=1144, PETRI_PLACES=470, PETRI_TRANSITIONS=471} [2025-02-08 05:37:28,509 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -8 predicate places. [2025-02-08 05:37:28,509 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 471 transitions, 1144 flow [2025-02-08 05:37:28,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 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,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,510 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:28,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:28,510 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:28,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash 619964440, now seen corresponding path program 1 times [2025-02-08 05:37:28,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230443781] [2025-02-08 05:37:28,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-08 05:37:28,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-08 05:37:28,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,651 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:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230443781] [2025-02-08 05:37:28,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230443781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:37:28,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186920943] [2025-02-08 05:37:28,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:37:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:37:28,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:37:28,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 514 [2025-02-08 05:37:28,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 471 transitions, 1144 flow. Second operand has 4 states, 4 states have (on average 486.5) internal successors, (1946), 4 states have internal predecessors, (1946), 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,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 514 [2025-02-08 05:37:28,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,852 INFO L124 PetriNetUnfolderBase]: 30/1302 cut-off events. [2025-02-08 05:37:28,852 INFO L125 PetriNetUnfolderBase]: For 20/40 co-relation queries the response was YES. [2025-02-08 05:37:28,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 1302 events. 30/1302 cut-off events. For 20/40 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6853 event pairs, 2 based on Foata normal form. 0/1178 useless extension candidates. Maximal degree in co-relation 1440. Up to 19 conditions per place. [2025-02-08 05:37:28,865 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 13 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2025-02-08 05:37:28,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 472 transitions, 1178 flow [2025-02-08 05:37:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:37:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:37:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1956 transitions. [2025-02-08 05:37:28,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513618677042801 [2025-02-08 05:37:28,868 INFO L175 Difference]: Start difference. First operand has 470 places, 471 transitions, 1144 flow. Second operand 4 states and 1956 transitions. [2025-02-08 05:37:28,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 472 transitions, 1178 flow [2025-02-08 05:37:28,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 472 transitions, 1168 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:28,874 INFO L231 Difference]: Finished difference. Result has 468 places, 468 transitions, 1130 flow [2025-02-08 05:37:28,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=465, 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=4, PETRI_FLOW=1130, PETRI_PLACES=468, PETRI_TRANSITIONS=468} [2025-02-08 05:37:28,874 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -10 predicate places. [2025-02-08 05:37:28,875 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 468 transitions, 1130 flow [2025-02-08 05:37:28,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 486.5) internal successors, (1946), 4 states have internal predecessors, (1946), 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,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,875 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:28,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:28,876 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:28,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash 391729052, now seen corresponding path program 1 times [2025-02-08 05:37:28,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425782952] [2025-02-08 05:37:28,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-08 05:37:28,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-08 05:37:28,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,951 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:28,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425782952] [2025-02-08 05:37:28,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425782952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487802696] [2025-02-08 05:37:28,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 514 [2025-02-08 05:37:28,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 468 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 485.3333333333333) internal successors, (1456), 3 states have internal predecessors, (1456), 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,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 514 [2025-02-08 05:37:28,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:29,140 INFO L124 PetriNetUnfolderBase]: 40/1563 cut-off events. [2025-02-08 05:37:29,140 INFO L125 PetriNetUnfolderBase]: For 21/56 co-relation queries the response was YES. [2025-02-08 05:37:29,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 1563 events. 40/1563 cut-off events. For 21/56 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9341 event pairs, 8 based on Foata normal form. 1/1412 useless extension candidates. Maximal degree in co-relation 1637. Up to 29 conditions per place. [2025-02-08 05:37:29,155 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 13 selfloop transitions, 2 changer transitions 0/469 dead transitions. [2025-02-08 05:37:29,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 469 transitions, 1164 flow [2025-02-08 05:37:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1465 transitions. [2025-02-08 05:37:29,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9500648508430609 [2025-02-08 05:37:29,160 INFO L175 Difference]: Start difference. First operand has 468 places, 468 transitions, 1130 flow. Second operand 3 states and 1465 transitions. [2025-02-08 05:37:29,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 469 transitions, 1164 flow [2025-02-08 05:37:29,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 469 transitions, 1161 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:29,166 INFO L231 Difference]: Finished difference. Result has 467 places, 467 transitions, 1129 flow [2025-02-08 05:37:29,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=465, 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=1129, PETRI_PLACES=467, PETRI_TRANSITIONS=467} [2025-02-08 05:37:29,167 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -11 predicate places. [2025-02-08 05:37:29,167 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 467 transitions, 1129 flow [2025-02-08 05:37:29,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.3333333333333) internal successors, (1456), 3 states have internal predecessors, (1456), 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,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:29,168 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:29,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:37:29,168 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:29,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1348064679, now seen corresponding path program 1 times [2025-02-08 05:37:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:29,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988181998] [2025-02-08 05:37:29,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:29,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:29,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-08 05:37:29,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-08 05:37:29,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:29,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:29,437 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:29,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:29,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988181998] [2025-02-08 05:37:29,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988181998] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:37:29,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022589668] [2025-02-08 05:37:29,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:29,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:37:29,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:29,440 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:29,448 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:29,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-08 05:37:29,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-08 05:37:29,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:29,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:29,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 05:37:29,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:37:29,867 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:29,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:37:30,006 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:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022589668] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:37:30,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:37:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-02-08 05:37:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866077112] [2025-02-08 05:37:30,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 05:37:30,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 05:37:30,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-02-08 05:37:30,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 514 [2025-02-08 05:37:30,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 467 transitions, 1129 flow. Second operand has 22 states, 22 states have (on average 458.1363636363636) internal successors, (10079), 22 states have internal predecessors, (10079), 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,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 514 [2025-02-08 05:37:30,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,373 INFO L124 PetriNetUnfolderBase]: 16/1041 cut-off events. [2025-02-08 05:37:31,374 INFO L125 PetriNetUnfolderBase]: For 56/59 co-relation queries the response was YES. [2025-02-08 05:37:31,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1041 events. 16/1041 cut-off events. For 56/59 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3705 event pairs, 0 based on Foata normal form. 6/972 useless extension candidates. Maximal degree in co-relation 1277. Up to 25 conditions per place. [2025-02-08 05:37:31,382 INFO L140 encePairwiseOnDemand]: 484/514 looper letters, 36 selfloop transitions, 57 changer transitions 0/497 dead transitions. [2025-02-08 05:37:31,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 497 transitions, 1459 flow [2025-02-08 05:37:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 05:37:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 05:37:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 7834 transitions. [2025-02-08 05:37:31,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8965438315403983 [2025-02-08 05:37:31,391 INFO L175 Difference]: Start difference. First operand has 467 places, 467 transitions, 1129 flow. Second operand 17 states and 7834 transitions. [2025-02-08 05:37:31,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 497 transitions, 1459 flow [2025-02-08 05:37:31,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 497 transitions, 1455 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:31,398 INFO L231 Difference]: Finished difference. Result has 484 places, 488 transitions, 1401 flow [2025-02-08 05:37:31,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1401, PETRI_PLACES=484, PETRI_TRANSITIONS=488} [2025-02-08 05:37:31,399 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, 6 predicate places. [2025-02-08 05:37:31,399 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 488 transitions, 1401 flow [2025-02-08 05:37:31,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 458.1363636363636) internal successors, (10079), 22 states have internal predecessors, (10079), 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:31,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:31,401 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:31,408 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:31,601 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:31,602 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:31,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash -374589063, now seen corresponding path program 2 times [2025-02-08 05:37:31,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:31,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595719028] [2025-02-08 05:37:31,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:37:31,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:31,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes. [2025-02-08 05:37:31,659 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:31,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:37:31,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:31,917 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:31,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:31,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595719028] [2025-02-08 05:37:31,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595719028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:31,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604572998] [2025-02-08 05:37:31,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:31,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:31,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:31,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:31,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:32,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 514 [2025-02-08 05:37:32,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 488 transitions, 1401 flow. Second operand has 6 states, 6 states have (on average 473.6666666666667) internal successors, (2842), 6 states have internal predecessors, (2842), 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:32,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:32,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 514 [2025-02-08 05:37:32,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:32,372 INFO L124 PetriNetUnfolderBase]: 32/1318 cut-off events. [2025-02-08 05:37:32,373 INFO L125 PetriNetUnfolderBase]: For 86/108 co-relation queries the response was YES. [2025-02-08 05:37:32,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 1318 events. 32/1318 cut-off events. For 86/108 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6301 event pairs, 2 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 1445. Up to 75 conditions per place. [2025-02-08 05:37:32,385 INFO L140 encePairwiseOnDemand]: 509/514 looper letters, 30 selfloop transitions, 4 changer transitions 0/495 dead transitions. [2025-02-08 05:37:32,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 495 transitions, 1491 flow [2025-02-08 05:37:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2855 transitions. [2025-02-08 05:37:32,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9257457846952011 [2025-02-08 05:37:32,387 INFO L175 Difference]: Start difference. First operand has 484 places, 488 transitions, 1401 flow. Second operand 6 states and 2855 transitions. [2025-02-08 05:37:32,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 495 transitions, 1491 flow [2025-02-08 05:37:32,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 495 transitions, 1413 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-02-08 05:37:32,395 INFO L231 Difference]: Finished difference. Result has 480 places, 487 transitions, 1329 flow [2025-02-08 05:37:32,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1329, PETRI_PLACES=480, PETRI_TRANSITIONS=487} [2025-02-08 05:37:32,396 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, 2 predicate places. [2025-02-08 05:37:32,396 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 487 transitions, 1329 flow [2025-02-08 05:37:32,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 473.6666666666667) internal successors, (2842), 6 states have internal predecessors, (2842), 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:32,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:32,397 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:32,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:37:32,397 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:32,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash 756983939, now seen corresponding path program 1 times [2025-02-08 05:37:32,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:32,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419521033] [2025-02-08 05:37:32,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:32,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:32,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-08 05:37:32,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-08 05:37:32,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:32,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:32,490 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:32,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419521033] [2025-02-08 05:37:32,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419521033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:32,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:32,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507918030] [2025-02-08 05:37:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:32,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:32,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:32,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:32,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 514 [2025-02-08 05:37:32,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 487 transitions, 1329 flow. Second operand has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 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:32,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:32,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 514 [2025-02-08 05:37:32,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:32,666 INFO L124 PetriNetUnfolderBase]: 36/1315 cut-off events. [2025-02-08 05:37:32,666 INFO L125 PetriNetUnfolderBase]: For 103/106 co-relation queries the response was YES. [2025-02-08 05:37:32,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1621 conditions, 1315 events. 36/1315 cut-off events. For 103/106 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6064 event pairs, 8 based on Foata normal form. 1/1209 useless extension candidates. Maximal degree in co-relation 1567. Up to 40 conditions per place. [2025-02-08 05:37:32,673 INFO L140 encePairwiseOnDemand]: 509/514 looper letters, 10 selfloop transitions, 2 changer transitions 12/488 dead transitions. [2025-02-08 05:37:32,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 488 transitions, 1361 flow [2025-02-08 05:37:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1465 transitions. [2025-02-08 05:37:32,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9500648508430609 [2025-02-08 05:37:32,675 INFO L175 Difference]: Start difference. First operand has 480 places, 487 transitions, 1329 flow. Second operand 3 states and 1465 transitions. [2025-02-08 05:37:32,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 488 transitions, 1361 flow [2025-02-08 05:37:32,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 488 transitions, 1354 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:32,682 INFO L231 Difference]: Finished difference. Result has 477 places, 474 transitions, 1303 flow [2025-02-08 05:37:32,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1303, PETRI_PLACES=477, PETRI_TRANSITIONS=474} [2025-02-08 05:37:32,682 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -1 predicate places. [2025-02-08 05:37:32,682 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 474 transitions, 1303 flow [2025-02-08 05:37:32,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 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:32,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:32,683 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:32,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:37:32,684 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:32,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash -826849988, now seen corresponding path program 1 times [2025-02-08 05:37:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:32,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352201484] [2025-02-08 05:37:32,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:32,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-08 05:37:32,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-08 05:37:32,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:32,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-02-08 05:37:33,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:33,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352201484] [2025-02-08 05:37:33,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352201484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:33,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:33,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202769301] [2025-02-08 05:37:33,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:33,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:33,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:33,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:33,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:33,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 514 [2025-02-08 05:37:33,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 474 transitions, 1303 flow. Second operand has 6 states, 6 states have (on average 473.5) internal successors, (2841), 6 states have internal predecessors, (2841), 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:33,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:33,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 514 [2025-02-08 05:37:33,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:33,857 INFO L124 PetriNetUnfolderBase]: 43/1394 cut-off events. [2025-02-08 05:37:33,857 INFO L125 PetriNetUnfolderBase]: For 93/94 co-relation queries the response was YES. [2025-02-08 05:37:33,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 1394 events. 43/1394 cut-off events. For 93/94 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7016 event pairs, 3 based on Foata normal form. 0/1289 useless extension candidates. Maximal degree in co-relation 1744. Up to 77 conditions per place. [2025-02-08 05:37:33,867 INFO L140 encePairwiseOnDemand]: 509/514 looper letters, 29 selfloop transitions, 4 changer transitions 0/481 dead transitions. [2025-02-08 05:37:33,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 481 transitions, 1391 flow [2025-02-08 05:37:33,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2854 transitions. [2025-02-08 05:37:33,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254215304798963 [2025-02-08 05:37:33,869 INFO L175 Difference]: Start difference. First operand has 477 places, 474 transitions, 1303 flow. Second operand 6 states and 2854 transitions. [2025-02-08 05:37:33,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 481 transitions, 1391 flow [2025-02-08 05:37:33,872 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:33,877 INFO L231 Difference]: Finished difference. Result has 469 places, 473 transitions, 1307 flow [2025-02-08 05:37:33,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, 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:33,878 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -9 predicate places. [2025-02-08 05:37:33,878 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 473 transitions, 1307 flow [2025-02-08 05:37:33,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 473.5) internal successors, (2841), 6 states have internal predecessors, (2841), 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:33,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:33,882 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:33,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:37:33,883 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:33,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:33,884 INFO L85 PathProgramCache]: Analyzing trace with hash 797201307, now seen corresponding path program 1 times [2025-02-08 05:37:33,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:33,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390614144] [2025-02-08 05:37:33,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:33,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:33,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-08 05:37:33,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-08 05:37:33,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:33,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:33,967 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:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:33,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390614144] [2025-02-08 05:37:33,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390614144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:33,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:33,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:33,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069429719] [2025-02-08 05:37:33,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:33,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:33,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:33,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:33,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:33,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 514 [2025-02-08 05:37:33,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 473 transitions, 1307 flow. Second operand has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 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:33,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:33,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 514 [2025-02-08 05:37:33,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:34,161 INFO L124 PetriNetUnfolderBase]: 47/1570 cut-off events. [2025-02-08 05:37:34,161 INFO L125 PetriNetUnfolderBase]: For 100/105 co-relation queries the response was YES. [2025-02-08 05:37:34,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 1570 events. 47/1570 cut-off events. For 100/105 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8116 event pairs, 8 based on Foata normal form. 1/1452 useless extension candidates. Maximal degree in co-relation 1831. Up to 76 conditions per place. [2025-02-08 05:37:34,172 INFO L140 encePairwiseOnDemand]: 510/514 looper letters, 13 selfloop transitions, 2 changer transitions 0/476 dead transitions. [2025-02-08 05:37:34,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 476 transitions, 1346 flow [2025-02-08 05:37:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1469 transitions. [2025-02-08 05:37:34,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9526588845654993 [2025-02-08 05:37:34,174 INFO L175 Difference]: Start difference. First operand has 469 places, 473 transitions, 1307 flow. Second operand 3 states and 1469 transitions. [2025-02-08 05:37:34,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 476 transitions, 1346 flow [2025-02-08 05:37:34,176 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:34,179 INFO L231 Difference]: Finished difference. Result has 466 places, 473 transitions, 1310 flow [2025-02-08 05:37:34,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, 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:34,180 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -12 predicate places. [2025-02-08 05:37:34,180 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 473 transitions, 1310 flow [2025-02-08 05:37:34,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 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:34,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:34,181 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:34,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:37:34,181 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:34,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1533882040, now seen corresponding path program 1 times [2025-02-08 05:37:34,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:34,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863905723] [2025-02-08 05:37:34,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:34,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:34,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-08 05:37:34,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-08 05:37:34,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:34,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:34,306 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:34,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:34,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863905723] [2025-02-08 05:37:34,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863905723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:34,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:34,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:37:34,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843604357] [2025-02-08 05:37:34,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:34,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:37:34,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:34,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:37:34,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:37:34,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 514 [2025-02-08 05:37:34,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 473 transitions, 1310 flow. Second operand has 4 states, 4 states have (on average 486.75) internal successors, (1947), 4 states have internal predecessors, (1947), 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:34,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:34,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 514 [2025-02-08 05:37:34,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:34,622 INFO L124 PetriNetUnfolderBase]: 35/1384 cut-off events. [2025-02-08 05:37:34,624 INFO L125 PetriNetUnfolderBase]: For 106/109 co-relation queries the response was YES. [2025-02-08 05:37:34,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 1384 events. 35/1384 cut-off events. For 106/109 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6628 event pairs, 4 based on Foata normal form. 0/1288 useless extension candidates. Maximal degree in co-relation 1613. Up to 25 conditions per place. [2025-02-08 05:37:34,640 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 12 selfloop transitions, 2 changer transitions 0/474 dead transitions. [2025-02-08 05:37:34,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 474 transitions, 1342 flow [2025-02-08 05:37:34,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:37:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:37:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1955 transitions. [2025-02-08 05:37:34,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508754863813229 [2025-02-08 05:37:34,649 INFO L175 Difference]: Start difference. First operand has 466 places, 473 transitions, 1310 flow. Second operand 4 states and 1955 transitions. [2025-02-08 05:37:34,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 474 transitions, 1342 flow [2025-02-08 05:37:34,652 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:34,659 INFO L231 Difference]: Finished difference. Result has 466 places, 470 transitions, 1302 flow [2025-02-08 05:37:34,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, 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:34,660 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -12 predicate places. [2025-02-08 05:37:34,660 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 470 transitions, 1302 flow [2025-02-08 05:37:34,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 486.75) internal successors, (1947), 4 states have internal predecessors, (1947), 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:34,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:34,660 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:34,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:37:34,661 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:34,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1020292631, now seen corresponding path program 1 times [2025-02-08 05:37:34,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:34,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735812964] [2025-02-08 05:37:34,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:34,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-08 05:37:34,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-08 05:37:34,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:34,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,301 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:35,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735812964] [2025-02-08 05:37:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735812964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:35,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824472010] [2025-02-08 05:37:35,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:35,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:35,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:35,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 514 [2025-02-08 05:37:35,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 470 transitions, 1302 flow. Second operand has 6 states, 6 states have (on average 473.8333333333333) internal successors, (2843), 6 states have internal predecessors, (2843), 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:35,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 514 [2025-02-08 05:37:35,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,735 INFO L124 PetriNetUnfolderBase]: 39/1353 cut-off events. [2025-02-08 05:37:35,736 INFO L125 PetriNetUnfolderBase]: For 118/121 co-relation queries the response was YES. [2025-02-08 05:37:35,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 1353 events. 39/1353 cut-off events. For 118/121 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6558 event pairs, 4 based on Foata normal form. 0/1277 useless extension candidates. Maximal degree in co-relation 1519. Up to 81 conditions per place. [2025-02-08 05:37:35,744 INFO L140 encePairwiseOnDemand]: 509/514 looper letters, 29 selfloop transitions, 4 changer transitions 0/477 dead transitions. [2025-02-08 05:37:35,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 477 transitions, 1390 flow [2025-02-08 05:37:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2854 transitions. [2025-02-08 05:37:35,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254215304798963 [2025-02-08 05:37:35,746 INFO L175 Difference]: Start difference. First operand has 466 places, 470 transitions, 1302 flow. Second operand 6 states and 2854 transitions. [2025-02-08 05:37:35,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 477 transitions, 1390 flow [2025-02-08 05:37:35,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 477 transitions, 1387 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:35,752 INFO L231 Difference]: Finished difference. Result has 468 places, 469 transitions, 1305 flow [2025-02-08 05:37:35,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1305, PETRI_PLACES=468, PETRI_TRANSITIONS=469} [2025-02-08 05:37:35,752 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -10 predicate places. [2025-02-08 05:37:35,752 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 469 transitions, 1305 flow [2025-02-08 05:37:35,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 473.8333333333333) internal successors, (2843), 6 states have internal predecessors, (2843), 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:35,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,753 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:35,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:37:35,753 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:35,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,754 INFO L85 PathProgramCache]: Analyzing trace with hash 719501100, now seen corresponding path program 1 times [2025-02-08 05:37:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554210192] [2025-02-08 05:37:35,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-08 05:37:35,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-08 05:37:35,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,859 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:35,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554210192] [2025-02-08 05:37:35,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554210192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:35,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446461222] [2025-02-08 05:37:35,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:35,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:35,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:35,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 514 [2025-02-08 05:37:35,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 469 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 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:35,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:35,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 514 [2025-02-08 05:37:35,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,032 INFO L124 PetriNetUnfolderBase]: 39/1357 cut-off events. [2025-02-08 05:37:36,032 INFO L125 PetriNetUnfolderBase]: For 110/113 co-relation queries the response was YES. [2025-02-08 05:37:36,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 1357 events. 39/1357 cut-off events. For 110/113 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6536 event pairs, 16 based on Foata normal form. 0/1278 useless extension candidates. Maximal degree in co-relation 1482. Up to 55 conditions per place. [2025-02-08 05:37:36,040 INFO L140 encePairwiseOnDemand]: 511/514 looper letters, 10 selfloop transitions, 2 changer transitions 1/470 dead transitions. [2025-02-08 05:37:36,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 470 transitions, 1335 flow [2025-02-08 05:37:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2025-02-08 05:37:36,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9487678339818417 [2025-02-08 05:37:36,042 INFO L175 Difference]: Start difference. First operand has 468 places, 469 transitions, 1305 flow. Second operand 3 states and 1463 transitions. [2025-02-08 05:37:36,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 470 transitions, 1335 flow [2025-02-08 05:37:36,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 470 transitions, 1328 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:36,047 INFO L231 Difference]: Finished difference. Result has 465 places, 468 transitions, 1300 flow [2025-02-08 05:37:36,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=463, 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=1300, PETRI_PLACES=465, PETRI_TRANSITIONS=468} [2025-02-08 05:37:36,048 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -13 predicate places. [2025-02-08 05:37:36,048 INFO L471 AbstractCegarLoop]: Abstraction has has 465 places, 468 transitions, 1300 flow [2025-02-08 05:37:36,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 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:36,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,049 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:36,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:37:36,049 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:36,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1594687070, now seen corresponding path program 1 times [2025-02-08 05:37:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625363655] [2025-02-08 05:37:36,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-02-08 05:37:36,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-02-08 05:37:36,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:36,701 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:36,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:36,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625363655] [2025-02-08 05:37:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625363655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:36,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:36,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85152865] [2025-02-08 05:37:36,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:36,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:36,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:36,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:36,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:37,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 514 [2025-02-08 05:37:37,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 468 transitions, 1300 flow. Second operand has 6 states, 6 states have (on average 473.6666666666667) internal successors, (2842), 6 states have internal predecessors, (2842), 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:37,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 514 [2025-02-08 05:37:37,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:37,344 INFO L124 PetriNetUnfolderBase]: 28/1326 cut-off events. [2025-02-08 05:37:37,344 INFO L125 PetriNetUnfolderBase]: For 92/104 co-relation queries the response was YES. [2025-02-08 05:37:37,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 1326 events. 28/1326 cut-off events. For 92/104 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6241 event pairs, 2 based on Foata normal form. 2/1257 useless extension candidates. Maximal degree in co-relation 1669. Up to 74 conditions per place. [2025-02-08 05:37:37,357 INFO L140 encePairwiseOnDemand]: 509/514 looper letters, 29 selfloop transitions, 4 changer transitions 0/475 dead transitions. [2025-02-08 05:37:37,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 475 transitions, 1388 flow [2025-02-08 05:37:37,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2854 transitions. [2025-02-08 05:37:37,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254215304798963 [2025-02-08 05:37:37,359 INFO L175 Difference]: Start difference. First operand has 465 places, 468 transitions, 1300 flow. Second operand 6 states and 2854 transitions. [2025-02-08 05:37:37,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 475 transitions, 1388 flow [2025-02-08 05:37:37,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 475 transitions, 1384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:37,369 INFO L231 Difference]: Finished difference. Result has 467 places, 467 transitions, 1302 flow [2025-02-08 05:37:37,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, 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:37,369 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -11 predicate places. [2025-02-08 05:37:37,370 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 467 transitions, 1302 flow [2025-02-08 05:37:37,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 473.6666666666667) internal successors, (2842), 6 states have internal predecessors, (2842), 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:37,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:37,371 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:37,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:37:37,371 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:37,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash -794132402, now seen corresponding path program 1 times [2025-02-08 05:37:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:37,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242158085] [2025-02-08 05:37:37,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:37,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:37,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-02-08 05:37:37,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-02-08 05:37:37,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:37,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-02-08 05:37:38,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242158085] [2025-02-08 05:37:38,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242158085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:38,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492275584] [2025-02-08 05:37:38,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:38,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:38,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:38,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 514 [2025-02-08 05:37:38,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 467 transitions, 1302 flow. Second operand has 6 states, 6 states have (on average 473.8333333333333) internal successors, (2843), 6 states have internal predecessors, (2843), 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:38,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 514 [2025-02-08 05:37:38,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,620 INFO L124 PetriNetUnfolderBase]: 44/1334 cut-off events. [2025-02-08 05:37:38,620 INFO L125 PetriNetUnfolderBase]: For 115/118 co-relation queries the response was YES. [2025-02-08 05:37:38,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 1334 events. 44/1334 cut-off events. For 115/118 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6601 event pairs, 4 based on Foata normal form. 0/1272 useless extension candidates. Maximal degree in co-relation 1767. Up to 81 conditions per place. [2025-02-08 05:37:38,627 INFO L140 encePairwiseOnDemand]: 509/514 looper letters, 0 selfloop transitions, 0 changer transitions 474/474 dead transitions. [2025-02-08 05:37:38,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 474 transitions, 1390 flow [2025-02-08 05:37:38,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:38,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2854 transitions. [2025-02-08 05:37:38,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254215304798963 [2025-02-08 05:37:38,629 INFO L175 Difference]: Start difference. First operand has 467 places, 467 transitions, 1302 flow. Second operand 6 states and 2854 transitions. [2025-02-08 05:37:38,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 474 transitions, 1390 flow [2025-02-08 05:37:38,636 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:38,637 INFO L231 Difference]: Finished difference. Result has 467 places, 0 transitions, 0 flow [2025-02-08 05:37:38,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=514, 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:38,638 INFO L279 CegarLoopForPetriNet]: 478 programPoint places, -11 predicate places. [2025-02-08 05:37:38,638 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 0 transitions, 0 flow [2025-02-08 05:37:38,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 473.8333333333333) internal successors, (2843), 6 states have internal predecessors, (2843), 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:38,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining) [2025-02-08 05:37:38,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-02-08 05:37:38,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-02-08 05:37:38,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-02-08 05:37:38,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-02-08 05:37:38,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-02-08 05:37:38,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-02-08 05:37:38,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-02-08 05:37:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-02-08 05:37:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-02-08 05:37:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-02-08 05:37:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-02-08 05:37:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-02-08 05:37:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-02-08 05:37:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-02-08 05:37:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-02-08 05:37:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-02-08 05:37:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-02-08 05:37:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-02-08 05:37:38,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-02-08 05:37:38,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-02-08 05:37:38,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-02-08 05:37:38,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-02-08 05:37:38,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-02-08 05:37:38,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-02-08 05:37:38,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-02-08 05:37:38,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-02-08 05:37:38,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-02-08 05:37:38,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-02-08 05:37:38,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-02-08 05:37:38,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-02-08 05:37:38,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-02-08 05:37:38,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-02-08 05:37:38,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-02-08 05:37:38,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-02-08 05:37:38,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-02-08 05:37:38,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-02-08 05:37:38,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-02-08 05:37:38,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-02-08 05:37:38,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-02-08 05:37:38,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-02-08 05:37:38,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-02-08 05:37:38,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:37:38,650 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:38,658 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:38,658 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:38,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:38 BasicIcfg [2025-02-08 05:37:38,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:38,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:38,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:38,665 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:38,665 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:18" (3/4) ... [2025-02-08 05:37:38,666 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:38,672 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:38,672 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:38,672 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:38,682 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-08 05:37:38,686 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:38,686 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:38,686 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:38,812 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:38,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:38,816 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:38,817 INFO L158 Benchmark]: Toolchain (without parser) took 21188.42ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 88.0MB in the beginning and 969.7MB in the end (delta: -881.7MB). Peak memory consumption was 439.3MB. Max. memory is 16.1GB. [2025-02-08 05:37:38,817 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 226.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:38,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.91ms. Allocated memory is still 117.4MB. Free memory was 88.0MB in the beginning and 74.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:37:38,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.36ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 70.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:38,820 INFO L158 Benchmark]: Boogie Preprocessor took 43.96ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 68.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:38,820 INFO L158 Benchmark]: IcfgBuilder took 752.34ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 80.9MB in the end (delta: -12.0MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2025-02-08 05:37:38,820 INFO L158 Benchmark]: TraceAbstraction took 19988.89ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 80.3MB in the beginning and 978.1MB in the end (delta: -897.8MB). Peak memory consumption was 425.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:38,821 INFO L158 Benchmark]: Witness Printer took 151.11ms. Allocated memory is still 1.4GB. Free memory was 978.1MB in the beginning and 969.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:38,823 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.26ms. Allocated memory is still 226.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.91ms. Allocated memory is still 117.4MB. Free memory was 88.0MB in the beginning and 74.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.36ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 70.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.96ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 68.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 752.34ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 80.9MB in the end (delta: -12.0MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19988.89ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 80.3MB in the beginning and 978.1MB in the end (delta: -897.8MB). Peak memory consumption was 425.2MB. Max. memory is 16.1GB. * Witness Printer took 151.11ms. Allocated memory is still 1.4GB. Free memory was 978.1MB in the beginning and 969.7MB 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: 120]: 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: 120]: 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: 120]: 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: 108]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 734 locations, 69 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.8s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3780 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2524 mSDsluCounter, 1922 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1388 mSDsCounter, 702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7277 IncrementalHoareTripleChecker+Invalid, 7979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 702 mSolverCounterUnsat, 534 mSDtfsCounter, 7277 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=1401occurred 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.9s InterpolantComputationTime, 9015 NumberOfCodeBlocks, 8655 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 9505 ConstructedInterpolants, 0 QuantifiedInterpolants, 11561 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 38 InterpolantComputations, 32 PerfectInterpolantSequences, 5489/5636 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 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:38,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE