./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-misc-1.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/parallel-misc-1.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 faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:08,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:08,737 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:39:08,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:08,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:08,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:08,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:08,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:08,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:08,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:08,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:08,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:08,768 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:08,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:08,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:08,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:08,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:08,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:08,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:08,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:08,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:08,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:08,770 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:08,770 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:08,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:08,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:08,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:08,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:08,771 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:08,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:08,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:08,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:08,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:08,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:08,772 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:08,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:08,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:08,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:08,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:08,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:08,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:08,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:08,773 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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2025-02-08 05:39:09,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:09,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:09,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:09,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:09,085 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:09,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-02-08 05:39:10,331 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56544f8a9/d9194cc6a6c245b8849b3233856d6383/FLAGe556400c4 [2025-02-08 05:39:10,624 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:10,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-02-08 05:39:10,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56544f8a9/d9194cc6a6c245b8849b3233856d6383/FLAGe556400c4 [2025-02-08 05:39:10,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56544f8a9/d9194cc6a6c245b8849b3233856d6383 [2025-02-08 05:39:10,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:10,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:10,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:10,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:10,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:10,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:10" (1/1) ... [2025-02-08 05:39:10,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf92f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10, skipping insertion in model container [2025-02-08 05:39:10,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:10" (1/1) ... [2025-02-08 05:39:10,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:10,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:10,927 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:10,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:10,995 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:10,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10 WrapperNode [2025-02-08 05:39:10,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:10,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:10,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:10,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:11,003 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:39:10" (1/1) ... [2025-02-08 05:39:11,018 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:39:10" (1/1) ... [2025-02-08 05:39:11,065 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 503 [2025-02-08 05:39:11,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:11,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:11,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:11,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:11,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10" (1/1) ... [2025-02-08 05:39:11,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10" (1/1) ... [2025-02-08 05:39:11,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10" (1/1) ... [2025-02-08 05:39:11,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10" (1/1) ... [2025-02-08 05:39:11,094 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10" (1/1) ... [2025-02-08 05:39:11,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10" (1/1) ... [2025-02-08 05:39:11,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10" (1/1) ... [2025-02-08 05:39:11,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10" (1/1) ... [2025-02-08 05:39:11,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:11,118 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:11,118 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:11,118 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:11,119 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10" (1/1) ... [2025-02-08 05:39:11,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:11,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:11,150 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:39:11,153 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:39:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:11,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:11,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:39:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:39:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:11,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:39:11,175 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:39:11,279 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:11,281 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:11,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-4: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-5: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: havoc #t~nondet7#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-1: assume #race~sum1~0 == #t~nondet7#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-1: assume !(#race~sum1~0 == #t~nondet7#1); [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-2: havoc #t~ret6#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: #race~sum1~0 := #t~nondet7#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-4: havoc #t~nondet7#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-5: ~sum1~0 := #t~ret6#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-9: #t~ret6#1 := plus_#res#1; [2025-02-08 05:39:11,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-10: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-11: havoc plus_#res#1; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-12: assume 0 == #race~bag1~0; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-12: assume !(0 == #race~bag1~0); [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-13: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~sum1~0, ~bag1~0; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-14: assume 0 == #race~sum1~0; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-14: assume !(0 == #race~sum1~0); [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-15: #race~bag1~0 := 0; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-16: #race~sum1~0 := 0; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-5: assume false; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-7: assume false; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-9: assume false; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-11: assume false; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-2: plus_~b#1 := plus_#in~b#1; [2025-02-08 05:39:11,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc #t~nondet9#1; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-3: plus_~a#1 := plus_#in~a#1; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-1: assume #race~bag1~0 == #t~nondet9#1; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-1: assume !(#race~bag1~0 == #t~nondet9#1); [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-2: havoc #t~mem8#1; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-4: plus_~b#1 := plus_#in~b#1; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-3: #race~bag1~0 := #t~nondet9#1; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-5: plus_~a#1 := plus_#in~a#1; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-4: havoc #t~nondet9#1; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-5: assume ((0 == #race[~A~0.base,~A~0.offset + 4 * ~i~0] && 0 == #race[~A~0.base,1 + (~A~0.offset + 4 * ~i~0)]) && 0 == #race[~A~0.base,2 + (~A~0.offset + 4 * ~i~0)]) && 0 == #race[~A~0.base,3 + (~A~0.offset + 4 * ~i~0)]; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-5: assume !(((0 == #race[~A~0.base,~A~0.offset + 4 * ~i~0] && 0 == #race[~A~0.base,1 + (~A~0.offset + 4 * ~i~0)]) && 0 == #race[~A~0.base,2 + (~A~0.offset + 4 * ~i~0)]) && 0 == #race[~A~0.base,3 + (~A~0.offset + 4 * ~i~0)]); [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-6: ~bag1~0 := #t~mem8#1; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-7: #race := #race[~A~0.base,3 + (~A~0.offset + 4 * ~i~0) := 0]; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-8: #race := #race[~A~0.base,2 + (~A~0.offset + 4 * ~i~0) := 0]; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-9: #race := #race[~A~0.base,1 + (~A~0.offset + 4 * ~i~0) := 0]; [2025-02-08 05:39:11,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-10: #race := #race[~A~0.base,~A~0.offset + 4 * ~i~0 := 0]; [2025-02-08 05:39:11,687 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-11: SUMMARY for call #t~mem8#1 := read~int(~A~0.base, ~A~0.offset + 4 * ~i~0, 4); srcloc: null [2025-02-08 05:39:11,687 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-12: assume 0 == #race~i~0; [2025-02-08 05:39:11,687 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-12: assume !(0 == #race~i~0); [2025-02-08 05:39:11,687 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-13: assume 0 == #race~A~0; [2025-02-08 05:39:11,687 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-13: assume !(0 == #race~A~0); [2025-02-08 05:39:11,687 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-14: #race~i~0 := 0; [2025-02-08 05:39:11,687 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-15: #race~A~0 := 0; [2025-02-08 05:39:11,687 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-5: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 05:39:11,688 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-6: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,688 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-7: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,688 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-8: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,688 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-9: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 05:39:11,689 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-10: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 05:39:11,689 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-11: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,689 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-12: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,689 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-13: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,689 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-14: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 05:39:11,689 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-4: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 05:39:11,689 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-5: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,689 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-6: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,689 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-7: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,689 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-8: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 05:39:11,690 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-9: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,690 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-10: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,690 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-11: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,690 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~nondet11#1; [2025-02-08 05:39:11,690 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: assume #race~i~0 == #t~nondet11#1; [2025-02-08 05:39:11,690 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: assume !(#race~i~0 == #t~nondet11#1); [2025-02-08 05:39:11,690 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: havoc #t~post10#1; [2025-02-08 05:39:11,690 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: #race~i~0 := #t~nondet11#1; [2025-02-08 05:39:11,690 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-4: havoc #t~nondet11#1; [2025-02-08 05:39:11,691 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-5: ~i~0 := 1 + #t~post10#1; [2025-02-08 05:39:11,691 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-6: assume 0 == #race~i~0; [2025-02-08 05:39:11,691 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-6: assume !(0 == #race~i~0); [2025-02-08 05:39:11,691 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-7: #t~post10#1 := ~i~0; [2025-02-08 05:39:11,691 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-8: #race~i~0 := 0; [2025-02-08 05:39:11,691 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47: havoc #t~ret2#1; [2025-02-08 05:39:11,691 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-1: havoc #t~ret2#1; [2025-02-08 05:39:11,691 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: assume #t~ret2#1 < ~cap1~0; [2025-02-08 05:39:11,691 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: assume !(#t~ret2#1 < ~cap1~0); [2025-02-08 05:39:11,691 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: havoc #t~mem1#1; [2025-02-08 05:39:11,691 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: havoc #t~mem1#1; [2025-02-08 05:39:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-5: assume 0 == #race~cap1~0; [2025-02-08 05:39:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-5: assume !(0 == #race~cap1~0); [2025-02-08 05:39:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-6: #race~cap1~0 := 0; [2025-02-08 05:39:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 05:39:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-10: #t~ret2#1 := plus_#res#1; [2025-02-08 05:39:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48: havoc #t~nondet5#1; [2025-02-08 05:39:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: havoc #t~ret4#1; [2025-02-08 05:39:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: assume #race~bag1~0 == #t~nondet5#1; [2025-02-08 05:39:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: assume !(#race~bag1~0 == #t~nondet5#1); [2025-02-08 05:39:11,693 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: havoc #t~mem3#1; [2025-02-08 05:39:11,693 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: #race~bag1~0 := #t~nondet5#1; [2025-02-08 05:39:11,693 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-5: havoc #t~nondet5#1; [2025-02-08 05:39:11,693 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-6: ~bag1~0 := #t~ret4#1; [2025-02-08 05:39:11,693 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 05:39:11,693 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:11,693 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:11,693 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-10: #t~ret4#1 := plus_#res#1; [2025-02-08 05:39:11,693 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-11: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:11,693 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-12: havoc plus_#res#1; [2025-02-08 05:39:11,693 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-13: assume ((0 == #race[~A~0.base,~A~0.offset + 4 * ~i~0] && 0 == #race[~A~0.base,1 + (~A~0.offset + 4 * ~i~0)]) && 0 == #race[~A~0.base,2 + (~A~0.offset + 4 * ~i~0)]) && 0 == #race[~A~0.base,3 + (~A~0.offset + 4 * ~i~0)]; [2025-02-08 05:39:11,694 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-13: assume !(((0 == #race[~A~0.base,~A~0.offset + 4 * ~i~0] && 0 == #race[~A~0.base,1 + (~A~0.offset + 4 * ~i~0)]) && 0 == #race[~A~0.base,2 + (~A~0.offset + 4 * ~i~0)]) && 0 == #race[~A~0.base,3 + (~A~0.offset + 4 * ~i~0)]); [2025-02-08 05:39:11,694 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-14: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~bag1~0, #t~mem3#1; [2025-02-08 05:39:11,694 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-15: #race := #race[~A~0.base,3 + (~A~0.offset + 4 * ~i~0) := 0]; [2025-02-08 05:39:11,694 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-16: #race := #race[~A~0.base,2 + (~A~0.offset + 4 * ~i~0) := 0]; [2025-02-08 05:39:11,694 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-17: #race := #race[~A~0.base,1 + (~A~0.offset + 4 * ~i~0) := 0]; [2025-02-08 05:39:11,694 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-18: #race := #race[~A~0.base,~A~0.offset + 4 * ~i~0 := 0]; [2025-02-08 05:39:11,694 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-19: SUMMARY for call #t~mem3#1 := read~int(~A~0.base, ~A~0.offset + 4 * ~i~0, 4); srcloc: null [2025-02-08 05:39:11,694 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-20: assume 0 == #race~i~0; [2025-02-08 05:39:11,694 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-20: assume !(0 == #race~i~0); [2025-02-08 05:39:11,695 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-21: assume 0 == #race~A~0; [2025-02-08 05:39:11,695 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-21: assume !(0 == #race~A~0); [2025-02-08 05:39:11,695 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-22: #race~i~0 := 0; [2025-02-08 05:39:11,695 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-23: assume 0 == #race~bag1~0; [2025-02-08 05:39:11,695 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-23: assume !(0 == #race~bag1~0); [2025-02-08 05:39:11,695 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-24: #race~A~0 := 0; [2025-02-08 05:39:11,695 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-25: #race~bag1~0 := 0; [2025-02-08 05:39:11,943 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-4: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-5: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: havoc #t~nondet20#1; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-1: assume #race~sum2~0 == #t~nondet20#1; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-1: assume !(#race~sum2~0 == #t~nondet20#1); [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-2: havoc #t~ret19#1; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-3: #race~sum2~0 := #t~nondet20#1; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-4: havoc #t~nondet20#1; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-5: ~sum2~0 := #t~ret19#1; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-5: assume false; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret19#1 && #t~ret19#1 <= 2147483647; [2025-02-08 05:39:11,944 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-7: assume false; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-9: #t~ret19#1 := plus_#res#1; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-9: assume false; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-10: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-11: havoc plus_#res#1; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-11: assume false; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-12: assume 0 == #race~bag2~0; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-12: assume !(0 == #race~bag2~0); [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-13: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~sum2~0, ~bag2~0; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-14: assume 0 == #race~sum2~0; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-14: assume !(0 == #race~sum2~0); [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-15: #race~bag2~0 := 0; [2025-02-08 05:39:11,945 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-2: plus_~b#1 := plus_#in~b#1; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-16: #race~sum2~0 := 0; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-3: plus_~a#1 := plus_#in~a#1; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-4: plus_~b#1 := plus_#in~b#1; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-5: plus_~a#1 := plus_#in~a#1; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~nondet22#1; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: assume #race~bag2~0 == #t~nondet22#1; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: assume !(#race~bag2~0 == #t~nondet22#1); [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: havoc #t~mem21#1; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-3: #race~bag2~0 := #t~nondet22#1; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-4: havoc #t~nondet22#1; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-5: assume ((0 == #race[~A~0.base,~A~0.offset + 4 * ~j~0] && 0 == #race[~A~0.base,1 + (~A~0.offset + 4 * ~j~0)]) && 0 == #race[~A~0.base,2 + (~A~0.offset + 4 * ~j~0)]) && 0 == #race[~A~0.base,3 + (~A~0.offset + 4 * ~j~0)]; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-5: assume !(((0 == #race[~A~0.base,~A~0.offset + 4 * ~j~0] && 0 == #race[~A~0.base,1 + (~A~0.offset + 4 * ~j~0)]) && 0 == #race[~A~0.base,2 + (~A~0.offset + 4 * ~j~0)]) && 0 == #race[~A~0.base,3 + (~A~0.offset + 4 * ~j~0)]); [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-6: ~bag2~0 := #t~mem21#1; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-7: #race := #race[~A~0.base,3 + (~A~0.offset + 4 * ~j~0) := 0]; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-8: #race := #race[~A~0.base,2 + (~A~0.offset + 4 * ~j~0) := 0]; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-9: #race := #race[~A~0.base,1 + (~A~0.offset + 4 * ~j~0) := 0]; [2025-02-08 05:39:11,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-10: #race := #race[~A~0.base,~A~0.offset + 4 * ~j~0 := 0]; [2025-02-08 05:39:11,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-11: SUMMARY for call #t~mem21#1 := read~int(~A~0.base, ~A~0.offset + 4 * ~j~0, 4); srcloc: null [2025-02-08 05:39:11,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-12: assume 0 == #race~j~0; [2025-02-08 05:39:11,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-12: assume !(0 == #race~j~0); [2025-02-08 05:39:11,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-13: assume 0 == #race~A~0; [2025-02-08 05:39:11,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-13: assume !(0 == #race~A~0); [2025-02-08 05:39:11,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-14: #race~j~0 := 0; [2025-02-08 05:39:11,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-15: #race~A~0 := 0; [2025-02-08 05:39:11,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-5: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 05:39:11,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-6: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-7: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-8: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-9: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-10: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-11: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-12: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-13: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-14: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-4: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-5: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-6: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-7: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-8: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-9: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-10: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-11: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: havoc #t~nondet24#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-1: assume #race~j~0 == #t~nondet24#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-1: assume !(#race~j~0 == #t~nondet24#1); [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-2: havoc #t~post23#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-3: #race~j~0 := #t~nondet24#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-4: havoc #t~nondet24#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-5: ~j~0 := 1 + #t~post23#1; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-6: assume 0 == #race~j~0; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-6: assume !(0 == #race~j~0); [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-7: #t~post23#1 := ~j~0; [2025-02-08 05:39:11,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-8: #race~j~0 := 0; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64: havoc #t~ret15#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-1: havoc #t~ret15#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume #t~ret15#1 < ~cap2~0; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume !(#t~ret15#1 < ~cap2~0); [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-3: havoc #t~mem14#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: havoc #t~mem14#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-5: assume 0 == #race~cap2~0; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-5: assume !(0 == #race~cap2~0); [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-6: #race~cap2~0 := 0; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret15#1 && #t~ret15#1 <= 2147483647; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-10: #t~ret15#1 := plus_#res#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc #t~nondet18#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-1: havoc #t~ret17#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-2: assume #race~bag2~0 == #t~nondet18#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-2: assume !(#race~bag2~0 == #t~nondet18#1); [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-3: havoc #t~mem16#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-4: #race~bag2~0 := #t~nondet18#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: havoc #t~nondet18#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: ~bag2~0 := #t~ret17#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:11,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-10: #t~ret17#1 := plus_#res#1; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-11: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-12: havoc plus_#res#1; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-13: assume ((0 == #race[~A~0.base,~A~0.offset + 4 * ~j~0] && 0 == #race[~A~0.base,1 + (~A~0.offset + 4 * ~j~0)]) && 0 == #race[~A~0.base,2 + (~A~0.offset + 4 * ~j~0)]) && 0 == #race[~A~0.base,3 + (~A~0.offset + 4 * ~j~0)]; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-13: assume !(((0 == #race[~A~0.base,~A~0.offset + 4 * ~j~0] && 0 == #race[~A~0.base,1 + (~A~0.offset + 4 * ~j~0)]) && 0 == #race[~A~0.base,2 + (~A~0.offset + 4 * ~j~0)]) && 0 == #race[~A~0.base,3 + (~A~0.offset + 4 * ~j~0)]); [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-14: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~bag2~0, #t~mem16#1; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-15: #race := #race[~A~0.base,3 + (~A~0.offset + 4 * ~j~0) := 0]; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-16: #race := #race[~A~0.base,2 + (~A~0.offset + 4 * ~j~0) := 0]; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-17: #race := #race[~A~0.base,1 + (~A~0.offset + 4 * ~j~0) := 0]; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-18: #race := #race[~A~0.base,~A~0.offset + 4 * ~j~0 := 0]; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-19: SUMMARY for call #t~mem16#1 := read~int(~A~0.base, ~A~0.offset + 4 * ~j~0, 4); srcloc: null [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-20: assume 0 == #race~j~0; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-20: assume !(0 == #race~j~0); [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-21: assume 0 == #race~A~0; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-21: assume !(0 == #race~A~0); [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-22: #race~j~0 := 0; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-23: assume 0 == #race~bag2~0; [2025-02-08 05:39:11,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-23: assume !(0 == #race~bag2~0); [2025-02-08 05:39:11,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-24: #race~A~0 := 0; [2025-02-08 05:39:11,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-25: #race~bag2~0 := 0; [2025-02-08 05:39:12,170 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:12,170 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:12,205 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:12,205 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:12,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:12 BoogieIcfgContainer [2025-02-08 05:39:12,205 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:12,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:12,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:12,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:12,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:10" (1/3) ... [2025-02-08 05:39:12,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ee1e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:12, skipping insertion in model container [2025-02-08 05:39:12,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:10" (2/3) ... [2025-02-08 05:39:12,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ee1e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:12, skipping insertion in model container [2025-02-08 05:39:12,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:12" (3/3) ... [2025-02-08 05:39:12,218 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-02-08 05:39:12,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:12,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 420 locations, 1 initial locations, 3 loop locations, and 73 error locations. [2025-02-08 05:39:12,235 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:12,360 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:39:12,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 426 places, 439 transitions, 892 flow [2025-02-08 05:39:12,570 INFO L124 PetriNetUnfolderBase]: 20/437 cut-off events. [2025-02-08 05:39:12,572 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:39:12,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 437 events. 20/437 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 803 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 323. Up to 2 conditions per place. [2025-02-08 05:39:12,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 426 places, 439 transitions, 892 flow [2025-02-08 05:39:12,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 408 places, 420 transitions, 852 flow [2025-02-08 05:39:12,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:12,621 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;@59dfeba3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:12,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-02-08 05:39:12,630 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:12,630 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:39:12,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:12,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:12,631 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:39:12,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:12,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash -110700805, now seen corresponding path program 1 times [2025-02-08 05:39:12,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:12,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740142593] [2025-02-08 05:39:12,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:12,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:39:12,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:39:12,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:12,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:12,806 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:39:12,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:12,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740142593] [2025-02-08 05:39:12,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740142593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:12,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:12,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910190460] [2025-02-08 05:39:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:12,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:12,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:12,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:12,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 439 [2025-02-08 05:39:12,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 420 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 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:39:12,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:12,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 439 [2025-02-08 05:39:12,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:13,049 INFO L124 PetriNetUnfolderBase]: 8/582 cut-off events. [2025-02-08 05:39:13,050 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2025-02-08 05:39:13,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 582 events. 8/582 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1882 event pairs, 2 based on Foata normal form. 29/522 useless extension candidates. Maximal degree in co-relation 365. Up to 20 conditions per place. [2025-02-08 05:39:13,057 INFO L140 encePairwiseOnDemand]: 423/439 looper letters, 15 selfloop transitions, 2 changer transitions 3/406 dead transitions. [2025-02-08 05:39:13,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 406 transitions, 858 flow [2025-02-08 05:39:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2025-02-08 05:39:13,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9460895975702354 [2025-02-08 05:39:13,082 INFO L175 Difference]: Start difference. First operand has 408 places, 420 transitions, 852 flow. Second operand 3 states and 1246 transitions. [2025-02-08 05:39:13,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 406 transitions, 858 flow [2025-02-08 05:39:13,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 406 transitions, 850 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:39:13,105 INFO L231 Difference]: Finished difference. Result has 405 places, 403 transitions, 814 flow [2025-02-08 05:39:13,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=405, PETRI_TRANSITIONS=403} [2025-02-08 05:39:13,112 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -3 predicate places. [2025-02-08 05:39:13,112 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 403 transitions, 814 flow [2025-02-08 05:39:13,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 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:39:13,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:13,113 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:39:13,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:13,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:13,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1290152102, now seen corresponding path program 1 times [2025-02-08 05:39:13,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:13,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812268474] [2025-02-08 05:39:13,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:13,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:13,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:39:13,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:39:13,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:13,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:13,210 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:39:13,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:13,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812268474] [2025-02-08 05:39:13,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812268474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:13,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:13,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:13,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847464219] [2025-02-08 05:39:13,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:13,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:13,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:13,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:13,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:13,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2025-02-08 05:39:13,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 403 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:39:13,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:13,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2025-02-08 05:39:13,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:13,319 INFO L124 PetriNetUnfolderBase]: 8/476 cut-off events. [2025-02-08 05:39:13,320 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:39:13,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 476 events. 8/476 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 858 event pairs, 2 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 465. Up to 15 conditions per place. [2025-02-08 05:39:13,323 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 10 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-02-08 05:39:13,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 402 transitions, 836 flow [2025-02-08 05:39:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2025-02-08 05:39:13,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9438116932422171 [2025-02-08 05:39:13,329 INFO L175 Difference]: Start difference. First operand has 405 places, 403 transitions, 814 flow. Second operand 3 states and 1243 transitions. [2025-02-08 05:39:13,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 402 transitions, 836 flow [2025-02-08 05:39:13,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 402 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:13,337 INFO L231 Difference]: Finished difference. Result has 401 places, 402 transitions, 812 flow [2025-02-08 05:39:13,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=401, PETRI_TRANSITIONS=402} [2025-02-08 05:39:13,339 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -7 predicate places. [2025-02-08 05:39:13,339 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 402 transitions, 812 flow [2025-02-08 05:39:13,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:39:13,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:13,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:13,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:13,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:13,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:13,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1787066598, now seen corresponding path program 1 times [2025-02-08 05:39:13,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:13,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811433533] [2025-02-08 05:39:13,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:13,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:39:13,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:39:13,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:13,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:13,417 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:39:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:13,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811433533] [2025-02-08 05:39:13,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811433533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:13,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:13,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:13,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236116187] [2025-02-08 05:39:13,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:13,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:13,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:13,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:13,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 439 [2025-02-08 05:39:13,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 402 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 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:39:13,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:13,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 439 [2025-02-08 05:39:13,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:13,496 INFO L124 PetriNetUnfolderBase]: 6/401 cut-off events. [2025-02-08 05:39:13,496 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:39:13,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 401 events. 6/401 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 726 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 375. Up to 8 conditions per place. [2025-02-08 05:39:13,499 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 7 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-02-08 05:39:13,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 401 transitions, 828 flow [2025-02-08 05:39:13,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions. [2025-02-08 05:39:13,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9483675018982536 [2025-02-08 05:39:13,504 INFO L175 Difference]: Start difference. First operand has 401 places, 402 transitions, 812 flow. Second operand 3 states and 1249 transitions. [2025-02-08 05:39:13,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 401 transitions, 828 flow [2025-02-08 05:39:13,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 401 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:13,512 INFO L231 Difference]: Finished difference. Result has 400 places, 401 transitions, 810 flow [2025-02-08 05:39:13,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=400, PETRI_TRANSITIONS=401} [2025-02-08 05:39:13,514 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -8 predicate places. [2025-02-08 05:39:13,515 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 401 transitions, 810 flow [2025-02-08 05:39:13,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 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:39:13,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:13,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:13,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:13,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:13,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:13,517 INFO L85 PathProgramCache]: Analyzing trace with hash 844537294, now seen corresponding path program 1 times [2025-02-08 05:39:13,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:13,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115918390] [2025-02-08 05:39:13,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:13,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:13,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:39:13,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:39:13,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:13,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:13,581 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:39:13,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:13,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115918390] [2025-02-08 05:39:13,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115918390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:13,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:13,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:13,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798596553] [2025-02-08 05:39:13,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:13,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:13,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:13,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:13,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 439 [2025-02-08 05:39:13,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 401 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 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:39:13,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:13,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 439 [2025-02-08 05:39:13,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:13,678 INFO L124 PetriNetUnfolderBase]: 6/400 cut-off events. [2025-02-08 05:39:13,678 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:39:13,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 400 events. 6/400 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 723 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 366. Up to 8 conditions per place. [2025-02-08 05:39:13,679 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 7 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2025-02-08 05:39:13,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 400 transitions, 826 flow [2025-02-08 05:39:13,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions. [2025-02-08 05:39:13,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9483675018982536 [2025-02-08 05:39:13,684 INFO L175 Difference]: Start difference. First operand has 400 places, 401 transitions, 810 flow. Second operand 3 states and 1249 transitions. [2025-02-08 05:39:13,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 400 transitions, 826 flow [2025-02-08 05:39:13,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 400 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:13,690 INFO L231 Difference]: Finished difference. Result has 399 places, 400 transitions, 808 flow [2025-02-08 05:39:13,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=399, PETRI_TRANSITIONS=400} [2025-02-08 05:39:13,692 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -9 predicate places. [2025-02-08 05:39:13,692 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 400 transitions, 808 flow [2025-02-08 05:39:13,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 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:39:13,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:13,693 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] [2025-02-08 05:39:13,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:13,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:13,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1708503359, now seen corresponding path program 1 times [2025-02-08 05:39:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30582462] [2025-02-08 05:39:13,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:13,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:39:13,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:39:13,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:13,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:13,764 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:39:13,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:13,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30582462] [2025-02-08 05:39:13,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30582462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:13,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:13,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:13,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566851045] [2025-02-08 05:39:13,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:13,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:13,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:13,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:13,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:13,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 439 [2025-02-08 05:39:13,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 400 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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:39:13,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:13,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 439 [2025-02-08 05:39:13,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:13,881 INFO L124 PetriNetUnfolderBase]: 8/575 cut-off events. [2025-02-08 05:39:13,882 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:39:13,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 575 events. 8/575 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1489 event pairs, 2 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 543. Up to 16 conditions per place. [2025-02-08 05:39:13,888 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 11 selfloop transitions, 2 changer transitions 0/399 dead transitions. [2025-02-08 05:39:13,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 399 transitions, 832 flow [2025-02-08 05:39:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1241 transitions. [2025-02-08 05:39:13,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9422930903568717 [2025-02-08 05:39:13,892 INFO L175 Difference]: Start difference. First operand has 399 places, 400 transitions, 808 flow. Second operand 3 states and 1241 transitions. [2025-02-08 05:39:13,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 399 transitions, 832 flow [2025-02-08 05:39:13,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 399 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:13,900 INFO L231 Difference]: Finished difference. Result has 398 places, 399 transitions, 806 flow [2025-02-08 05:39:13,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=398, PETRI_TRANSITIONS=399} [2025-02-08 05:39:13,902 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -10 predicate places. [2025-02-08 05:39:13,902 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 399 transitions, 806 flow [2025-02-08 05:39:13,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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:39:13,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:13,905 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] [2025-02-08 05:39:13,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:13,905 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:13,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:13,905 INFO L85 PathProgramCache]: Analyzing trace with hash 520786566, now seen corresponding path program 1 times [2025-02-08 05:39:13,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:13,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040897686] [2025-02-08 05:39:13,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:13,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:13,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:39:13,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:39:13,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:13,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:13,986 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:39:13,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:13,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040897686] [2025-02-08 05:39:13,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040897686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:13,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:13,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:13,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458501498] [2025-02-08 05:39:13,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:13,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:13,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:13,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:13,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:14,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 439 [2025-02-08 05:39:14,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 399 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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:39:14,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:14,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 439 [2025-02-08 05:39:14,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:14,078 INFO L124 PetriNetUnfolderBase]: 8/439 cut-off events. [2025-02-08 05:39:14,078 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:39:14,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 439 events. 8/439 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 796 event pairs, 2 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 397. Up to 16 conditions per place. [2025-02-08 05:39:14,081 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 11 selfloop transitions, 2 changer transitions 0/398 dead transitions. [2025-02-08 05:39:14,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 398 transitions, 830 flow [2025-02-08 05:39:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1241 transitions. [2025-02-08 05:39:14,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9422930903568717 [2025-02-08 05:39:14,084 INFO L175 Difference]: Start difference. First operand has 398 places, 399 transitions, 806 flow. Second operand 3 states and 1241 transitions. [2025-02-08 05:39:14,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 398 transitions, 830 flow [2025-02-08 05:39:14,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 398 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:14,091 INFO L231 Difference]: Finished difference. Result has 397 places, 398 transitions, 804 flow [2025-02-08 05:39:14,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=397, PETRI_TRANSITIONS=398} [2025-02-08 05:39:14,092 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -11 predicate places. [2025-02-08 05:39:14,093 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 398 transitions, 804 flow [2025-02-08 05:39:14,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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:39:14,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:14,094 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] [2025-02-08 05:39:14,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:14,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:14,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:14,094 INFO L85 PathProgramCache]: Analyzing trace with hash -843157751, now seen corresponding path program 1 times [2025-02-08 05:39:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:14,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519963239] [2025-02-08 05:39:14,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:14,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:39:14,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:39:14,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:14,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:14,140 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:39:14,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:14,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519963239] [2025-02-08 05:39:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519963239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:14,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442476374] [2025-02-08 05:39:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:14,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:14,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:14,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:14,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:14,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2025-02-08 05:39:14,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 398 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:39:14,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:14,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2025-02-08 05:39:14,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:14,236 INFO L124 PetriNetUnfolderBase]: 8/482 cut-off events. [2025-02-08 05:39:14,236 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:39:14,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 482 events. 8/482 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1309 event pairs, 2 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 433. Up to 15 conditions per place. [2025-02-08 05:39:14,239 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 10 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2025-02-08 05:39:14,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 397 transitions, 826 flow [2025-02-08 05:39:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2025-02-08 05:39:14,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9438116932422171 [2025-02-08 05:39:14,243 INFO L175 Difference]: Start difference. First operand has 397 places, 398 transitions, 804 flow. Second operand 3 states and 1243 transitions. [2025-02-08 05:39:14,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 397 transitions, 826 flow [2025-02-08 05:39:14,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 397 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:14,250 INFO L231 Difference]: Finished difference. Result has 396 places, 397 transitions, 802 flow [2025-02-08 05:39:14,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=396, PETRI_TRANSITIONS=397} [2025-02-08 05:39:14,252 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -12 predicate places. [2025-02-08 05:39:14,252 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 397 transitions, 802 flow [2025-02-08 05:39:14,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:39:14,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:14,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:14,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:14,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:14,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1450743080, now seen corresponding path program 1 times [2025-02-08 05:39:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:14,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272633627] [2025-02-08 05:39:14,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:14,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:14,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:39:14,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:39:14,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:14,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:14,326 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:39:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272633627] [2025-02-08 05:39:14,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272633627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:14,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:14,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828858267] [2025-02-08 05:39:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:14,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:14,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:14,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:14,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2025-02-08 05:39:14,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 397 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:39:14,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:14,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2025-02-08 05:39:14,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:14,409 INFO L124 PetriNetUnfolderBase]: 8/481 cut-off events. [2025-02-08 05:39:14,409 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:39:14,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 481 events. 8/481 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 879 event pairs, 2 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 422. Up to 15 conditions per place. [2025-02-08 05:39:14,412 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 10 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2025-02-08 05:39:14,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 396 transitions, 824 flow [2025-02-08 05:39:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2025-02-08 05:39:14,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9438116932422171 [2025-02-08 05:39:14,415 INFO L175 Difference]: Start difference. First operand has 396 places, 397 transitions, 802 flow. Second operand 3 states and 1243 transitions. [2025-02-08 05:39:14,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 396 transitions, 824 flow [2025-02-08 05:39:14,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 396 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:14,422 INFO L231 Difference]: Finished difference. Result has 395 places, 396 transitions, 800 flow [2025-02-08 05:39:14,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=395, PETRI_TRANSITIONS=396} [2025-02-08 05:39:14,425 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -13 predicate places. [2025-02-08 05:39:14,426 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 396 transitions, 800 flow [2025-02-08 05:39:14,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:39:14,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:14,427 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] [2025-02-08 05:39:14,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:39:14,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:14,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:14,427 INFO L85 PathProgramCache]: Analyzing trace with hash 152944804, now seen corresponding path program 1 times [2025-02-08 05:39:14,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:14,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932388880] [2025-02-08 05:39:14,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:14,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:14,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:39:14,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:39:14,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:14,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:14,489 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:39:14,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:14,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932388880] [2025-02-08 05:39:14,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932388880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:14,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:14,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:14,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104873741] [2025-02-08 05:39:14,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:14,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:14,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:14,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:14,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:14,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2025-02-08 05:39:14,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 396 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:39:14,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:14,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2025-02-08 05:39:14,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:14,580 INFO L124 PetriNetUnfolderBase]: 9/559 cut-off events. [2025-02-08 05:39:14,580 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:39:14,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 559 events. 9/559 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1844 event pairs, 3 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 495. Up to 17 conditions per place. [2025-02-08 05:39:14,582 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 10 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2025-02-08 05:39:14,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 395 transitions, 822 flow [2025-02-08 05:39:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2025-02-08 05:39:14,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9438116932422171 [2025-02-08 05:39:14,586 INFO L175 Difference]: Start difference. First operand has 395 places, 396 transitions, 800 flow. Second operand 3 states and 1243 transitions. [2025-02-08 05:39:14,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 395 transitions, 822 flow [2025-02-08 05:39:14,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 395 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:14,592 INFO L231 Difference]: Finished difference. Result has 394 places, 395 transitions, 798 flow [2025-02-08 05:39:14,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=394, PETRI_TRANSITIONS=395} [2025-02-08 05:39:14,594 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -14 predicate places. [2025-02-08 05:39:14,594 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 395 transitions, 798 flow [2025-02-08 05:39:14,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:39:14,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:14,595 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] [2025-02-08 05:39:14,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:39:14,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:14,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash -822455073, now seen corresponding path program 1 times [2025-02-08 05:39:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910302146] [2025-02-08 05:39:14,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:14,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:39:14,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:39:14,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:14,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:14,657 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:39:14,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:14,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910302146] [2025-02-08 05:39:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910302146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:14,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:14,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:14,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260709119] [2025-02-08 05:39:14,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:14,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:14,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:14,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:14,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2025-02-08 05:39:14,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 395 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:39:14,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:14,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2025-02-08 05:39:14,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:14,762 INFO L124 PetriNetUnfolderBase]: 14/793 cut-off events. [2025-02-08 05:39:14,763 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:39:14,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 793 events. 14/793 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3312 event pairs, 8 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 731. Up to 26 conditions per place. [2025-02-08 05:39:14,766 INFO L140 encePairwiseOnDemand]: 435/439 looper letters, 10 selfloop transitions, 1 changer transitions 0/392 dead transitions. [2025-02-08 05:39:14,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 392 transitions, 814 flow [2025-02-08 05:39:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1244 transitions. [2025-02-08 05:39:14,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9445709946848899 [2025-02-08 05:39:14,770 INFO L175 Difference]: Start difference. First operand has 394 places, 395 transitions, 798 flow. Second operand 3 states and 1244 transitions. [2025-02-08 05:39:14,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 392 transitions, 814 flow [2025-02-08 05:39:14,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 392 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:14,776 INFO L231 Difference]: Finished difference. Result has 391 places, 392 transitions, 790 flow [2025-02-08 05:39:14,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=391, PETRI_TRANSITIONS=392} [2025-02-08 05:39:14,778 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -17 predicate places. [2025-02-08 05:39:14,778 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 392 transitions, 790 flow [2025-02-08 05:39:14,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:39:14,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:14,779 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] [2025-02-08 05:39:14,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:39:14,779 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:14,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:14,780 INFO L85 PathProgramCache]: Analyzing trace with hash -752934454, now seen corresponding path program 1 times [2025-02-08 05:39:14,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:14,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283547621] [2025-02-08 05:39:14,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:14,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:14,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-08 05:39:14,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-08 05:39:14,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:14,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:15,486 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:39:15,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:15,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283547621] [2025-02-08 05:39:15,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283547621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:15,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:15,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:15,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988652248] [2025-02-08 05:39:15,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:15,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:15,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:15,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:15,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:15,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 439 [2025-02-08 05:39:15,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 392 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 399.5) internal successors, (2397), 6 states have internal predecessors, (2397), 0 states have call successors, (0), 0 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:39:15,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:15,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 439 [2025-02-08 05:39:15,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:15,723 INFO L124 PetriNetUnfolderBase]: 30/652 cut-off events. [2025-02-08 05:39:15,723 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-08 05:39:15,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 652 events. 30/652 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2441 event pairs, 24 based on Foata normal form. 0/568 useless extension candidates. Maximal degree in co-relation 638. Up to 69 conditions per place. [2025-02-08 05:39:15,726 INFO L140 encePairwiseOnDemand]: 433/439 looper letters, 20 selfloop transitions, 5 changer transitions 0/391 dead transitions. [2025-02-08 05:39:15,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 391 transitions, 838 flow [2025-02-08 05:39:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2414 transitions. [2025-02-08 05:39:15,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9164768413059985 [2025-02-08 05:39:15,733 INFO L175 Difference]: Start difference. First operand has 391 places, 392 transitions, 790 flow. Second operand 6 states and 2414 transitions. [2025-02-08 05:39:15,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 391 transitions, 838 flow [2025-02-08 05:39:15,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 391 transitions, 837 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:15,740 INFO L231 Difference]: Finished difference. Result has 394 places, 391 transitions, 797 flow [2025-02-08 05:39:15,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=394, PETRI_TRANSITIONS=391} [2025-02-08 05:39:15,741 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -14 predicate places. [2025-02-08 05:39:15,741 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 391 transitions, 797 flow [2025-02-08 05:39:15,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 399.5) internal successors, (2397), 6 states have internal predecessors, (2397), 0 states have call successors, (0), 0 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:39:15,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:15,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:15,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:39:15,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:15,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash -535884454, now seen corresponding path program 1 times [2025-02-08 05:39:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:15,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599651236] [2025-02-08 05:39:15,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:15,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-08 05:39:15,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-08 05:39:15,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:15,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:15,796 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:39:15,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599651236] [2025-02-08 05:39:15,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599651236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:15,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:15,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:15,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841651588] [2025-02-08 05:39:15,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:15,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:15,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:15,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:15,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:15,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 439 [2025-02-08 05:39:15,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 391 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 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:39:15,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:15,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 439 [2025-02-08 05:39:15,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:15,897 INFO L124 PetriNetUnfolderBase]: 9/512 cut-off events. [2025-02-08 05:39:15,897 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:39:15,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 512 events. 9/512 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1327 event pairs, 3 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 523. Up to 16 conditions per place. [2025-02-08 05:39:15,900 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 9 selfloop transitions, 2 changer transitions 0/390 dead transitions. [2025-02-08 05:39:15,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 390 transitions, 817 flow [2025-02-08 05:39:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-02-08 05:39:15,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453302961275627 [2025-02-08 05:39:15,929 INFO L175 Difference]: Start difference. First operand has 394 places, 391 transitions, 797 flow. Second operand 3 states and 1245 transitions. [2025-02-08 05:39:15,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 390 transitions, 817 flow [2025-02-08 05:39:15,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 390 transitions, 807 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:15,935 INFO L231 Difference]: Finished difference. Result has 390 places, 390 transitions, 789 flow [2025-02-08 05:39:15,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=390, PETRI_TRANSITIONS=390} [2025-02-08 05:39:15,936 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -18 predicate places. [2025-02-08 05:39:15,937 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 390 transitions, 789 flow [2025-02-08 05:39:15,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 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:39:15,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:15,938 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] [2025-02-08 05:39:15,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:39:15,938 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:15,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:15,939 INFO L85 PathProgramCache]: Analyzing trace with hash -23280882, now seen corresponding path program 1 times [2025-02-08 05:39:15,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:15,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854693086] [2025-02-08 05:39:15,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:15,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:15,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:39:15,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:39:15,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:15,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:15,989 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:39:15,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:15,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854693086] [2025-02-08 05:39:15,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854693086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:15,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:15,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874337299] [2025-02-08 05:39:15,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:15,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:15,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:15,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:15,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:16,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2025-02-08 05:39:16,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 390 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 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:39:16,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:16,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2025-02-08 05:39:16,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:16,096 INFO L124 PetriNetUnfolderBase]: 10/626 cut-off events. [2025-02-08 05:39:16,096 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:39:16,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 626 events. 10/626 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2434 event pairs, 4 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 569. Up to 28 conditions per place. [2025-02-08 05:39:16,099 INFO L140 encePairwiseOnDemand]: 430/439 looper letters, 20 selfloop transitions, 1 changer transitions 0/382 dead transitions. [2025-02-08 05:39:16,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 382 transitions, 815 flow [2025-02-08 05:39:16,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2025-02-08 05:39:16,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9217919514047077 [2025-02-08 05:39:16,102 INFO L175 Difference]: Start difference. First operand has 390 places, 390 transitions, 789 flow. Second operand 3 states and 1214 transitions. [2025-02-08 05:39:16,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 382 transitions, 815 flow [2025-02-08 05:39:16,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 382 transitions, 811 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:16,108 INFO L231 Difference]: Finished difference. Result has 382 places, 382 transitions, 771 flow [2025-02-08 05:39:16,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=382, PETRI_TRANSITIONS=382} [2025-02-08 05:39:16,110 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -26 predicate places. [2025-02-08 05:39:16,110 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 382 transitions, 771 flow [2025-02-08 05:39:16,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 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:39:16,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:16,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:16,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:39:16,111 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:16,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:16,112 INFO L85 PathProgramCache]: Analyzing trace with hash -898056684, now seen corresponding path program 1 times [2025-02-08 05:39:16,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:16,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870182333] [2025-02-08 05:39:16,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:16,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:16,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 05:39:16,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 05:39:16,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:16,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:16,164 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:39:16,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:16,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870182333] [2025-02-08 05:39:16,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870182333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:16,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:16,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:16,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715766937] [2025-02-08 05:39:16,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:16,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:16,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:16,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:16,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:16,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2025-02-08 05:39:16,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 382 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:39:16,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:16,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2025-02-08 05:39:16,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:16,238 INFO L124 PetriNetUnfolderBase]: 10/453 cut-off events. [2025-02-08 05:39:16,238 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-08 05:39:16,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 453 events. 10/453 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 791 event pairs, 4 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 381. Up to 18 conditions per place. [2025-02-08 05:39:16,241 INFO L140 encePairwiseOnDemand]: 435/439 looper letters, 10 selfloop transitions, 1 changer transitions 0/379 dead transitions. [2025-02-08 05:39:16,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 379 transitions, 787 flow [2025-02-08 05:39:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1244 transitions. [2025-02-08 05:39:16,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9445709946848899 [2025-02-08 05:39:16,244 INFO L175 Difference]: Start difference. First operand has 382 places, 382 transitions, 771 flow. Second operand 3 states and 1244 transitions. [2025-02-08 05:39:16,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 379 transitions, 787 flow [2025-02-08 05:39:16,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 379 transitions, 786 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:16,250 INFO L231 Difference]: Finished difference. Result has 380 places, 379 transitions, 766 flow [2025-02-08 05:39:16,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=380, PETRI_TRANSITIONS=379} [2025-02-08 05:39:16,252 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -28 predicate places. [2025-02-08 05:39:16,252 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 379 transitions, 766 flow [2025-02-08 05:39:16,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:39:16,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:16,253 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] [2025-02-08 05:39:16,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:39:16,253 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:16,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2041145018, now seen corresponding path program 1 times [2025-02-08 05:39:16,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:16,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778529520] [2025-02-08 05:39:16,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:16,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:16,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-08 05:39:16,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 05:39:16,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:16,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:16,303 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:39:16,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:16,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778529520] [2025-02-08 05:39:16,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778529520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:16,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:16,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:16,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383810026] [2025-02-08 05:39:16,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:16,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:16,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:16,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:16,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:16,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 439 [2025-02-08 05:39:16,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 379 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:39:16,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:16,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 439 [2025-02-08 05:39:16,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:16,403 INFO L124 PetriNetUnfolderBase]: 14/675 cut-off events. [2025-02-08 05:39:16,403 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:39:16,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 675 events. 14/675 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2184 event pairs, 1 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 612. Up to 14 conditions per place. [2025-02-08 05:39:16,409 INFO L140 encePairwiseOnDemand]: 432/439 looper letters, 11 selfloop transitions, 4 changer transitions 0/379 dead transitions. [2025-02-08 05:39:16,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 379 transitions, 798 flow [2025-02-08 05:39:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-02-08 05:39:16,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453302961275627 [2025-02-08 05:39:16,412 INFO L175 Difference]: Start difference. First operand has 380 places, 379 transitions, 766 flow. Second operand 3 states and 1245 transitions. [2025-02-08 05:39:16,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 379 transitions, 798 flow [2025-02-08 05:39:16,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 379 transitions, 797 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:16,421 INFO L231 Difference]: Finished difference. Result has 379 places, 377 transitions, 775 flow [2025-02-08 05:39:16,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=379, PETRI_TRANSITIONS=377} [2025-02-08 05:39:16,423 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -29 predicate places. [2025-02-08 05:39:16,423 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 377 transitions, 775 flow [2025-02-08 05:39:16,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:39:16,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:16,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:16,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:39:16,424 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:16,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash -818372593, now seen corresponding path program 1 times [2025-02-08 05:39:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:16,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439276016] [2025-02-08 05:39:16,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:16,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-08 05:39:16,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-08 05:39:16,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:16,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:16,481 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:39:16,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:16,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439276016] [2025-02-08 05:39:16,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439276016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:16,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:16,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982981633] [2025-02-08 05:39:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:16,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:16,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:16,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:16,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 439 [2025-02-08 05:39:16,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 377 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:39:16,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:16,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 439 [2025-02-08 05:39:16,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:16,617 INFO L124 PetriNetUnfolderBase]: 21/900 cut-off events. [2025-02-08 05:39:16,618 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-02-08 05:39:16,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 900 events. 21/900 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4217 event pairs, 1 based on Foata normal form. 1/805 useless extension candidates. Maximal degree in co-relation 860. Up to 21 conditions per place. [2025-02-08 05:39:16,623 INFO L140 encePairwiseOnDemand]: 432/439 looper letters, 10 selfloop transitions, 3 changer transitions 4/378 dead transitions. [2025-02-08 05:39:16,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 378 transitions, 810 flow [2025-02-08 05:39:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-02-08 05:39:16,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453302961275627 [2025-02-08 05:39:16,627 INFO L175 Difference]: Start difference. First operand has 379 places, 377 transitions, 775 flow. Second operand 3 states and 1245 transitions. [2025-02-08 05:39:16,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 378 transitions, 810 flow [2025-02-08 05:39:16,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 378 transitions, 806 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:16,633 INFO L231 Difference]: Finished difference. Result has 378 places, 371 transitions, 767 flow [2025-02-08 05:39:16,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=378, PETRI_TRANSITIONS=371} [2025-02-08 05:39:16,633 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -30 predicate places. [2025-02-08 05:39:16,634 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 371 transitions, 767 flow [2025-02-08 05:39:16,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:39:16,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:16,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] [2025-02-08 05:39:16,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:39:16,636 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:16,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2108158669, now seen corresponding path program 1 times [2025-02-08 05:39:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:16,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326192709] [2025-02-08 05:39:16,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:16,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:16,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-08 05:39:16,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-08 05:39:16,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:16,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:16,698 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:39:16,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:16,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326192709] [2025-02-08 05:39:16,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326192709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:16,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:16,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407576734] [2025-02-08 05:39:16,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:16,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:16,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:16,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:16,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2025-02-08 05:39:16,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 371 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:39:16,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:16,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2025-02-08 05:39:16,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:16,898 INFO L124 PetriNetUnfolderBase]: 49/1507 cut-off events. [2025-02-08 05:39:16,899 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:39:16,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 1507 events. 49/1507 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10229 event pairs, 0 based on Foata normal form. 0/1351 useless extension candidates. Maximal degree in co-relation 1563. Up to 74 conditions per place. [2025-02-08 05:39:16,906 INFO L140 encePairwiseOnDemand]: 434/439 looper letters, 11 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-02-08 05:39:16,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 371 transitions, 795 flow [2025-02-08 05:39:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2025-02-08 05:39:16,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9460895975702354 [2025-02-08 05:39:16,910 INFO L175 Difference]: Start difference. First operand has 378 places, 371 transitions, 767 flow. Second operand 3 states and 1246 transitions. [2025-02-08 05:39:16,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 371 transitions, 795 flow [2025-02-08 05:39:16,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 371 transitions, 792 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:16,916 INFO L231 Difference]: Finished difference. Result has 373 places, 369 transitions, 768 flow [2025-02-08 05:39:16,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=373, PETRI_TRANSITIONS=369} [2025-02-08 05:39:16,917 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -35 predicate places. [2025-02-08 05:39:16,917 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 369 transitions, 768 flow [2025-02-08 05:39:16,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:39:16,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:16,918 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] [2025-02-08 05:39:16,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:39:16,919 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:16,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash 450465844, now seen corresponding path program 1 times [2025-02-08 05:39:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:16,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111690655] [2025-02-08 05:39:16,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:16,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:16,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-08 05:39:16,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-08 05:39:16,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:16,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:16,963 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:39:16,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:16,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111690655] [2025-02-08 05:39:16,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111690655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:16,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:16,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:16,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549791153] [2025-02-08 05:39:16,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:16,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:16,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:16,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:16,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:16,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2025-02-08 05:39:16,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 369 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:39:16,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:16,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2025-02-08 05:39:16,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:17,204 INFO L124 PetriNetUnfolderBase]: 52/1853 cut-off events. [2025-02-08 05:39:17,204 INFO L125 PetriNetUnfolderBase]: For 12/16 co-relation queries the response was YES. [2025-02-08 05:39:17,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 1853 events. 52/1853 cut-off events. For 12/16 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 13087 event pairs, 0 based on Foata normal form. 0/1698 useless extension candidates. Maximal degree in co-relation 1966. Up to 92 conditions per place. [2025-02-08 05:39:17,216 INFO L140 encePairwiseOnDemand]: 434/439 looper letters, 12 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-02-08 05:39:17,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 370 transitions, 801 flow [2025-02-08 05:39:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1247 transitions. [2025-02-08 05:39:17,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468488990129081 [2025-02-08 05:39:17,220 INFO L175 Difference]: Start difference. First operand has 373 places, 369 transitions, 768 flow. Second operand 3 states and 1247 transitions. [2025-02-08 05:39:17,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 370 transitions, 801 flow [2025-02-08 05:39:17,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 370 transitions, 801 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:17,227 INFO L231 Difference]: Finished difference. Result has 373 places, 367 transitions, 772 flow [2025-02-08 05:39:17,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=373, PETRI_TRANSITIONS=367} [2025-02-08 05:39:17,228 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -35 predicate places. [2025-02-08 05:39:17,228 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 367 transitions, 772 flow [2025-02-08 05:39:17,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:39:17,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:17,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:17,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:39:17,229 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:17,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash -343887907, now seen corresponding path program 1 times [2025-02-08 05:39:17,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:17,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893199827] [2025-02-08 05:39:17,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:17,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 05:39:17,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 05:39:17,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:17,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:17,291 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:39:17,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:17,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893199827] [2025-02-08 05:39:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893199827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:17,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:17,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:17,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149576663] [2025-02-08 05:39:17,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:17,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:17,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:17,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:17,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:17,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 439 [2025-02-08 05:39:17,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 367 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 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:39:17,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:17,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 439 [2025-02-08 05:39:17,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:17,604 INFO L124 PetriNetUnfolderBase]: 77/2419 cut-off events. [2025-02-08 05:39:17,604 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2025-02-08 05:39:17,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2716 conditions, 2419 events. 77/2419 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 20086 event pairs, 10 based on Foata normal form. 0/2223 useless extension candidates. Maximal degree in co-relation 2616. Up to 104 conditions per place. [2025-02-08 05:39:17,622 INFO L140 encePairwiseOnDemand]: 435/439 looper letters, 10 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-02-08 05:39:17,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 369 transitions, 802 flow [2025-02-08 05:39:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1253 transitions. [2025-02-08 05:39:17,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514047076689446 [2025-02-08 05:39:17,625 INFO L175 Difference]: Start difference. First operand has 373 places, 367 transitions, 772 flow. Second operand 3 states and 1253 transitions. [2025-02-08 05:39:17,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 369 transitions, 802 flow [2025-02-08 05:39:17,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 369 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:17,632 INFO L231 Difference]: Finished difference. Result has 374 places, 367 transitions, 782 flow [2025-02-08 05:39:17,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=374, PETRI_TRANSITIONS=367} [2025-02-08 05:39:17,633 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -34 predicate places. [2025-02-08 05:39:17,633 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 367 transitions, 782 flow [2025-02-08 05:39:17,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 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:39:17,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:17,634 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] [2025-02-08 05:39:17,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:39:17,634 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:17,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash -462472634, now seen corresponding path program 1 times [2025-02-08 05:39:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907610313] [2025-02-08 05:39:17,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:17,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 05:39:17,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 05:39:17,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:17,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:18,249 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:39:18,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:18,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907610313] [2025-02-08 05:39:18,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907610313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:18,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:18,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:18,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667705773] [2025-02-08 05:39:18,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:18,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:18,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:18,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:18,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:18,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 439 [2025-02-08 05:39:18,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 367 transitions, 782 flow. Second operand has 6 states, 6 states have (on average 407.6666666666667) internal successors, (2446), 6 states have internal predecessors, (2446), 0 states have call successors, (0), 0 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:39:18,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:18,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 439 [2025-02-08 05:39:18,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:18,682 INFO L124 PetriNetUnfolderBase]: 85/2069 cut-off events. [2025-02-08 05:39:18,682 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-02-08 05:39:18,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2454 conditions, 2069 events. 85/2069 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 16489 event pairs, 0 based on Foata normal form. 0/1921 useless extension candidates. Maximal degree in co-relation 2350. Up to 56 conditions per place. [2025-02-08 05:39:18,695 INFO L140 encePairwiseOnDemand]: 434/439 looper letters, 16 selfloop transitions, 4 changer transitions 0/370 dead transitions. [2025-02-08 05:39:18,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 370 transitions, 832 flow [2025-02-08 05:39:18,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2457 transitions. [2025-02-08 05:39:18,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9328018223234624 [2025-02-08 05:39:18,702 INFO L175 Difference]: Start difference. First operand has 374 places, 367 transitions, 782 flow. Second operand 6 states and 2457 transitions. [2025-02-08 05:39:18,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 370 transitions, 832 flow [2025-02-08 05:39:18,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 370 transitions, 832 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:39:18,711 INFO L231 Difference]: Finished difference. Result has 378 places, 366 transitions, 788 flow [2025-02-08 05:39:18,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=788, PETRI_PLACES=378, PETRI_TRANSITIONS=366} [2025-02-08 05:39:18,712 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -30 predicate places. [2025-02-08 05:39:18,712 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 366 transitions, 788 flow [2025-02-08 05:39:18,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.6666666666667) internal successors, (2446), 6 states have internal predecessors, (2446), 0 states have call successors, (0), 0 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:39:18,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:18,713 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] [2025-02-08 05:39:18,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:39:18,713 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:18,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1527160275, now seen corresponding path program 1 times [2025-02-08 05:39:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:18,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673303767] [2025-02-08 05:39:18,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:18,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-08 05:39:18,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-08 05:39:18,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:18,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:19,179 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:39:19,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:19,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673303767] [2025-02-08 05:39:19,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673303767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:19,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:19,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:19,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672078423] [2025-02-08 05:39:19,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:19,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:19,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:19,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:19,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 439 [2025-02-08 05:39:19,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 366 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 407.8333333333333) internal successors, (2447), 6 states have internal predecessors, (2447), 0 states have call successors, (0), 0 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:39:19,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:19,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 439 [2025-02-08 05:39:19,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:19,570 INFO L124 PetriNetUnfolderBase]: 55/1877 cut-off events. [2025-02-08 05:39:19,571 INFO L125 PetriNetUnfolderBase]: For 14/18 co-relation queries the response was YES. [2025-02-08 05:39:19,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 1877 events. 55/1877 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 13824 event pairs, 0 based on Foata normal form. 0/1759 useless extension candidates. Maximal degree in co-relation 2110. Up to 45 conditions per place. [2025-02-08 05:39:19,577 INFO L140 encePairwiseOnDemand]: 434/439 looper letters, 12 selfloop transitions, 4 changer transitions 6/369 dead transitions. [2025-02-08 05:39:19,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 369 transitions, 838 flow [2025-02-08 05:39:19,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:19,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2457 transitions. [2025-02-08 05:39:19,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9328018223234624 [2025-02-08 05:39:19,582 INFO L175 Difference]: Start difference. First operand has 378 places, 366 transitions, 788 flow. Second operand 6 states and 2457 transitions. [2025-02-08 05:39:19,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 369 transitions, 838 flow [2025-02-08 05:39:19,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 369 transitions, 831 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:39:19,589 INFO L231 Difference]: Finished difference. Result has 378 places, 363 transitions, 779 flow [2025-02-08 05:39:19,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=779, PETRI_PLACES=378, PETRI_TRANSITIONS=363} [2025-02-08 05:39:19,590 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -30 predicate places. [2025-02-08 05:39:19,590 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 363 transitions, 779 flow [2025-02-08 05:39:19,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.8333333333333) internal successors, (2447), 6 states have internal predecessors, (2447), 0 states have call successors, (0), 0 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:39:19,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:19,591 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] [2025-02-08 05:39:19,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:39:19,591 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:19,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash -47627104, now seen corresponding path program 1 times [2025-02-08 05:39:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:19,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389134076] [2025-02-08 05:39:19,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:19,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-08 05:39:19,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-08 05:39:19,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:19,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389134076] [2025-02-08 05:39:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389134076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:19,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:19,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555633397] [2025-02-08 05:39:19,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:19,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:19,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:19,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:19,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 439 [2025-02-08 05:39:19,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 363 transitions, 779 flow. Second operand has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:39:19,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:19,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 439 [2025-02-08 05:39:19,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:19,906 INFO L124 PetriNetUnfolderBase]: 71/2001 cut-off events. [2025-02-08 05:39:19,907 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 05:39:19,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 2001 events. 71/2001 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14731 event pairs, 12 based on Foata normal form. 0/1879 useless extension candidates. Maximal degree in co-relation 2292. Up to 83 conditions per place. [2025-02-08 05:39:19,918 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 10 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2025-02-08 05:39:19,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 363 transitions, 804 flow [2025-02-08 05:39:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-02-08 05:39:19,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453302961275627 [2025-02-08 05:39:19,921 INFO L175 Difference]: Start difference. First operand has 378 places, 363 transitions, 779 flow. Second operand 3 states and 1245 transitions. [2025-02-08 05:39:19,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 363 transitions, 804 flow [2025-02-08 05:39:19,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 363 transitions, 797 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:39:19,928 INFO L231 Difference]: Finished difference. Result has 375 places, 362 transitions, 774 flow [2025-02-08 05:39:19,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=375, PETRI_TRANSITIONS=362} [2025-02-08 05:39:19,929 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -33 predicate places. [2025-02-08 05:39:19,929 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 362 transitions, 774 flow [2025-02-08 05:39:19,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:39:19,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:19,929 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] [2025-02-08 05:39:19,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:39:19,930 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:39:19,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1256981261, now seen corresponding path program 1 times [2025-02-08 05:39:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479294592] [2025-02-08 05:39:19,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:19,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:19,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-08 05:39:19,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-08 05:39:19,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:19,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:19,977 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:39:19,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:19,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479294592] [2025-02-08 05:39:19,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479294592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:19,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:19,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:19,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349547119] [2025-02-08 05:39:19,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:19,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:19,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:19,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:19,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:19,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 439 [2025-02-08 05:39:20,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 362 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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:39:20,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:20,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 439 [2025-02-08 05:39:20,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:20,187 INFO L124 PetriNetUnfolderBase]: 47/1727 cut-off events. [2025-02-08 05:39:20,187 INFO L125 PetriNetUnfolderBase]: For 25/29 co-relation queries the response was YES. [2025-02-08 05:39:20,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 1727 events. 47/1727 cut-off events. For 25/29 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 12400 event pairs, 3 based on Foata normal form. 0/1628 useless extension candidates. Maximal degree in co-relation 1899. Up to 63 conditions per place. [2025-02-08 05:39:20,193 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 0 selfloop transitions, 0 changer transitions 362/362 dead transitions. [2025-02-08 05:39:20,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 362 transitions, 799 flow [2025-02-08 05:39:20,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-02-08 05:39:20,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453302961275627 [2025-02-08 05:39:20,196 INFO L175 Difference]: Start difference. First operand has 375 places, 362 transitions, 774 flow. Second operand 3 states and 1245 transitions. [2025-02-08 05:39:20,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 362 transitions, 799 flow [2025-02-08 05:39:20,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 362 transitions, 795 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:20,201 INFO L231 Difference]: Finished difference. Result has 374 places, 0 transitions, 0 flow [2025-02-08 05:39:20,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=374, PETRI_TRANSITIONS=0} [2025-02-08 05:39:20,202 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -34 predicate places. [2025-02-08 05:39:20,202 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 0 transitions, 0 flow [2025-02-08 05:39:20,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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:39:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (62 of 63 remaining) [2025-02-08 05:39:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (61 of 63 remaining) [2025-02-08 05:39:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (60 of 63 remaining) [2025-02-08 05:39:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (59 of 63 remaining) [2025-02-08 05:39:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (58 of 63 remaining) [2025-02-08 05:39:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (57 of 63 remaining) [2025-02-08 05:39:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (56 of 63 remaining) [2025-02-08 05:39:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (55 of 63 remaining) [2025-02-08 05:39:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (54 of 63 remaining) [2025-02-08 05:39:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (53 of 63 remaining) [2025-02-08 05:39:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (51 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (50 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (49 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (48 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (47 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (46 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (45 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (44 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (43 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (42 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (41 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (40 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (39 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (38 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (37 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (36 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (34 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (33 of 63 remaining) [2025-02-08 05:39:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (32 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (30 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (27 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (17 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (16 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (15 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (13 of 63 remaining) [2025-02-08 05:39:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (12 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (11 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (10 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (9 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (8 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (7 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (6 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (4 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (3 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (2 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (1 of 63 remaining) [2025-02-08 05:39:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 63 remaining) [2025-02-08 05:39:20,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:39:20,209 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] [2025-02-08 05:39:20,213 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:20,213 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:20,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:20 BasicIcfg [2025-02-08 05:39:20,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:20,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:20,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:20,222 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:20,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:12" (3/4) ... [2025-02-08 05:39:20,224 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:20,227 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:20,227 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:20,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-08 05:39:20,235 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:20,235 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:39:20,235 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:20,327 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:20,327 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:20,328 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:20,329 INFO L158 Benchmark]: Toolchain (without parser) took 9637.13ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 125.0MB in the beginning and 169.9MB in the end (delta: -44.9MB). Peak memory consumption was 252.2MB. Max. memory is 16.1GB. [2025-02-08 05:39:20,329 INFO L158 Benchmark]: CDTParser took 1.20ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:20,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.73ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 111.8MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:20,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.75ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 108.3MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:20,330 INFO L158 Benchmark]: Boogie Preprocessor took 50.98ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 105.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:20,330 INFO L158 Benchmark]: IcfgBuilder took 1087.49ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 60.7MB in the end (delta: 44.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 05:39:20,330 INFO L158 Benchmark]: TraceAbstraction took 8014.28ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 60.0MB in the beginning and 178.3MB in the end (delta: -118.3MB). Peak memory consumption was 176.7MB. Max. memory is 16.1GB. [2025-02-08 05:39:20,330 INFO L158 Benchmark]: Witness Printer took 105.54ms. Allocated memory is still 469.8MB. Free memory was 178.3MB in the beginning and 169.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:20,333 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.20ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.73ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 111.8MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.75ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 108.3MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.98ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 105.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1087.49ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 60.7MB in the end (delta: 44.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8014.28ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 60.0MB in the beginning and 178.3MB in the end (delta: -118.3MB). Peak memory consumption was 176.7MB. Max. memory is 16.1GB. * Witness Printer took 105.54ms. Allocated memory is still 469.8MB. Free memory was 178.3MB in the beginning and 169.9MB 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: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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: 75]: 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: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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: 114]: 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: 95]: 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: 95]: 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: 95]: 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: 95]: 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: 95]: 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: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: 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 5 procedures, 592 locations, 63 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: 7.8s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 731 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 988 IncrementalHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 133 mSDtfsCounter, 988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=852occurred in iteration=0, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2583 NumberOfCodeBlocks, 2583 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2560 ConstructedInterpolants, 0 QuantifiedInterpolants, 2945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 73 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:20,353 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