./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:02,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:02,192 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:02,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:02,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:02,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:02,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:02,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:02,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:02,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:02,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:02,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:02,219 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:02,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:02,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:02,219 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:02,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:02,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:02,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:02,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:02,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:02,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:02,220 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:02,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:02,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:02,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:02,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:02,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:02,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:02,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:02,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:02,221 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 -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2025-02-08 05:37:02,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:02,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:02,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:02,454 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:02,454 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:02,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-02-08 05:37:03,614 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a9c25658/8f7f296dfd9d4c2d850605860e12f3d7/FLAGc817a12f5 [2025-02-08 05:37:03,865 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:03,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-02-08 05:37:03,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a9c25658/8f7f296dfd9d4c2d850605860e12f3d7/FLAGc817a12f5 [2025-02-08 05:37:04,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a9c25658/8f7f296dfd9d4c2d850605860e12f3d7 [2025-02-08 05:37:04,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:04,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:04,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:04,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:04,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:04,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:04" (1/1) ... [2025-02-08 05:37:04,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f85e474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:04, skipping insertion in model container [2025-02-08 05:37:04,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:04" (1/1) ... [2025-02-08 05:37:04,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:04,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:04,359 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:04,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:04,404 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:04,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:04 WrapperNode [2025-02-08 05:37:04,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:04,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:04,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:04,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:04,412 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:04" (1/1) ... [2025-02-08 05:37:04,423 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:04" (1/1) ... [2025-02-08 05:37:04,459 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 476 [2025-02-08 05:37:04,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:04,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:04,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:04,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:04,466 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:04" (1/1) ... [2025-02-08 05:37:04,466 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:04" (1/1) ... [2025-02-08 05:37:04,474 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:04" (1/1) ... [2025-02-08 05:37:04,474 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:04" (1/1) ... [2025-02-08 05:37:04,491 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:04" (1/1) ... [2025-02-08 05:37:04,493 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:04" (1/1) ... [2025-02-08 05:37:04,494 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:04" (1/1) ... [2025-02-08 05:37:04,496 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:04" (1/1) ... [2025-02-08 05:37:04,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:04,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:04,504 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:04,504 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:04,505 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:04" (1/1) ... [2025-02-08 05:37:04,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:04,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:04,537 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:04,539 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:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:04,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:04,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:04,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:04,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:04,560 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:04,659 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:04,660 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:04,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: havoc #t~nondet8#1; [2025-02-08 05:37:04,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-1: havoc #t~ret7#1; [2025-02-08 05:37:04,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-2: havoc #t~mem6#1; [2025-02-08 05:37:04,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: assume #race~res1~0 == #t~nondet8#1; [2025-02-08 05:37:04,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: assume !(#race~res1~0 == #t~nondet8#1); [2025-02-08 05:37:04,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-4: havoc #t~mem5#1; [2025-02-08 05:37:04,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-5: #race~res1~0 := #t~nondet8#1; [2025-02-08 05:37:04,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-6: havoc #t~nondet8#1; [2025-02-08 05:37:04,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-7: ~res1~0 := #t~ret7#1; [2025-02-08 05:37:04,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret7#1 && #t~ret7#1 <= 2147483647; [2025-02-08 05:37:04,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:04,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:04,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-11: #t~ret7#1 := minus_#res#1; [2025-02-08 05:37:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: havoc #t~nondet17#1; [2025-02-08 05:37:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: havoc #t~ret16#1; [2025-02-08 05:37:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: havoc #t~mem15#1; [2025-02-08 05:37:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: assume #race~res2~0 == #t~nondet17#1; [2025-02-08 05:37:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: assume !(#race~res2~0 == #t~nondet17#1); [2025-02-08 05:37:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-4: havoc #t~mem14#1; [2025-02-08 05:37:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-5: #race~res2~0 := #t~nondet17#1; [2025-02-08 05:37:04,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-6: havoc #t~nondet17#1; [2025-02-08 05:37:04,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-7: ~res2~0 := #t~ret16#1; [2025-02-08 05:37:04,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret16#1 && #t~ret16#1 <= 2147483647; [2025-02-08 05:37:04,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:04,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:04,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-11: #t~ret16#1 := minus_#res#1; [2025-02-08 05:37:05,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80: havoc #t~nondet26#1; [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-1: havoc #t~ret25#1; [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-2: havoc #t~mem24#1; [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-3: assume #race~res3~0 == #t~nondet26#1; [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-3: assume !(#race~res3~0 == #t~nondet26#1); [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-4: havoc #t~mem23#1; [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-5: #race~res3~0 := #t~nondet26#1; [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-6: havoc #t~nondet26#1; [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-7: ~res3~0 := #t~ret25#1; [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647; [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:05,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-11: #t~ret25#1 := minus_#res#1; [2025-02-08 05:37:05,310 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:05,310 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:05,327 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:05,327 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:05,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:05 BoogieIcfgContainer [2025-02-08 05:37:05,328 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:05,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:05,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:05,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:05,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:04" (1/3) ... [2025-02-08 05:37:05,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e8c36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:05, skipping insertion in model container [2025-02-08 05:37:05,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:04" (2/3) ... [2025-02-08 05:37:05,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e8c36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:05, skipping insertion in model container [2025-02-08 05:37:05,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:05" (3/3) ... [2025-02-08 05:37:05,335 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-02-08 05:37:05,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:05,348 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 563 locations, 1 initial locations, 6 loop locations, and 59 error locations. [2025-02-08 05:37:05,349 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:05,519 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:05,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 572 places, 589 transitions, 1199 flow [2025-02-08 05:37:05,798 INFO L124 PetriNetUnfolderBase]: 27/586 cut-off events. [2025-02-08 05:37:05,800 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:05,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 586 events. 27/586 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1403 event pairs, 0 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 438. Up to 2 conditions per place. [2025-02-08 05:37:05,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 572 places, 589 transitions, 1199 flow [2025-02-08 05:37:05,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 551 places, 566 transitions, 1150 flow [2025-02-08 05:37:05,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:05,843 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;@159713f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:05,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2025-02-08 05:37:05,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:05,847 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:37:05,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:05,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:05,848 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] [2025-02-08 05:37:05,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:05,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1406054074, now seen corresponding path program 1 times [2025-02-08 05:37:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221539665] [2025-02-08 05:37:05,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:05,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:05,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:37:05,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:37:05,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:05,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:05,995 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:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:05,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221539665] [2025-02-08 05:37:05,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221539665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:05,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:05,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:05,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107740464] [2025-02-08 05:37:05,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:06,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:06,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:06,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:06,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:06,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 553 out of 589 [2025-02-08 05:37:06,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 566 transitions, 1150 flow. Second operand has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 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:06,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:06,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 553 of 589 [2025-02-08 05:37:06,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:06,383 INFO L124 PetriNetUnfolderBase]: 45/1345 cut-off events. [2025-02-08 05:37:06,384 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 05:37:06,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 1345 events. 45/1345 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7453 event pairs, 20 based on Foata normal form. 39/1155 useless extension candidates. Maximal degree in co-relation 1070. Up to 51 conditions per place. [2025-02-08 05:37:06,398 INFO L140 encePairwiseOnDemand]: 570/589 looper letters, 14 selfloop transitions, 2 changer transitions 7/549 dead transitions. [2025-02-08 05:37:06,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 549 transitions, 1148 flow [2025-02-08 05:37:06,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1692 transitions. [2025-02-08 05:37:06,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575551782682513 [2025-02-08 05:37:06,412 INFO L175 Difference]: Start difference. First operand has 551 places, 566 transitions, 1150 flow. Second operand 3 states and 1692 transitions. [2025-02-08 05:37:06,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 549 transitions, 1148 flow [2025-02-08 05:37:06,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 549 transitions, 1136 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:06,426 INFO L231 Difference]: Finished difference. Result has 546 places, 542 transitions, 1094 flow [2025-02-08 05:37:06,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1094, PETRI_PLACES=546, PETRI_TRANSITIONS=542} [2025-02-08 05:37:06,431 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -5 predicate places. [2025-02-08 05:37:06,431 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 542 transitions, 1094 flow [2025-02-08 05:37:06,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 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:06,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:06,432 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] [2025-02-08 05:37:06,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:06,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:06,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash 860928457, now seen corresponding path program 1 times [2025-02-08 05:37:06,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:06,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969725060] [2025-02-08 05:37:06,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:06,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:06,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:37:06,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:37:06,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:06,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:06,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:06,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:06,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969725060] [2025-02-08 05:37:06,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969725060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:06,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:06,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:06,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927999166] [2025-02-08 05:37:06,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:06,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:06,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:06,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:06,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:06,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 553 out of 589 [2025-02-08 05:37:06,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 542 transitions, 1094 flow. Second operand has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 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:06,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:06,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 553 of 589 [2025-02-08 05:37:06,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:06,702 INFO L124 PetriNetUnfolderBase]: 29/933 cut-off events. [2025-02-08 05:37:06,703 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:06,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 933 events. 29/933 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4137 event pairs, 12 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 951. Up to 39 conditions per place. [2025-02-08 05:37:06,715 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 14 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2025-02-08 05:37:06,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 541 transitions, 1124 flow [2025-02-08 05:37:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2025-02-08 05:37:06,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9485002829654782 [2025-02-08 05:37:06,719 INFO L175 Difference]: Start difference. First operand has 546 places, 542 transitions, 1094 flow. Second operand 3 states and 1676 transitions. [2025-02-08 05:37:06,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 541 transitions, 1124 flow [2025-02-08 05:37:06,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 541 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:06,727 INFO L231 Difference]: Finished difference. Result has 538 places, 541 transitions, 1092 flow [2025-02-08 05:37:06,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1092, PETRI_PLACES=538, PETRI_TRANSITIONS=541} [2025-02-08 05:37:06,728 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -13 predicate places. [2025-02-08 05:37:06,728 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 541 transitions, 1092 flow [2025-02-08 05:37:06,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 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:06,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:06,729 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] [2025-02-08 05:37:06,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:06,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:06,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:06,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1490854385, now seen corresponding path program 1 times [2025-02-08 05:37:06,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:06,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409705144] [2025-02-08 05:37:06,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:06,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:37:06,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:37:06,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:06,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:06,762 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:06,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:06,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409705144] [2025-02-08 05:37:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409705144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:06,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:06,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596848999] [2025-02-08 05:37:06,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:06,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:06,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:06,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:06,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:06,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 553 out of 589 [2025-02-08 05:37:06,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 541 transitions, 1092 flow. Second operand has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 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:06,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:06,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 553 of 589 [2025-02-08 05:37:06,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:07,028 INFO L124 PetriNetUnfolderBase]: 45/1312 cut-off events. [2025-02-08 05:37:07,028 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2025-02-08 05:37:07,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1312 events. 45/1312 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6927 event pairs, 20 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1332. Up to 51 conditions per place. [2025-02-08 05:37:07,047 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 14 selfloop transitions, 2 changer transitions 0/540 dead transitions. [2025-02-08 05:37:07,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 540 transitions, 1122 flow [2025-02-08 05:37:07,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2025-02-08 05:37:07,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9485002829654782 [2025-02-08 05:37:07,051 INFO L175 Difference]: Start difference. First operand has 538 places, 541 transitions, 1092 flow. Second operand 3 states and 1676 transitions. [2025-02-08 05:37:07,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 540 transitions, 1122 flow [2025-02-08 05:37:07,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 540 transitions, 1118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:07,059 INFO L231 Difference]: Finished difference. Result has 537 places, 540 transitions, 1090 flow [2025-02-08 05:37:07,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1090, PETRI_PLACES=537, PETRI_TRANSITIONS=540} [2025-02-08 05:37:07,060 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -14 predicate places. [2025-02-08 05:37:07,060 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 540 transitions, 1090 flow [2025-02-08 05:37:07,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 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:07,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:07,061 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] [2025-02-08 05:37:07,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:07,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:07,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1939188753, now seen corresponding path program 1 times [2025-02-08 05:37:07,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:07,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290800957] [2025-02-08 05:37:07,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:07,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:07,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:37:07,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:37:07,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:07,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:07,098 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:07,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:07,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290800957] [2025-02-08 05:37:07,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290800957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:07,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:07,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:07,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133426162] [2025-02-08 05:37:07,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:07,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:07,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:07,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:07,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:07,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 589 [2025-02-08 05:37:07,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 540 transitions, 1090 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 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:07,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:07,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 589 [2025-02-08 05:37:07,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:07,459 INFO L124 PetriNetUnfolderBase]: 111/2223 cut-off events. [2025-02-08 05:37:07,459 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:07,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 2223 events. 111/2223 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 16440 event pairs, 64 based on Foata normal form. 0/1872 useless extension candidates. Maximal degree in co-relation 2348. Up to 138 conditions per place. [2025-02-08 05:37:07,486 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 16 selfloop transitions, 1 changer transitions 0/535 dead transitions. [2025-02-08 05:37:07,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 535 transitions, 1114 flow [2025-02-08 05:37:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1669 transitions. [2025-02-08 05:37:07,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.944538766270515 [2025-02-08 05:37:07,489 INFO L175 Difference]: Start difference. First operand has 537 places, 540 transitions, 1090 flow. Second operand 3 states and 1669 transitions. [2025-02-08 05:37:07,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 535 transitions, 1114 flow [2025-02-08 05:37:07,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 535 transitions, 1110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:07,497 INFO L231 Difference]: Finished difference. Result has 532 places, 535 transitions, 1078 flow [2025-02-08 05:37:07,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1078, PETRI_PLACES=532, PETRI_TRANSITIONS=535} [2025-02-08 05:37:07,499 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -19 predicate places. [2025-02-08 05:37:07,499 INFO L471 AbstractCegarLoop]: Abstraction has has 532 places, 535 transitions, 1078 flow [2025-02-08 05:37:07,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 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:07,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:07,500 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] [2025-02-08 05:37:07,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:07,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:07,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash -511394816, now seen corresponding path program 1 times [2025-02-08 05:37:07,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:07,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7508755] [2025-02-08 05:37:07,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:07,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:37:07,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:37:07,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:07,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:08,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:08,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7508755] [2025-02-08 05:37:08,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7508755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:08,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:08,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:08,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228506766] [2025-02-08 05:37:08,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:08,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:08,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:08,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:08,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:08,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 589 [2025-02-08 05:37:08,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 535 transitions, 1078 flow. Second operand has 6 states, 6 states have (on average 476.5) internal successors, (2859), 6 states have internal predecessors, (2859), 0 states have call successors, (0), 0 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:08,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:08,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 589 [2025-02-08 05:37:08,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,211 INFO L124 PetriNetUnfolderBase]: 11573/45589 cut-off events. [2025-02-08 05:37:14,211 INFO L125 PetriNetUnfolderBase]: For 611/613 co-relation queries the response was YES. [2025-02-08 05:37:14,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62782 conditions, 45589 events. 11573/45589 cut-off events. For 611/613 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 603327 event pairs, 10080 based on Foata normal form. 0/39186 useless extension candidates. Maximal degree in co-relation 62733. Up to 16868 conditions per place. [2025-02-08 05:37:14,548 INFO L140 encePairwiseOnDemand]: 571/589 looper letters, 78 selfloop transitions, 15 changer transitions 0/532 dead transitions. [2025-02-08 05:37:14,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 532 transitions, 1258 flow [2025-02-08 05:37:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2946 transitions. [2025-02-08 05:37:14,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.833616298811545 [2025-02-08 05:37:14,554 INFO L175 Difference]: Start difference. First operand has 532 places, 535 transitions, 1078 flow. Second operand 6 states and 2946 transitions. [2025-02-08 05:37:14,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 532 transitions, 1258 flow [2025-02-08 05:37:14,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 532 transitions, 1257 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:14,564 INFO L231 Difference]: Finished difference. Result has 533 places, 532 transitions, 1101 flow [2025-02-08 05:37:14,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1101, PETRI_PLACES=533, PETRI_TRANSITIONS=532} [2025-02-08 05:37:14,565 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -18 predicate places. [2025-02-08 05:37:14,565 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 532 transitions, 1101 flow [2025-02-08 05:37:14,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 476.5) internal successors, (2859), 6 states have internal predecessors, (2859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,569 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] [2025-02-08 05:37:14,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:14,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:14,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:14,570 INFO L85 PathProgramCache]: Analyzing trace with hash -980897679, now seen corresponding path program 1 times [2025-02-08 05:37:14,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:14,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314346712] [2025-02-08 05:37:14,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:14,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:37:14,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:37:14,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:14,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:14,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314346712] [2025-02-08 05:37:14,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314346712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:14,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:14,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:14,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679756287] [2025-02-08 05:37:14,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:14,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:14,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:14,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:14,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:14,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 589 [2025-02-08 05:37:14,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 532 transitions, 1101 flow. Second operand has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:14,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 589 [2025-02-08 05:37:14,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,973 INFO L124 PetriNetUnfolderBase]: 49/1575 cut-off events. [2025-02-08 05:37:14,973 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:37:14,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 1575 events. 49/1575 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8782 event pairs, 20 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 1610. Up to 50 conditions per place. [2025-02-08 05:37:14,986 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 13 selfloop transitions, 2 changer transitions 0/531 dead transitions. [2025-02-08 05:37:14,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 531 transitions, 1129 flow [2025-02-08 05:37:14,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:14,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1678 transitions. [2025-02-08 05:37:14,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9496321448783248 [2025-02-08 05:37:14,990 INFO L175 Difference]: Start difference. First operand has 533 places, 532 transitions, 1101 flow. Second operand 3 states and 1678 transitions. [2025-02-08 05:37:14,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 531 transitions, 1129 flow [2025-02-08 05:37:14,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 531 transitions, 1099 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:14,997 INFO L231 Difference]: Finished difference. Result has 529 places, 531 transitions, 1073 flow [2025-02-08 05:37:14,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=529, PETRI_TRANSITIONS=531} [2025-02-08 05:37:14,998 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -22 predicate places. [2025-02-08 05:37:14,998 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 531 transitions, 1073 flow [2025-02-08 05:37:14,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,999 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] [2025-02-08 05:37:15,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:15,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:15,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2042092842, now seen corresponding path program 1 times [2025-02-08 05:37:15,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706668016] [2025-02-08 05:37:15,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:37:15,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:37:15,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706668016] [2025-02-08 05:37:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706668016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193321825] [2025-02-08 05:37:15,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 589 [2025-02-08 05:37:15,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 531 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 589 [2025-02-08 05:37:15,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,249 INFO L124 PetriNetUnfolderBase]: 65/1466 cut-off events. [2025-02-08 05:37:15,249 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:37:15,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 1466 events. 65/1466 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8837 event pairs, 32 based on Foata normal form. 0/1255 useless extension candidates. Maximal degree in co-relation 1521. Up to 87 conditions per place. [2025-02-08 05:37:15,272 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 16 selfloop transitions, 1 changer transitions 0/526 dead transitions. [2025-02-08 05:37:15,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 526 transitions, 1097 flow [2025-02-08 05:37:15,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1669 transitions. [2025-02-08 05:37:15,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.944538766270515 [2025-02-08 05:37:15,278 INFO L175 Difference]: Start difference. First operand has 529 places, 531 transitions, 1073 flow. Second operand 3 states and 1669 transitions. [2025-02-08 05:37:15,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 526 transitions, 1097 flow [2025-02-08 05:37:15,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 526 transitions, 1093 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:15,284 INFO L231 Difference]: Finished difference. Result has 524 places, 526 transitions, 1061 flow [2025-02-08 05:37:15,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=524, PETRI_TRANSITIONS=526} [2025-02-08 05:37:15,289 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -27 predicate places. [2025-02-08 05:37:15,289 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 526 transitions, 1061 flow [2025-02-08 05:37:15,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,290 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] [2025-02-08 05:37:15,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:15,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:15,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,290 INFO L85 PathProgramCache]: Analyzing trace with hash 632474985, now seen corresponding path program 1 times [2025-02-08 05:37:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951573776] [2025-02-08 05:37:15,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:37:15,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:37:15,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:15,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951573776] [2025-02-08 05:37:15,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951573776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082930968] [2025-02-08 05:37:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 589 [2025-02-08 05:37:15,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 526 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 589 [2025-02-08 05:37:15,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,452 INFO L124 PetriNetUnfolderBase]: 29/947 cut-off events. [2025-02-08 05:37:15,453 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:37:15,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 947 events. 29/947 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3956 event pairs, 12 based on Foata normal form. 0/824 useless extension candidates. Maximal degree in co-relation 948. Up to 38 conditions per place. [2025-02-08 05:37:15,462 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 13 selfloop transitions, 2 changer transitions 0/525 dead transitions. [2025-02-08 05:37:15,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 525 transitions, 1089 flow [2025-02-08 05:37:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1678 transitions. [2025-02-08 05:37:15,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9496321448783248 [2025-02-08 05:37:15,465 INFO L175 Difference]: Start difference. First operand has 524 places, 526 transitions, 1061 flow. Second operand 3 states and 1678 transitions. [2025-02-08 05:37:15,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 525 transitions, 1089 flow [2025-02-08 05:37:15,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 525 transitions, 1088 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:15,471 INFO L231 Difference]: Finished difference. Result has 524 places, 525 transitions, 1062 flow [2025-02-08 05:37:15,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1062, PETRI_PLACES=524, PETRI_TRANSITIONS=525} [2025-02-08 05:37:15,473 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -27 predicate places. [2025-02-08 05:37:15,473 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 525 transitions, 1062 flow [2025-02-08 05:37:15,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,474 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:15,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:15,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:15,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1287156068, now seen corresponding path program 1 times [2025-02-08 05:37:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379847430] [2025-02-08 05:37:15,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:37:15,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:37:15,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:15,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379847430] [2025-02-08 05:37:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379847430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220785658] [2025-02-08 05:37:15,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 589 [2025-02-08 05:37:15,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 525 transitions, 1062 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 589 [2025-02-08 05:37:15,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,771 INFO L124 PetriNetUnfolderBase]: 115/2169 cut-off events. [2025-02-08 05:37:15,772 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2025-02-08 05:37:15,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2325 conditions, 2169 events. 115/2169 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 15563 event pairs, 64 based on Foata normal form. 0/1859 useless extension candidates. Maximal degree in co-relation 2275. Up to 141 conditions per place. [2025-02-08 05:37:15,798 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 16 selfloop transitions, 1 changer transitions 0/520 dead transitions. [2025-02-08 05:37:15,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 520 transitions, 1086 flow [2025-02-08 05:37:15,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1669 transitions. [2025-02-08 05:37:15,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.944538766270515 [2025-02-08 05:37:15,801 INFO L175 Difference]: Start difference. First operand has 524 places, 525 transitions, 1062 flow. Second operand 3 states and 1669 transitions. [2025-02-08 05:37:15,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 520 transitions, 1086 flow [2025-02-08 05:37:15,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 520 transitions, 1082 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:15,807 INFO L231 Difference]: Finished difference. Result has 519 places, 520 transitions, 1050 flow [2025-02-08 05:37:15,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1050, PETRI_PLACES=519, PETRI_TRANSITIONS=520} [2025-02-08 05:37:15,809 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -32 predicate places. [2025-02-08 05:37:15,809 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 520 transitions, 1050 flow [2025-02-08 05:37:15,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:15,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:15,811 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:15,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash -23150600, now seen corresponding path program 1 times [2025-02-08 05:37:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710112427] [2025-02-08 05:37:15,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-08 05:37:15,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-08 05:37:15,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:15,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710112427] [2025-02-08 05:37:15,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710112427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21300332] [2025-02-08 05:37:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 589 [2025-02-08 05:37:15,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 520 transitions, 1050 flow. Second operand has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 589 [2025-02-08 05:37:15,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,028 INFO L124 PetriNetUnfolderBase]: 33/745 cut-off events. [2025-02-08 05:37:16,029 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-08 05:37:16,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 745 events. 33/745 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2706 event pairs, 20 based on Foata normal form. 0/663 useless extension candidates. Maximal degree in co-relation 757. Up to 50 conditions per place. [2025-02-08 05:37:16,035 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 13 selfloop transitions, 2 changer transitions 0/519 dead transitions. [2025-02-08 05:37:16,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 519 transitions, 1078 flow [2025-02-08 05:37:16,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1678 transitions. [2025-02-08 05:37:16,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9496321448783248 [2025-02-08 05:37:16,038 INFO L175 Difference]: Start difference. First operand has 519 places, 520 transitions, 1050 flow. Second operand 3 states and 1678 transitions. [2025-02-08 05:37:16,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 519 transitions, 1078 flow [2025-02-08 05:37:16,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 519 transitions, 1077 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:16,043 INFO L231 Difference]: Finished difference. Result has 519 places, 519 transitions, 1051 flow [2025-02-08 05:37:16,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1051, PETRI_PLACES=519, PETRI_TRANSITIONS=519} [2025-02-08 05:37:16,044 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -32 predicate places. [2025-02-08 05:37:16,045 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 519 transitions, 1051 flow [2025-02-08 05:37:16,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,046 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:16,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:16,046 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:16,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash 129297416, now seen corresponding path program 1 times [2025-02-08 05:37:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676550048] [2025-02-08 05:37:16,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 05:37:16,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 05:37:16,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:16,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676550048] [2025-02-08 05:37:16,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676550048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689920166] [2025-02-08 05:37:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 589 [2025-02-08 05:37:16,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 519 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 589 [2025-02-08 05:37:16,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,181 INFO L124 PetriNetUnfolderBase]: 25/897 cut-off events. [2025-02-08 05:37:16,181 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:16,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 897 events. 25/897 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3829 event pairs, 4 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 894. Up to 18 conditions per place. [2025-02-08 05:37:16,190 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 11 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-02-08 05:37:16,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 520 transitions, 1081 flow [2025-02-08 05:37:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1691 transitions. [2025-02-08 05:37:16,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956989247311828 [2025-02-08 05:37:16,193 INFO L175 Difference]: Start difference. First operand has 519 places, 519 transitions, 1051 flow. Second operand 3 states and 1691 transitions. [2025-02-08 05:37:16,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 520 transitions, 1081 flow [2025-02-08 05:37:16,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 520 transitions, 1077 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:16,199 INFO L231 Difference]: Finished difference. Result has 518 places, 518 transitions, 1049 flow [2025-02-08 05:37:16,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=518, PETRI_TRANSITIONS=518} [2025-02-08 05:37:16,200 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -33 predicate places. [2025-02-08 05:37:16,200 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 518 transitions, 1049 flow [2025-02-08 05:37:16,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:16,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:16,201 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:16,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1098582004, now seen corresponding path program 1 times [2025-02-08 05:37:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894427706] [2025-02-08 05:37:16,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:37:16,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:37:16,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:16,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894427706] [2025-02-08 05:37:16,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894427706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468754297] [2025-02-08 05:37:16,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 589 [2025-02-08 05:37:16,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 518 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 559.6666666666666) internal successors, (1679), 3 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 589 [2025-02-08 05:37:16,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,359 INFO L124 PetriNetUnfolderBase]: 23/796 cut-off events. [2025-02-08 05:37:16,360 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2025-02-08 05:37:16,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 796 events. 23/796 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2971 event pairs, 4 based on Foata normal form. 1/709 useless extension candidates. Maximal degree in co-relation 790. Up to 19 conditions per place. [2025-02-08 05:37:16,368 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 12 selfloop transitions, 2 changer transitions 0/519 dead transitions. [2025-02-08 05:37:16,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 519 transitions, 1081 flow [2025-02-08 05:37:16,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1689 transitions. [2025-02-08 05:37:16,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558573853989814 [2025-02-08 05:37:16,371 INFO L175 Difference]: Start difference. First operand has 518 places, 518 transitions, 1049 flow. Second operand 3 states and 1689 transitions. [2025-02-08 05:37:16,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 519 transitions, 1081 flow [2025-02-08 05:37:16,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 519 transitions, 1077 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:16,378 INFO L231 Difference]: Finished difference. Result has 517 places, 517 transitions, 1047 flow [2025-02-08 05:37:16,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1047, PETRI_PLACES=517, PETRI_TRANSITIONS=517} [2025-02-08 05:37:16,380 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -34 predicate places. [2025-02-08 05:37:16,380 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 517 transitions, 1047 flow [2025-02-08 05:37:16,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 559.6666666666666) internal successors, (1679), 3 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:16,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:16,382 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1572932527, now seen corresponding path program 1 times [2025-02-08 05:37:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051050678] [2025-02-08 05:37:16,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 05:37:16,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 05:37:16,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:16,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051050678] [2025-02-08 05:37:16,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051050678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:16,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850398485] [2025-02-08 05:37:16,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 589 [2025-02-08 05:37:16,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 517 transitions, 1047 flow. Second operand has 3 states, 3 states have (on average 558.6666666666666) internal successors, (1676), 3 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 589 [2025-02-08 05:37:16,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,545 INFO L124 PetriNetUnfolderBase]: 33/900 cut-off events. [2025-02-08 05:37:16,546 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2025-02-08 05:37:16,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 900 events. 33/900 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3835 event pairs, 12 based on Foata normal form. 1/795 useless extension candidates. Maximal degree in co-relation 931. Up to 39 conditions per place. [2025-02-08 05:37:16,554 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 14 selfloop transitions, 3 changer transitions 0/520 dead transitions. [2025-02-08 05:37:16,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 520 transitions, 1089 flow [2025-02-08 05:37:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1689 transitions. [2025-02-08 05:37:16,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558573853989814 [2025-02-08 05:37:16,557 INFO L175 Difference]: Start difference. First operand has 517 places, 517 transitions, 1047 flow. Second operand 3 states and 1689 transitions. [2025-02-08 05:37:16,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 520 transitions, 1089 flow [2025-02-08 05:37:16,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 520 transitions, 1085 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:16,565 INFO L231 Difference]: Finished difference. Result has 519 places, 518 transitions, 1061 flow [2025-02-08 05:37:16,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=519, PETRI_TRANSITIONS=518} [2025-02-08 05:37:16,567 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -32 predicate places. [2025-02-08 05:37:16,567 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 518 transitions, 1061 flow [2025-02-08 05:37:16,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 558.6666666666666) internal successors, (1676), 3 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,568 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] [2025-02-08 05:37:16,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:16,568 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:16,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1547818057, now seen corresponding path program 1 times [2025-02-08 05:37:16,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213990737] [2025-02-08 05:37:16,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:37:16,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:37:16,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,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:16,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213990737] [2025-02-08 05:37:16,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213990737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526503787] [2025-02-08 05:37:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2025-02-08 05:37:16,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 518 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2025-02-08 05:37:16,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,846 INFO L124 PetriNetUnfolderBase]: 113/1858 cut-off events. [2025-02-08 05:37:16,846 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2025-02-08 05:37:16,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 1858 events. 113/1858 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 12636 event pairs, 24 based on Foata normal form. 0/1639 useless extension candidates. Maximal degree in co-relation 2052. Up to 151 conditions per place. [2025-02-08 05:37:16,868 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 20 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-02-08 05:37:16,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 521 transitions, 1116 flow [2025-02-08 05:37:16,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1682 transitions. [2025-02-08 05:37:16,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518958687040181 [2025-02-08 05:37:16,871 INFO L175 Difference]: Start difference. First operand has 519 places, 518 transitions, 1061 flow. Second operand 3 states and 1682 transitions. [2025-02-08 05:37:16,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 521 transitions, 1116 flow [2025-02-08 05:37:16,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 521 transitions, 1110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:16,877 INFO L231 Difference]: Finished difference. Result has 516 places, 516 transitions, 1061 flow [2025-02-08 05:37:16,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=516, PETRI_TRANSITIONS=516} [2025-02-08 05:37:16,878 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -35 predicate places. [2025-02-08 05:37:16,878 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 516 transitions, 1061 flow [2025-02-08 05:37:16,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,879 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] [2025-02-08 05:37:16,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:16,879 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:16,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1068917461, now seen corresponding path program 1 times [2025-02-08 05:37:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779927687] [2025-02-08 05:37:16,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:37:16,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:37:16,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:16,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779927687] [2025-02-08 05:37:16,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779927687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:16,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134870112] [2025-02-08 05:37:16,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:16,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:16,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 589 [2025-02-08 05:37:16,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 516 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 560.0) internal successors, (1680), 3 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 589 [2025-02-08 05:37:16,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,045 INFO L124 PetriNetUnfolderBase]: 49/1027 cut-off events. [2025-02-08 05:37:17,046 INFO L125 PetriNetUnfolderBase]: For 30/46 co-relation queries the response was YES. [2025-02-08 05:37:17,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1027 events. 49/1027 cut-off events. For 30/46 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4513 event pairs, 8 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 1066. Up to 38 conditions per place. [2025-02-08 05:37:17,057 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 12 selfloop transitions, 2 changer transitions 0/517 dead transitions. [2025-02-08 05:37:17,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 517 transitions, 1093 flow [2025-02-08 05:37:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1689 transitions. [2025-02-08 05:37:17,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558573853989814 [2025-02-08 05:37:17,060 INFO L175 Difference]: Start difference. First operand has 516 places, 516 transitions, 1061 flow. Second operand 3 states and 1689 transitions. [2025-02-08 05:37:17,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 517 transitions, 1093 flow [2025-02-08 05:37:17,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 517 transitions, 1093 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:17,065 INFO L231 Difference]: Finished difference. Result has 517 places, 515 transitions, 1063 flow [2025-02-08 05:37:17,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1063, PETRI_PLACES=517, PETRI_TRANSITIONS=515} [2025-02-08 05:37:17,066 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -34 predicate places. [2025-02-08 05:37:17,066 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 515 transitions, 1063 flow [2025-02-08 05:37:17,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 560.0) internal successors, (1680), 3 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,067 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] [2025-02-08 05:37:17,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:17,068 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:17,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1032579898, now seen corresponding path program 1 times [2025-02-08 05:37:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387364913] [2025-02-08 05:37:17,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:37:17,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:37:17,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:17,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:17,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:17,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387364913] [2025-02-08 05:37:17,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387364913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:17,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:17,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851372146] [2025-02-08 05:37:17,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:17,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:17,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 526 out of 589 [2025-02-08 05:37:17,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 515 transitions, 1063 flow. Second operand has 8 states, 8 states have (on average 530.125) internal successors, (4241), 8 states have internal predecessors, (4241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 526 of 589 [2025-02-08 05:37:17,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:18,092 INFO L124 PetriNetUnfolderBase]: 99/1850 cut-off events. [2025-02-08 05:37:18,092 INFO L125 PetriNetUnfolderBase]: For 7/31 co-relation queries the response was YES. [2025-02-08 05:37:18,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2229 conditions, 1850 events. 99/1850 cut-off events. For 7/31 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 11381 event pairs, 47 based on Foata normal form. 3/1675 useless extension candidates. Maximal degree in co-relation 2176. Up to 158 conditions per place. [2025-02-08 05:37:18,114 INFO L140 encePairwiseOnDemand]: 575/589 looper letters, 69 selfloop transitions, 15 changer transitions 0/553 dead transitions. [2025-02-08 05:37:18,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 553 transitions, 1323 flow [2025-02-08 05:37:18,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5870 transitions. [2025-02-08 05:37:18,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060040129649637 [2025-02-08 05:37:18,123 INFO L175 Difference]: Start difference. First operand has 517 places, 515 transitions, 1063 flow. Second operand 11 states and 5870 transitions. [2025-02-08 05:37:18,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 553 transitions, 1323 flow [2025-02-08 05:37:18,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 553 transitions, 1319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:18,130 INFO L231 Difference]: Finished difference. Result has 530 places, 523 transitions, 1135 flow [2025-02-08 05:37:18,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1135, PETRI_PLACES=530, PETRI_TRANSITIONS=523} [2025-02-08 05:37:18,130 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -21 predicate places. [2025-02-08 05:37:18,131 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 523 transitions, 1135 flow [2025-02-08 05:37:18,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 530.125) internal successors, (4241), 8 states have internal predecessors, (4241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,132 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] [2025-02-08 05:37:18,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:18,132 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:18,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash 483049196, now seen corresponding path program 1 times [2025-02-08 05:37:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368600271] [2025-02-08 05:37:18,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-08 05:37:18,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-08 05:37:18,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:18,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368600271] [2025-02-08 05:37:18,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368600271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:18,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499230336] [2025-02-08 05:37:18,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:18,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:18,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:18,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 589 [2025-02-08 05:37:18,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 523 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 559.0) internal successors, (1677), 3 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:18,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 589 [2025-02-08 05:37:18,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:18,425 INFO L124 PetriNetUnfolderBase]: 124/1812 cut-off events. [2025-02-08 05:37:18,425 INFO L125 PetriNetUnfolderBase]: For 61/94 co-relation queries the response was YES. [2025-02-08 05:37:18,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 1812 events. 124/1812 cut-off events. For 61/94 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11732 event pairs, 48 based on Foata normal form. 0/1611 useless extension candidates. Maximal degree in co-relation 2103. Up to 152 conditions per place. [2025-02-08 05:37:18,449 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 14 selfloop transitions, 3 changer transitions 0/526 dead transitions. [2025-02-08 05:37:18,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 526 transitions, 1177 flow [2025-02-08 05:37:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1689 transitions. [2025-02-08 05:37:18,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558573853989814 [2025-02-08 05:37:18,451 INFO L175 Difference]: Start difference. First operand has 530 places, 523 transitions, 1135 flow. Second operand 3 states and 1689 transitions. [2025-02-08 05:37:18,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 526 transitions, 1177 flow [2025-02-08 05:37:18,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 526 transitions, 1173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:18,459 INFO L231 Difference]: Finished difference. Result has 533 places, 524 transitions, 1149 flow [2025-02-08 05:37:18,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1149, PETRI_PLACES=533, PETRI_TRANSITIONS=524} [2025-02-08 05:37:18,460 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -18 predicate places. [2025-02-08 05:37:18,460 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 524 transitions, 1149 flow [2025-02-08 05:37:18,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 559.0) internal successors, (1677), 3 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,461 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] [2025-02-08 05:37:18,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:18,461 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:18,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1240167240, now seen corresponding path program 1 times [2025-02-08 05:37:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118413543] [2025-02-08 05:37:18,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-08 05:37:18,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-08 05:37:18,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,515 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:18,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118413543] [2025-02-08 05:37:18,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118413543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:18,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047960739] [2025-02-08 05:37:18,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:18,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:18,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 589 [2025-02-08 05:37:18,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 524 transitions, 1149 flow. Second operand has 3 states, 3 states have (on average 559.3333333333334) internal successors, (1678), 3 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:18,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 589 [2025-02-08 05:37:18,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:18,705 INFO L124 PetriNetUnfolderBase]: 120/1609 cut-off events. [2025-02-08 05:37:18,705 INFO L125 PetriNetUnfolderBase]: For 97/162 co-relation queries the response was YES. [2025-02-08 05:37:18,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1925 conditions, 1609 events. 120/1609 cut-off events. For 97/162 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 9409 event pairs, 48 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1866. Up to 149 conditions per place. [2025-02-08 05:37:18,724 INFO L140 encePairwiseOnDemand]: 585/589 looper letters, 14 selfloop transitions, 3 changer transitions 0/527 dead transitions. [2025-02-08 05:37:18,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 527 transitions, 1191 flow [2025-02-08 05:37:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1689 transitions. [2025-02-08 05:37:18,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558573853989814 [2025-02-08 05:37:18,726 INFO L175 Difference]: Start difference. First operand has 533 places, 524 transitions, 1149 flow. Second operand 3 states and 1689 transitions. [2025-02-08 05:37:18,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 527 transitions, 1191 flow [2025-02-08 05:37:18,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 527 transitions, 1185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:18,732 INFO L231 Difference]: Finished difference. Result has 535 places, 525 transitions, 1161 flow [2025-02-08 05:37:18,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1161, PETRI_PLACES=535, PETRI_TRANSITIONS=525} [2025-02-08 05:37:18,733 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -16 predicate places. [2025-02-08 05:37:18,733 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 525 transitions, 1161 flow [2025-02-08 05:37:18,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 559.3333333333334) internal successors, (1678), 3 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,734 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] [2025-02-08 05:37:18,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:18,734 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:18,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2065885466, now seen corresponding path program 1 times [2025-02-08 05:37:18,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631762242] [2025-02-08 05:37:18,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-08 05:37:18,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-08 05:37:18,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:18,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631762242] [2025-02-08 05:37:18,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631762242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:18,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034533094] [2025-02-08 05:37:18,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:18,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:18,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:19,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 526 out of 589 [2025-02-08 05:37:19,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 525 transitions, 1161 flow. Second operand has 8 states, 8 states have (on average 530.25) internal successors, (4242), 8 states have internal predecessors, (4242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:19,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:19,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 526 of 589 [2025-02-08 05:37:19,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:19,546 INFO L124 PetriNetUnfolderBase]: 103/1377 cut-off events. [2025-02-08 05:37:19,546 INFO L125 PetriNetUnfolderBase]: For 64/81 co-relation queries the response was YES. [2025-02-08 05:37:19,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1796 conditions, 1377 events. 103/1377 cut-off events. For 64/81 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7394 event pairs, 46 based on Foata normal form. 3/1270 useless extension candidates. Maximal degree in co-relation 1734. Up to 174 conditions per place. [2025-02-08 05:37:19,564 INFO L140 encePairwiseOnDemand]: 575/589 looper letters, 69 selfloop transitions, 15 changer transitions 0/558 dead transitions. [2025-02-08 05:37:19,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 558 transitions, 1411 flow [2025-02-08 05:37:19,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:19,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5870 transitions. [2025-02-08 05:37:19,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060040129649637 [2025-02-08 05:37:19,571 INFO L175 Difference]: Start difference. First operand has 535 places, 525 transitions, 1161 flow. Second operand 11 states and 5870 transitions. [2025-02-08 05:37:19,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 558 transitions, 1411 flow [2025-02-08 05:37:19,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 558 transitions, 1405 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:19,579 INFO L231 Difference]: Finished difference. Result has 546 places, 528 transitions, 1210 flow [2025-02-08 05:37:19,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1210, PETRI_PLACES=546, PETRI_TRANSITIONS=528} [2025-02-08 05:37:19,580 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -5 predicate places. [2025-02-08 05:37:19,580 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 528 transitions, 1210 flow [2025-02-08 05:37:19,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 530.25) internal successors, (4242), 8 states have internal predecessors, (4242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:19,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:19,581 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] [2025-02-08 05:37:19,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:19,581 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:19,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:19,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1094072666, now seen corresponding path program 1 times [2025-02-08 05:37:19,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:19,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678749591] [2025-02-08 05:37:19,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:19,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:19,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-08 05:37:19,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-08 05:37:19,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:19,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:19,623 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,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:19,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678749591] [2025-02-08 05:37:19,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678749591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:19,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:19,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:19,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650790915] [2025-02-08 05:37:19,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:19,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:19,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:19,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:19,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2025-02-08 05:37:19,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 528 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 554.0) internal successors, (1662), 3 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:19,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:19,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2025-02-08 05:37:19,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:19,959 INFO L124 PetriNetUnfolderBase]: 119/2471 cut-off events. [2025-02-08 05:37:19,959 INFO L125 PetriNetUnfolderBase]: For 51/79 co-relation queries the response was YES. [2025-02-08 05:37:19,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 2471 events. 119/2471 cut-off events. For 51/79 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 16664 event pairs, 23 based on Foata normal form. 1/2220 useless extension candidates. Maximal degree in co-relation 2837. Up to 143 conditions per place. [2025-02-08 05:37:19,988 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 20 selfloop transitions, 2 changer transitions 0/531 dead transitions. [2025-02-08 05:37:19,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 531 transitions, 1265 flow [2025-02-08 05:37:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1682 transitions. [2025-02-08 05:37:19,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518958687040181 [2025-02-08 05:37:19,990 INFO L175 Difference]: Start difference. First operand has 546 places, 528 transitions, 1210 flow. Second operand 3 states and 1682 transitions. [2025-02-08 05:37:19,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 531 transitions, 1265 flow [2025-02-08 05:37:19,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 531 transitions, 1244 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:37:19,997 INFO L231 Difference]: Finished difference. Result has 538 places, 526 transitions, 1195 flow [2025-02-08 05:37:19,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1195, PETRI_PLACES=538, PETRI_TRANSITIONS=526} [2025-02-08 05:37:19,998 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, -13 predicate places. [2025-02-08 05:37:19,998 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 526 transitions, 1195 flow [2025-02-08 05:37:19,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.0) internal successors, (1662), 3 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:19,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:19,998 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] [2025-02-08 05:37:19,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:19,999 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1470816483, now seen corresponding path program 1 times [2025-02-08 05:37:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122822916] [2025-02-08 05:37:20,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:20,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 05:37:20,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 05:37:20,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:20,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:20,162 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:20,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:20,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122822916] [2025-02-08 05:37:20,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122822916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:20,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:20,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:20,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704876508] [2025-02-08 05:37:20,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:20,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:20,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:20,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:20,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 526 out of 589 [2025-02-08 05:37:20,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 526 transitions, 1195 flow. Second operand has 8 states, 8 states have (on average 530.375) internal successors, (4243), 8 states have internal predecessors, (4243), 0 states have call successors, (0), 0 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,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:20,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 526 of 589 [2025-02-08 05:37:20,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,023 INFO L124 PetriNetUnfolderBase]: 228/2817 cut-off events. [2025-02-08 05:37:21,023 INFO L125 PetriNetUnfolderBase]: For 205/298 co-relation queries the response was YES. [2025-02-08 05:37:21,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 2817 events. 228/2817 cut-off events. For 205/298 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 21336 event pairs, 110 based on Foata normal form. 10/2556 useless extension candidates. Maximal degree in co-relation 3596. Up to 347 conditions per place. [2025-02-08 05:37:21,054 INFO L140 encePairwiseOnDemand]: 575/589 looper letters, 65 selfloop transitions, 15 changer transitions 0/555 dead transitions. [2025-02-08 05:37:21,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 555 transitions, 1429 flow [2025-02-08 05:37:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5861 transitions. [2025-02-08 05:37:21,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9046149097082883 [2025-02-08 05:37:21,061 INFO L175 Difference]: Start difference. First operand has 538 places, 526 transitions, 1195 flow. Second operand 11 states and 5861 transitions. [2025-02-08 05:37:21,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 555 transitions, 1429 flow [2025-02-08 05:37:21,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 555 transitions, 1429 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:21,068 INFO L231 Difference]: Finished difference. Result has 553 places, 534 transitions, 1271 flow [2025-02-08 05:37:21,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1271, PETRI_PLACES=553, PETRI_TRANSITIONS=534} [2025-02-08 05:37:21,069 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 2 predicate places. [2025-02-08 05:37:21,069 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 534 transitions, 1271 flow [2025-02-08 05:37:21,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 530.375) internal successors, (4243), 8 states have internal predecessors, (4243), 0 states have call successors, (0), 0 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,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,070 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] [2025-02-08 05:37:21,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:21,070 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:21,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1435691155, now seen corresponding path program 1 times [2025-02-08 05:37:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207167178] [2025-02-08 05:37:21,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-08 05:37:21,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-08 05:37:21,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:21,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207167178] [2025-02-08 05:37:21,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207167178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:21,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915746503] [2025-02-08 05:37:21,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:21,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:21,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:21,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 526 out of 589 [2025-02-08 05:37:21,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 534 transitions, 1271 flow. Second operand has 8 states, 8 states have (on average 530.25) internal successors, (4242), 8 states have internal predecessors, (4242), 0 states have call successors, (0), 0 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,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 526 of 589 [2025-02-08 05:37:21,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,015 INFO L124 PetriNetUnfolderBase]: 142/2553 cut-off events. [2025-02-08 05:37:22,015 INFO L125 PetriNetUnfolderBase]: For 144/214 co-relation queries the response was YES. [2025-02-08 05:37:22,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3500 conditions, 2553 events. 142/2553 cut-off events. For 144/214 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 17094 event pairs, 65 based on Foata normal form. 3/2374 useless extension candidates. Maximal degree in co-relation 3424. Up to 233 conditions per place. [2025-02-08 05:37:22,042 INFO L140 encePairwiseOnDemand]: 574/589 looper letters, 71 selfloop transitions, 18 changer transitions 0/564 dead transitions. [2025-02-08 05:37:22,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 564 transitions, 1549 flow [2025-02-08 05:37:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5863 transitions. [2025-02-08 05:37:22,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9049235993208828 [2025-02-08 05:37:22,050 INFO L175 Difference]: Start difference. First operand has 553 places, 534 transitions, 1271 flow. Second operand 11 states and 5863 transitions. [2025-02-08 05:37:22,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 564 transitions, 1549 flow [2025-02-08 05:37:22,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 564 transitions, 1545 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:22,059 INFO L231 Difference]: Finished difference. Result has 565 places, 540 transitions, 1362 flow [2025-02-08 05:37:22,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1362, PETRI_PLACES=565, PETRI_TRANSITIONS=540} [2025-02-08 05:37:22,060 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 14 predicate places. [2025-02-08 05:37:22,060 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 540 transitions, 1362 flow [2025-02-08 05:37:22,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 530.25) internal successors, (4242), 8 states have internal predecessors, (4242), 0 states have call successors, (0), 0 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,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,060 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] [2025-02-08 05:37:22,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:22,061 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:22,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,062 INFO L85 PathProgramCache]: Analyzing trace with hash -318968449, now seen corresponding path program 1 times [2025-02-08 05:37:22,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333156838] [2025-02-08 05:37:22,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 05:37:22,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 05:37:22,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:22,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333156838] [2025-02-08 05:37:22,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333156838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:22,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:22,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:22,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077032945] [2025-02-08 05:37:22,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:22,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:22,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:22,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 526 out of 589 [2025-02-08 05:37:22,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 540 transitions, 1362 flow. Second operand has 8 states, 8 states have (on average 530.375) internal successors, (4243), 8 states have internal predecessors, (4243), 0 states have call successors, (0), 0 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,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:22,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 526 of 589 [2025-02-08 05:37:22,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:23,268 INFO L124 PetriNetUnfolderBase]: 291/4012 cut-off events. [2025-02-08 05:37:23,268 INFO L125 PetriNetUnfolderBase]: For 432/544 co-relation queries the response was YES. [2025-02-08 05:37:23,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5590 conditions, 4012 events. 291/4012 cut-off events. For 432/544 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 32725 event pairs, 133 based on Foata normal form. 4/3691 useless extension candidates. Maximal degree in co-relation 5509. Up to 453 conditions per place. [2025-02-08 05:37:23,320 INFO L140 encePairwiseOnDemand]: 574/589 looper letters, 67 selfloop transitions, 18 changer transitions 0/566 dead transitions. [2025-02-08 05:37:23,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 566 transitions, 1624 flow [2025-02-08 05:37:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5854 transitions. [2025-02-08 05:37:23,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9035344960642074 [2025-02-08 05:37:23,326 INFO L175 Difference]: Start difference. First operand has 565 places, 540 transitions, 1362 flow. Second operand 11 states and 5854 transitions. [2025-02-08 05:37:23,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 566 transitions, 1624 flow [2025-02-08 05:37:23,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 566 transitions, 1603 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:37:23,335 INFO L231 Difference]: Finished difference. Result has 573 places, 551 transitions, 1457 flow [2025-02-08 05:37:23,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1457, PETRI_PLACES=573, PETRI_TRANSITIONS=551} [2025-02-08 05:37:23,336 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 22 predicate places. [2025-02-08 05:37:23,336 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 551 transitions, 1457 flow [2025-02-08 05:37:23,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 530.375) internal successors, (4243), 8 states have internal predecessors, (4243), 0 states have call successors, (0), 0 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,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:23,338 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] [2025-02-08 05:37:23,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:23,338 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:23,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash -231807661, now seen corresponding path program 1 times [2025-02-08 05:37:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:23,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660230866] [2025-02-08 05:37:23,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:23,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:23,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 05:37:23,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 05:37:23,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:23,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:23,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:23,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660230866] [2025-02-08 05:37:23,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660230866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:23,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:23,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:23,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707710734] [2025-02-08 05:37:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:23,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:23,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:23,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:23,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:23,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 526 out of 589 [2025-02-08 05:37:23,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 551 transitions, 1457 flow. Second operand has 8 states, 8 states have (on average 530.5) internal successors, (4244), 8 states have internal predecessors, (4244), 0 states have call successors, (0), 0 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,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:23,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 526 of 589 [2025-02-08 05:37:23,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:24,300 INFO L124 PetriNetUnfolderBase]: 281/3500 cut-off events. [2025-02-08 05:37:24,300 INFO L125 PetriNetUnfolderBase]: For 622/681 co-relation queries the response was YES. [2025-02-08 05:37:24,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5020 conditions, 3500 events. 281/3500 cut-off events. For 622/681 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 28580 event pairs, 127 based on Foata normal form. 0/3243 useless extension candidates. Maximal degree in co-relation 4932. Up to 433 conditions per place. [2025-02-08 05:37:24,335 INFO L140 encePairwiseOnDemand]: 574/589 looper letters, 67 selfloop transitions, 18 changer transitions 0/572 dead transitions. [2025-02-08 05:37:24,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 572 transitions, 1709 flow [2025-02-08 05:37:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5854 transitions. [2025-02-08 05:37:24,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9035344960642074 [2025-02-08 05:37:24,339 INFO L175 Difference]: Start difference. First operand has 573 places, 551 transitions, 1457 flow. Second operand 11 states and 5854 transitions. [2025-02-08 05:37:24,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 572 transitions, 1709 flow [2025-02-08 05:37:24,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 572 transitions, 1705 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:24,348 INFO L231 Difference]: Finished difference. Result has 585 places, 557 transitions, 1548 flow [2025-02-08 05:37:24,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1548, PETRI_PLACES=585, PETRI_TRANSITIONS=557} [2025-02-08 05:37:24,349 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 34 predicate places. [2025-02-08 05:37:24,349 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 557 transitions, 1548 flow [2025-02-08 05:37:24,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 530.5) internal successors, (4244), 8 states have internal predecessors, (4244), 0 states have call successors, (0), 0 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,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:24,350 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] [2025-02-08 05:37:24,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:37:24,351 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:24,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash -266709001, now seen corresponding path program 1 times [2025-02-08 05:37:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:24,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826576111] [2025-02-08 05:37:24,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:24,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:24,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-08 05:37:24,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-08 05:37:24,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:24,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:24,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:24,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826576111] [2025-02-08 05:37:24,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826576111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:24,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:24,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:24,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967710592] [2025-02-08 05:37:24,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:24,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:24,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:24,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:24,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:25,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2025-02-08 05:37:25,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 557 transitions, 1548 flow. Second operand has 6 states, 6 states have (on average 539.8333333333334) internal successors, (3239), 6 states have internal predecessors, (3239), 0 states have call successors, (0), 0 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,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:25,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2025-02-08 05:37:25,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:25,747 INFO L124 PetriNetUnfolderBase]: 146/3279 cut-off events. [2025-02-08 05:37:25,747 INFO L125 PetriNetUnfolderBase]: For 559/603 co-relation queries the response was YES. [2025-02-08 05:37:25,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4719 conditions, 3279 events. 146/3279 cut-off events. For 559/603 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 23822 event pairs, 22 based on Foata normal form. 12/3104 useless extension candidates. Maximal degree in co-relation 4627. Up to 173 conditions per place. [2025-02-08 05:37:25,772 INFO L140 encePairwiseOnDemand]: 582/589 looper letters, 38 selfloop transitions, 5 changer transitions 0/563 dead transitions. [2025-02-08 05:37:25,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 563 transitions, 1654 flow [2025-02-08 05:37:25,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3264 transitions. [2025-02-08 05:37:25,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235993208828522 [2025-02-08 05:37:25,774 INFO L175 Difference]: Start difference. First operand has 585 places, 557 transitions, 1548 flow. Second operand 6 states and 3264 transitions. [2025-02-08 05:37:25,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 563 transitions, 1654 flow [2025-02-08 05:37:25,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 563 transitions, 1633 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:37:25,783 INFO L231 Difference]: Finished difference. Result has 581 places, 555 transitions, 1533 flow [2025-02-08 05:37:25,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1533, PETRI_PLACES=581, PETRI_TRANSITIONS=555} [2025-02-08 05:37:25,784 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 30 predicate places. [2025-02-08 05:37:25,784 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 555 transitions, 1533 flow [2025-02-08 05:37:25,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 539.8333333333334) internal successors, (3239), 6 states have internal predecessors, (3239), 0 states have call successors, (0), 0 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,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:25,784 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] [2025-02-08 05:37:25,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:37:25,785 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:25,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:25,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2033296258, now seen corresponding path program 1 times [2025-02-08 05:37:25,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:25,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480444971] [2025-02-08 05:37:25,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:25,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:25,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-08 05:37:25,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-08 05:37:25,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:25,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:26,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:26,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480444971] [2025-02-08 05:37:26,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480444971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:26,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:26,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:26,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447001762] [2025-02-08 05:37:26,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:26,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:26,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:26,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:26,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:26,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2025-02-08 05:37:26,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 555 transitions, 1533 flow. Second operand has 6 states, 6 states have (on average 540.0) internal successors, (3240), 6 states have internal predecessors, (3240), 0 states have call successors, (0), 0 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,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:26,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2025-02-08 05:37:26,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:26,948 INFO L124 PetriNetUnfolderBase]: 163/3370 cut-off events. [2025-02-08 05:37:26,948 INFO L125 PetriNetUnfolderBase]: For 604/685 co-relation queries the response was YES. [2025-02-08 05:37:26,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4823 conditions, 3370 events. 163/3370 cut-off events. For 604/685 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 25450 event pairs, 27 based on Foata normal form. 8/3187 useless extension candidates. Maximal degree in co-relation 4732. Up to 184 conditions per place. [2025-02-08 05:37:26,985 INFO L140 encePairwiseOnDemand]: 582/589 looper letters, 38 selfloop transitions, 5 changer transitions 0/561 dead transitions. [2025-02-08 05:37:26,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 561 transitions, 1639 flow [2025-02-08 05:37:26,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3264 transitions. [2025-02-08 05:37:26,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235993208828522 [2025-02-08 05:37:26,987 INFO L175 Difference]: Start difference. First operand has 581 places, 555 transitions, 1533 flow. Second operand 6 states and 3264 transitions. [2025-02-08 05:37:26,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 561 transitions, 1639 flow [2025-02-08 05:37:26,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 561 transitions, 1629 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:26,997 INFO L231 Difference]: Finished difference. Result has 579 places, 553 transitions, 1529 flow [2025-02-08 05:37:26,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1529, PETRI_PLACES=579, PETRI_TRANSITIONS=553} [2025-02-08 05:37:26,998 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 28 predicate places. [2025-02-08 05:37:26,998 INFO L471 AbstractCegarLoop]: Abstraction has has 579 places, 553 transitions, 1529 flow [2025-02-08 05:37:26,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.0) internal successors, (3240), 6 states have internal predecessors, (3240), 0 states have call successors, (0), 0 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,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:26,999 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:26,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:37:26,999 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:27,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1717151195, now seen corresponding path program 1 times [2025-02-08 05:37:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480089534] [2025-02-08 05:37:27,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:37:27,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:37:27,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480089534] [2025-02-08 05:37:27,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480089534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:27,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869539933] [2025-02-08 05:37:27,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:27,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:27,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:27,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2025-02-08 05:37:27,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 553 transitions, 1529 flow. Second operand has 6 states, 6 states have (on average 539.8333333333334) internal successors, (3239), 6 states have internal predecessors, (3239), 0 states have call successors, (0), 0 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,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2025-02-08 05:37:27,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,190 INFO L124 PetriNetUnfolderBase]: 126/3235 cut-off events. [2025-02-08 05:37:28,190 INFO L125 PetriNetUnfolderBase]: For 533/572 co-relation queries the response was YES. [2025-02-08 05:37:28,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4600 conditions, 3235 events. 126/3235 cut-off events. For 533/572 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 23251 event pairs, 22 based on Foata normal form. 8/3080 useless extension candidates. Maximal degree in co-relation 4509. Up to 175 conditions per place. [2025-02-08 05:37:28,218 INFO L140 encePairwiseOnDemand]: 582/589 looper letters, 38 selfloop transitions, 5 changer transitions 0/559 dead transitions. [2025-02-08 05:37:28,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 559 transitions, 1635 flow [2025-02-08 05:37:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3264 transitions. [2025-02-08 05:37:28,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235993208828522 [2025-02-08 05:37:28,221 INFO L175 Difference]: Start difference. First operand has 579 places, 553 transitions, 1529 flow. Second operand 6 states and 3264 transitions. [2025-02-08 05:37:28,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 559 transitions, 1635 flow [2025-02-08 05:37:28,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 559 transitions, 1625 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:28,230 INFO L231 Difference]: Finished difference. Result has 577 places, 551 transitions, 1525 flow [2025-02-08 05:37:28,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1525, PETRI_PLACES=577, PETRI_TRANSITIONS=551} [2025-02-08 05:37:28,231 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 26 predicate places. [2025-02-08 05:37:28,231 INFO L471 AbstractCegarLoop]: Abstraction has has 577 places, 551 transitions, 1525 flow [2025-02-08 05:37:28,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 539.8333333333334) internal successors, (3239), 6 states have internal predecessors, (3239), 0 states have call successors, (0), 0 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,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,232 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:28,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:37:28,232 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:28,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash -212373277, now seen corresponding path program 1 times [2025-02-08 05:37:28,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757699810] [2025-02-08 05:37:28,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:37:28,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:37:28,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:28,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757699810] [2025-02-08 05:37:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757699810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361948870] [2025-02-08 05:37:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 589 [2025-02-08 05:37:28,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 551 transitions, 1525 flow. Second operand has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 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,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 589 [2025-02-08 05:37:28,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:29,058 INFO L124 PetriNetUnfolderBase]: 297/5250 cut-off events. [2025-02-08 05:37:29,058 INFO L125 PetriNetUnfolderBase]: For 450/470 co-relation queries the response was YES. [2025-02-08 05:37:29,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6772 conditions, 5250 events. 297/5250 cut-off events. For 450/470 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 46019 event pairs, 51 based on Foata normal form. 0/4878 useless extension candidates. Maximal degree in co-relation 6682. Up to 375 conditions per place. [2025-02-08 05:37:29,099 INFO L140 encePairwiseOnDemand]: 583/589 looper letters, 19 selfloop transitions, 2 changer transitions 0/553 dead transitions. [2025-02-08 05:37:29,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 553 transitions, 1575 flow [2025-02-08 05:37:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1681 transitions. [2025-02-08 05:37:29,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513299377475948 [2025-02-08 05:37:29,101 INFO L175 Difference]: Start difference. First operand has 577 places, 551 transitions, 1525 flow. Second operand 3 states and 1681 transitions. [2025-02-08 05:37:29,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 553 transitions, 1575 flow [2025-02-08 05:37:29,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 553 transitions, 1565 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:29,110 INFO L231 Difference]: Finished difference. Result has 571 places, 549 transitions, 1521 flow [2025-02-08 05:37:29,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1521, PETRI_PLACES=571, PETRI_TRANSITIONS=549} [2025-02-08 05:37:29,111 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 20 predicate places. [2025-02-08 05:37:29,111 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 549 transitions, 1521 flow [2025-02-08 05:37:29,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 0 states have call successors, (0), 0 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,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:29,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:29,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:37:29,113 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:29,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash -527131972, now seen corresponding path program 1 times [2025-02-08 05:37:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:29,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445322699] [2025-02-08 05:37:29,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:29,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:29,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-08 05:37:29,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-08 05:37:29,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:29,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:29,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:29,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445322699] [2025-02-08 05:37:29,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445322699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:29,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:29,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:29,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56526560] [2025-02-08 05:37:29,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:29,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:29,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:29,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:29,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2025-02-08 05:37:29,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 549 transitions, 1521 flow. Second operand has 6 states, 6 states have (on average 540.1666666666666) internal successors, (3241), 6 states have internal predecessors, (3241), 0 states have call successors, (0), 0 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,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:29,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2025-02-08 05:37:29,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1527] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][477], [Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 632#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 694#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 645#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 804#(= |#race~a3~0| 0), Black: 766#(<= ~n3~0 0), Black: 780#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 653#(not |thread2Thread1of1ForFork0_#t~short11#1|), Black: 767#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 658#(not |thread3Thread1of1ForFork2_#t~short20#1|), 604#(= |#race~n3~0| 0), Black: 719#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 732#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 718#(<= ~n2~0 0), 442#L105true, 808#(= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0), Black: 802#true, 686#(= |#race~a2~0| 0), Black: 666#(<= ~n1~0 0), Black: 616#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 667#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 680#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 619#true, Black: 684#true, 586#(= |#race~n1~0| 0), Black: 749#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 741#(<= ~n3~0 0), Black: 747#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 598#(= |#race~n2~0| 0), Black: 742#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), 160#L79-16true, Black: 755#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), 621#(= |#race~a1~0| 0)]) [2025-02-08 05:37:30,547 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-02-08 05:37:30,547 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-02-08 05:37:30,547 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-02-08 05:37:30,547 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-02-08 05:37:30,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1527] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][482], [Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 632#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 694#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 645#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 804#(= |#race~a3~0| 0), Black: 766#(<= ~n3~0 0), Black: 780#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 653#(not |thread2Thread1of1ForFork0_#t~short11#1|), Black: 767#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 658#(not |thread3Thread1of1ForFork2_#t~short20#1|), 604#(= |#race~n3~0| 0), Black: 719#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 732#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 718#(<= ~n2~0 0), 442#L105true, Black: 802#true, 686#(= |#race~a2~0| 0), Black: 666#(<= ~n1~0 0), Black: 616#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 667#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 680#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 619#true, Black: 684#true, 586#(= |#race~n1~0| 0), 809#(and (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), 519#L79-15true, Black: 749#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 741#(<= ~n3~0 0), Black: 747#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 598#(= |#race~n2~0| 0), Black: 742#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 755#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), 621#(= |#race~a1~0| 0)]) [2025-02-08 05:37:30,556 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-02-08 05:37:30,556 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-02-08 05:37:30,556 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2025-02-08 05:37:30,556 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-02-08 05:37:30,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1527] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][489], [Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 632#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 694#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 645#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 810#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 804#(= |#race~a3~0| 0), Black: 766#(<= ~n3~0 0), Black: 780#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 653#(not |thread2Thread1of1ForFork0_#t~short11#1|), Black: 767#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 658#(not |thread3Thread1of1ForFork2_#t~short20#1|), 604#(= |#race~n3~0| 0), Black: 719#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 732#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 718#(<= ~n2~0 0), 442#L105true, Black: 802#true, 686#(= |#race~a2~0| 0), Black: 666#(<= ~n1~0 0), Black: 616#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 667#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 680#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 619#true, Black: 684#true, 586#(= |#race~n1~0| 0), Black: 749#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 741#(<= ~n3~0 0), Black: 747#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 598#(= |#race~n2~0| 0), Black: 742#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 755#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), 621#(= |#race~a1~0| 0), 313#L79-14true]) [2025-02-08 05:37:30,560 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-02-08 05:37:30,560 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-02-08 05:37:30,560 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-02-08 05:37:30,560 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-02-08 05:37:30,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1527] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][494], [Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 632#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 694#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 645#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 804#(= |#race~a3~0| 0), Black: 766#(<= ~n3~0 0), Black: 780#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 653#(not |thread2Thread1of1ForFork0_#t~short11#1|), Black: 767#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 658#(not |thread3Thread1of1ForFork2_#t~short20#1|), 604#(= |#race~n3~0| 0), Black: 719#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 732#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 718#(<= ~n2~0 0), 442#L105true, Black: 802#true, 686#(= |#race~a2~0| 0), Black: 666#(<= ~n1~0 0), Black: 616#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 667#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 680#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 619#true, Black: 684#true, 586#(= |#race~n1~0| 0), 811#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), 347#L79-12true, Black: 749#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 741#(<= ~n3~0 0), Black: 747#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 598#(= |#race~n2~0| 0), Black: 742#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 755#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), 621#(= |#race~a1~0| 0)]) [2025-02-08 05:37:30,563 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2025-02-08 05:37:30,563 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-02-08 05:37:30,563 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-02-08 05:37:30,563 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-02-08 05:37:30,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1527] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][494], [Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 632#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 694#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 645#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 804#(= |#race~a3~0| 0), Black: 766#(<= ~n3~0 0), Black: 780#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 653#(not |thread2Thread1of1ForFork0_#t~short11#1|), Black: 767#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 658#(not |thread3Thread1of1ForFork2_#t~short20#1|), 604#(= |#race~n3~0| 0), Black: 719#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 732#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 718#(<= ~n2~0 0), 442#L105true, Black: 802#true, 686#(= |#race~a2~0| 0), Black: 666#(<= ~n1~0 0), Black: 616#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 667#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 680#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 619#true, Black: 684#true, 586#(= |#race~n1~0| 0), 811#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), Black: 749#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 741#(<= ~n3~0 0), Black: 747#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 598#(= |#race~n2~0| 0), Black: 742#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 755#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), 294#L79-13true, 621#(= |#race~a1~0| 0)]) [2025-02-08 05:37:30,566 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-02-08 05:37:30,566 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-02-08 05:37:30,566 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-02-08 05:37:30,566 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-02-08 05:37:30,592 INFO L124 PetriNetUnfolderBase]: 254/3873 cut-off events. [2025-02-08 05:37:30,592 INFO L125 PetriNetUnfolderBase]: For 769/813 co-relation queries the response was YES. [2025-02-08 05:37:30,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5557 conditions, 3873 events. 254/3873 cut-off events. For 769/813 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 31397 event pairs, 32 based on Foata normal form. 8/3706 useless extension candidates. Maximal degree in co-relation 5466. Up to 200 conditions per place. [2025-02-08 05:37:30,623 INFO L140 encePairwiseOnDemand]: 582/589 looper letters, 38 selfloop transitions, 5 changer transitions 0/555 dead transitions. [2025-02-08 05:37:30,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 555 transitions, 1627 flow [2025-02-08 05:37:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3264 transitions. [2025-02-08 05:37:30,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235993208828522 [2025-02-08 05:37:30,625 INFO L175 Difference]: Start difference. First operand has 571 places, 549 transitions, 1521 flow. Second operand 6 states and 3264 transitions. [2025-02-08 05:37:30,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 555 transitions, 1627 flow [2025-02-08 05:37:30,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 555 transitions, 1627 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:30,633 INFO L231 Difference]: Finished difference. Result has 574 places, 547 transitions, 1527 flow [2025-02-08 05:37:30,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1527, PETRI_PLACES=574, PETRI_TRANSITIONS=547} [2025-02-08 05:37:30,634 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 23 predicate places. [2025-02-08 05:37:30,634 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 547 transitions, 1527 flow [2025-02-08 05:37:30,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.1666666666666) internal successors, (3241), 6 states have internal predecessors, (3241), 0 states have call successors, (0), 0 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,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:30,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:37:30,635 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:30,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1586673306, now seen corresponding path program 1 times [2025-02-08 05:37:30,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026309802] [2025-02-08 05:37:30,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-08 05:37:30,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-08 05:37:30,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:31,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026309802] [2025-02-08 05:37:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026309802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:31,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:31,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:31,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530041689] [2025-02-08 05:37:31,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:31,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:31,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:31,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:31,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:31,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2025-02-08 05:37:31,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 547 transitions, 1527 flow. Second operand has 6 states, 6 states have (on average 540.0) internal successors, (3240), 6 states have internal predecessors, (3240), 0 states have call successors, (0), 0 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,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:31,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2025-02-08 05:37:31,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:32,110 INFO L124 PetriNetUnfolderBase]: 191/3797 cut-off events. [2025-02-08 05:37:32,110 INFO L125 PetriNetUnfolderBase]: For 621/675 co-relation queries the response was YES. [2025-02-08 05:37:32,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5422 conditions, 3797 events. 191/3797 cut-off events. For 621/675 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 29463 event pairs, 29 based on Foata normal form. 4/3644 useless extension candidates. Maximal degree in co-relation 5330. Up to 192 conditions per place. [2025-02-08 05:37:32,150 INFO L140 encePairwiseOnDemand]: 582/589 looper letters, 38 selfloop transitions, 5 changer transitions 0/553 dead transitions. [2025-02-08 05:37:32,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 553 transitions, 1633 flow [2025-02-08 05:37:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3264 transitions. [2025-02-08 05:37:32,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235993208828522 [2025-02-08 05:37:32,152 INFO L175 Difference]: Start difference. First operand has 574 places, 547 transitions, 1527 flow. Second operand 6 states and 3264 transitions. [2025-02-08 05:37:32,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 553 transitions, 1633 flow [2025-02-08 05:37:32,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 553 transitions, 1623 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:32,160 INFO L231 Difference]: Finished difference. Result has 572 places, 545 transitions, 1523 flow [2025-02-08 05:37:32,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1523, PETRI_PLACES=572, PETRI_TRANSITIONS=545} [2025-02-08 05:37:32,161 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 21 predicate places. [2025-02-08 05:37:32,161 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 545 transitions, 1523 flow [2025-02-08 05:37:32,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.0) internal successors, (3240), 6 states have internal predecessors, (3240), 0 states have call successors, (0), 0 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,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:32,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:32,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:37:32,162 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:32,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1945546995, now seen corresponding path program 1 times [2025-02-08 05:37:32,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:32,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953589480] [2025-02-08 05:37:32,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:32,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-08 05:37:32,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-08 05:37:32,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:32,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:32,193 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:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953589480] [2025-02-08 05:37:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953589480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661217334] [2025-02-08 05:37:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:32,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:32,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:32,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:32,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:32,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 561 out of 589 [2025-02-08 05:37:32,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 545 transitions, 1523 flow. Second operand has 3 states, 3 states have (on average 564.0) internal successors, (1692), 3 states have internal predecessors, (1692), 0 states have call successors, (0), 0 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,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:32,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 561 of 589 [2025-02-08 05:37:32,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:32,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1526] thread3EXIT-->L107-6: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][331], [Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 632#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 694#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 645#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 693#(<= ~n2~0 0), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 707#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 818#true, Black: 631#(<= ~n1~0 0), 804#(= |#race~a3~0| 0), Black: 766#(<= ~n3~0 0), Black: 780#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 767#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 653#(not |thread2Thread1of1ForFork0_#t~short11#1|), Black: 658#(not |thread3Thread1of1ForFork2_#t~short20#1|), 604#(= |#race~n3~0| 0), Black: 719#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 732#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 718#(<= ~n2~0 0), 686#(= |#race~a2~0| 0), Black: 802#true, Black: 666#(<= ~n1~0 0), Black: 616#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 667#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 386#L107-6true, Black: 680#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 619#true, Black: 684#true, 586#(= |#race~n1~0| 0), Black: 749#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 741#(<= ~n3~0 0), Black: 747#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 598#(= |#race~n2~0| 0), Black: 742#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), 812#true, Black: 755#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), 621#(= |#race~a1~0| 0)]) [2025-02-08 05:37:32,639 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-02-08 05:37:32,639 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-02-08 05:37:32,639 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-02-08 05:37:32,639 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-02-08 05:37:32,643 INFO L124 PetriNetUnfolderBase]: 99/3487 cut-off events. [2025-02-08 05:37:32,643 INFO L125 PetriNetUnfolderBase]: For 469/489 co-relation queries the response was YES. [2025-02-08 05:37:32,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4736 conditions, 3487 events. 99/3487 cut-off events. For 469/489 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 25753 event pairs, 18 based on Foata normal form. 0/3364 useless extension candidates. Maximal degree in co-relation 4645. Up to 106 conditions per place. [2025-02-08 05:37:32,671 INFO L140 encePairwiseOnDemand]: 587/589 looper letters, 8 selfloop transitions, 1 changer transitions 0/544 dead transitions. [2025-02-08 05:37:32,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 544 transitions, 1539 flow [2025-02-08 05:37:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1693 transitions. [2025-02-08 05:37:32,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581211092246746 [2025-02-08 05:37:32,673 INFO L175 Difference]: Start difference. First operand has 572 places, 545 transitions, 1523 flow. Second operand 3 states and 1693 transitions. [2025-02-08 05:37:32,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 544 transitions, 1539 flow [2025-02-08 05:37:32,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 544 transitions, 1529 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:32,681 INFO L231 Difference]: Finished difference. Result has 568 places, 544 transitions, 1513 flow [2025-02-08 05:37:32,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=568, PETRI_TRANSITIONS=544} [2025-02-08 05:37:32,682 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 17 predicate places. [2025-02-08 05:37:32,682 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 544 transitions, 1513 flow [2025-02-08 05:37:32,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.0) internal successors, (1692), 3 states have internal predecessors, (1692), 0 states have call successors, (0), 0 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,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:32,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:32,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:37:32,683 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:32,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1354332576, now seen corresponding path program 1 times [2025-02-08 05:37:32,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:32,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876858436] [2025-02-08 05:37:32,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:32,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-08 05:37:32,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-08 05:37:32,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:32,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:32,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:32,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876858436] [2025-02-08 05:37:32,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876858436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:32,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:32,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:32,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095981567] [2025-02-08 05:37:32,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:32,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:32,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:32,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:32,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:33,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 589 [2025-02-08 05:37:33,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 544 transitions, 1513 flow. Second operand has 6 states, 6 states have (on average 540.1666666666666) internal successors, (3241), 6 states have internal predecessors, (3241), 0 states have call successors, (0), 0 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,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:33,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 589 [2025-02-08 05:37:33,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:33,921 INFO L124 PetriNetUnfolderBase]: 214/3784 cut-off events. [2025-02-08 05:37:33,922 INFO L125 PetriNetUnfolderBase]: For 729/758 co-relation queries the response was YES. [2025-02-08 05:37:33,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5403 conditions, 3784 events. 214/3784 cut-off events. For 729/758 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 29864 event pairs, 32 based on Foata normal form. 0/3668 useless extension candidates. Maximal degree in co-relation 5311. Up to 204 conditions per place. [2025-02-08 05:37:33,947 INFO L140 encePairwiseOnDemand]: 582/589 looper letters, 38 selfloop transitions, 5 changer transitions 0/550 dead transitions. [2025-02-08 05:37:33,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 550 transitions, 1619 flow [2025-02-08 05:37:33,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3264 transitions. [2025-02-08 05:37:33,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235993208828522 [2025-02-08 05:37:33,952 INFO L175 Difference]: Start difference. First operand has 568 places, 544 transitions, 1513 flow. Second operand 6 states and 3264 transitions. [2025-02-08 05:37:33,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 550 transitions, 1619 flow [2025-02-08 05:37:33,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 550 transitions, 1618 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:33,960 INFO L231 Difference]: Finished difference. Result has 570 places, 542 transitions, 1518 flow [2025-02-08 05:37:33,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1518, PETRI_PLACES=570, PETRI_TRANSITIONS=542} [2025-02-08 05:37:33,961 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 19 predicate places. [2025-02-08 05:37:33,962 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 542 transitions, 1518 flow [2025-02-08 05:37:33,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.1666666666666) internal successors, (3241), 6 states have internal predecessors, (3241), 0 states have call successors, (0), 0 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,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:33,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:33,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:37:33,962 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:33,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:33,963 INFO L85 PathProgramCache]: Analyzing trace with hash 324766155, now seen corresponding path program 1 times [2025-02-08 05:37:33,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:33,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630814204] [2025-02-08 05:37:33,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:33,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:33,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-08 05:37:33,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-08 05:37:33,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:33,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:33,994 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:33,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:33,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630814204] [2025-02-08 05:37:33,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630814204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:33,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:33,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:33,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371803420] [2025-02-08 05:37:33,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:33,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:33,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:33,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:33,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:34,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 589 [2025-02-08 05:37:34,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 542 transitions, 1518 flow. Second operand has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 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,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:34,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 589 [2025-02-08 05:37:34,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:34,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1526] thread3EXIT-->L107-6: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][331], [Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 632#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 694#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 645#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 707#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 804#(= |#race~a3~0| 0), Black: 631#(<= ~n1~0 0), Black: 766#(<= ~n3~0 0), Black: 780#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 767#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 653#(not |thread2Thread1of1ForFork0_#t~short11#1|), Black: 658#(not |thread3Thread1of1ForFork2_#t~short20#1|), 604#(= |#race~n3~0| 0), Black: 719#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 732#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 718#(<= ~n2~0 0), Black: 802#true, 686#(= |#race~a2~0| 0), Black: 666#(<= ~n1~0 0), Black: 667#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 616#(not |thread1Thread1of1ForFork1_#t~short2#1|), 386#L107-6true, Black: 680#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 619#true, Black: 684#true, 586#(= |#race~n1~0| 0), 827#true, Black: 749#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 741#(<= ~n3~0 0), Black: 747#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 742#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), 598#(= |#race~n2~0| 0), Black: 755#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), 621#(= |#race~a1~0| 0), 821#true]) [2025-02-08 05:37:34,365 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-02-08 05:37:34,365 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-02-08 05:37:34,365 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-02-08 05:37:34,365 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-02-08 05:37:34,368 INFO L124 PetriNetUnfolderBase]: 95/3067 cut-off events. [2025-02-08 05:37:34,368 INFO L125 PetriNetUnfolderBase]: For 397/453 co-relation queries the response was YES. [2025-02-08 05:37:34,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4226 conditions, 3067 events. 95/3067 cut-off events. For 397/453 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 21536 event pairs, 20 based on Foata normal form. 0/2996 useless extension candidates. Maximal degree in co-relation 4135. Up to 110 conditions per place. [2025-02-08 05:37:34,398 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 10 selfloop transitions, 1 changer transitions 0/540 dead transitions. [2025-02-08 05:37:34,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 540 transitions, 1536 flow [2025-02-08 05:37:34,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1687 transitions. [2025-02-08 05:37:34,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547255234861347 [2025-02-08 05:37:34,399 INFO L175 Difference]: Start difference. First operand has 570 places, 542 transitions, 1518 flow. Second operand 3 states and 1687 transitions. [2025-02-08 05:37:34,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 540 transitions, 1536 flow [2025-02-08 05:37:34,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 540 transitions, 1526 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:34,409 INFO L231 Difference]: Finished difference. Result has 565 places, 540 transitions, 1506 flow [2025-02-08 05:37:34,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1506, PETRI_PLACES=565, PETRI_TRANSITIONS=540} [2025-02-08 05:37:34,410 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 14 predicate places. [2025-02-08 05:37:34,410 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 540 transitions, 1506 flow [2025-02-08 05:37:34,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 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,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:34,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:34,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:37:34,410 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2025-02-08 05:37:34,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:34,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1353986035, now seen corresponding path program 1 times [2025-02-08 05:37:34,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:34,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51369293] [2025-02-08 05:37:34,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:34,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:34,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-08 05:37:34,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-08 05:37:34,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:34,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:34,451 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:34,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:34,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51369293] [2025-02-08 05:37:34,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51369293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:34,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:34,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149592173] [2025-02-08 05:37:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:34,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:34,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:34,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:34,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 589 [2025-02-08 05:37:34,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 540 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 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,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:34,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 589 [2025-02-08 05:37:34,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:34,820 INFO L124 PetriNetUnfolderBase]: 95/2869 cut-off events. [2025-02-08 05:37:34,820 INFO L125 PetriNetUnfolderBase]: For 333/373 co-relation queries the response was YES. [2025-02-08 05:37:34,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3886 conditions, 2869 events. 95/2869 cut-off events. For 333/373 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 18751 event pairs, 25 based on Foata normal form. 15/2830 useless extension candidates. Maximal degree in co-relation 3795. Up to 119 conditions per place. [2025-02-08 05:37:34,845 INFO L140 encePairwiseOnDemand]: 586/589 looper letters, 0 selfloop transitions, 0 changer transitions 538/538 dead transitions. [2025-02-08 05:37:34,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 538 transitions, 1522 flow [2025-02-08 05:37:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1686 transitions. [2025-02-08 05:37:34,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9541595925297114 [2025-02-08 05:37:34,846 INFO L175 Difference]: Start difference. First operand has 565 places, 540 transitions, 1506 flow. Second operand 3 states and 1686 transitions. [2025-02-08 05:37:34,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 538 transitions, 1522 flow [2025-02-08 05:37:34,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 538 transitions, 1521 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:34,852 INFO L231 Difference]: Finished difference. Result has 564 places, 0 transitions, 0 flow [2025-02-08 05:37:34,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=589, PETRI_DIFFERENCE_MINUEND_FLOW=1501, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=564, PETRI_TRANSITIONS=0} [2025-02-08 05:37:34,853 INFO L279 CegarLoopForPetriNet]: 551 programPoint places, 13 predicate places. [2025-02-08 05:37:34,853 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 0 transitions, 0 flow [2025-02-08 05:37:34,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 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,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (97 of 98 remaining) [2025-02-08 05:37:34,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (96 of 98 remaining) [2025-02-08 05:37:34,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (95 of 98 remaining) [2025-02-08 05:37:34,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (94 of 98 remaining) [2025-02-08 05:37:34,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (93 of 98 remaining) [2025-02-08 05:37:34,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (92 of 98 remaining) [2025-02-08 05:37:34,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (91 of 98 remaining) [2025-02-08 05:37:34,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (90 of 98 remaining) [2025-02-08 05:37:34,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (89 of 98 remaining) [2025-02-08 05:37:34,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (88 of 98 remaining) [2025-02-08 05:37:34,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (87 of 98 remaining) [2025-02-08 05:37:34,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (86 of 98 remaining) [2025-02-08 05:37:34,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (85 of 98 remaining) [2025-02-08 05:37:34,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (84 of 98 remaining) [2025-02-08 05:37:34,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (83 of 98 remaining) [2025-02-08 05:37:34,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (82 of 98 remaining) [2025-02-08 05:37:34,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (81 of 98 remaining) [2025-02-08 05:37:34,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (80 of 98 remaining) [2025-02-08 05:37:34,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (79 of 98 remaining) [2025-02-08 05:37:34,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (78 of 98 remaining) [2025-02-08 05:37:34,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (77 of 98 remaining) [2025-02-08 05:37:34,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (76 of 98 remaining) [2025-02-08 05:37:34,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (75 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (74 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (73 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (72 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (71 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (70 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (69 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (68 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (67 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (66 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (65 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (64 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (63 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (62 of 98 remaining) [2025-02-08 05:37:34,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (61 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (60 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (59 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (58 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (57 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (56 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (55 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (54 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (53 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (52 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (51 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (50 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (49 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (47 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (46 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (45 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 98 remaining) [2025-02-08 05:37:34,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (38 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (37 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (35 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (34 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (32 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (31 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (30 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (25 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (24 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (23 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 98 remaining) [2025-02-08 05:37:34,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (21 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (20 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (19 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (15 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (14 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (12 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (11 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (10 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (9 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (8 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (7 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (4 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 98 remaining) [2025-02-08 05:37:34,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 98 remaining) [2025-02-08 05:37:34,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:37:34,864 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:34,869 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:34,869 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:34,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:34 BasicIcfg [2025-02-08 05:37:34,873 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:34,873 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:34,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:34,874 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:34,874 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:05" (3/4) ... [2025-02-08 05:37:34,875 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:34,878 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:34,878 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:34,878 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:34,883 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-02-08 05:37:34,883 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:34,883 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:34,884 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:34,955 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:34,955 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:34,955 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:34,957 INFO L158 Benchmark]: Toolchain (without parser) took 30762.64ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 106.7MB in the beginning and 176.7MB in the end (delta: -70.0MB). Peak memory consumption was 240.1MB. Max. memory is 16.1GB. [2025-02-08 05:37:34,957 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:34,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.31ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 92.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:37:34,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.82ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 89.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:34,959 INFO L158 Benchmark]: Boogie Preprocessor took 37.96ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:34,959 INFO L158 Benchmark]: IcfgBuilder took 823.72ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 41.4MB in the end (delta: 45.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 05:37:34,959 INFO L158 Benchmark]: TraceAbstraction took 29543.73ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 40.4MB in the beginning and 185.1MB in the end (delta: -144.7MB). Peak memory consumption was 249.3MB. Max. memory is 16.1GB. [2025-02-08 05:37:34,959 INFO L158 Benchmark]: Witness Printer took 81.61ms. Allocated memory is still 453.0MB. Free memory was 185.1MB in the beginning and 176.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:34,960 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.31ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 92.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.82ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 89.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.96ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 823.72ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 41.4MB in the end (delta: 45.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 29543.73ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 40.4MB in the beginning and 185.1MB in the end (delta: -144.7MB). Peak memory consumption was 249.3MB. Max. memory is 16.1GB. * Witness Printer took 81.61ms. Allocated memory is still 453.0MB. Free memory was 185.1MB in the beginning and 176.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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 51]: 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: 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: 63]: 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: 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: 65]: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 77]: 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: 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: 79]: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: 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: 120]: 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: 120]: 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: 107]: 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 - 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, 860 locations, 98 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: 29.3s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6651 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4310 mSDsluCounter, 6200 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5967 mSDsCounter, 1317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10452 IncrementalHoareTripleChecker+Invalid, 11769 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1317 mSolverCounterUnsat, 233 mSDtfsCounter, 10452 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1548occurred in iteration=24, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 5502 NumberOfCodeBlocks, 5502 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5468 ConstructedInterpolants, 0 QuantifiedInterpolants, 7794 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 17/17 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 59 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:34,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE