./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:35:49,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:35:49,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:35:50,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:35:50,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:35:50,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:35:50,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:35:50,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:35:50,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:35:50,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:35:50,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:35:50,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:35:50,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:35:50,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:35:50,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:35:50,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:35:50,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:35:50,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:35:50,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:35:50,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:35:50,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:35:50,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:35:50,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:35:50,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:35:50,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:35:50,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:35:50,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:35:50,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:35:50,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:35:50,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:35:50,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:35:50,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:35:50,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:35:50,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:35:50,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:35:50,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:35:50,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:35:50,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:35:50,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:35:50,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:35:50,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:35:50,124 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:35:50,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:35:50,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:35:50,163 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:35:50,163 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:35:50,164 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:35:50,164 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:35:50,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:35:50,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:35:50,165 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:35:50,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:35:50,166 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:35:50,167 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:35:50,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:35:50,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:35:50,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:35:50,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:35:50,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:35:50,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:35:50,168 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:35:50,168 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:35:50,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:35:50,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:35:50,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:35:50,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:35:50,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:35:50,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:35:50,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:35:50,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:35:50,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:35:50,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:35:50,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:35:50,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:35:50,172 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:35:50,172 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:35:50,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:35:50,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc [2022-11-02 20:35:50,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:35:50,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:35:50,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:35:50,542 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:35:50,543 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:35:50,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2022-11-02 20:35:50,617 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/data/2466180fd/dd9a45e460bb4de391a80d38c0337c41/FLAG4ec14a6ef [2022-11-02 20:35:51,148 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:35:51,149 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2022-11-02 20:35:51,159 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/data/2466180fd/dd9a45e460bb4de391a80d38c0337c41/FLAG4ec14a6ef [2022-11-02 20:35:51,486 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/data/2466180fd/dd9a45e460bb4de391a80d38c0337c41 [2022-11-02 20:35:51,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:35:51,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:35:51,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:35:51,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:35:51,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:35:51,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:51,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d396fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51, skipping insertion in model container [2022-11-02 20:35:51,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:51,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:35:51,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:35:51,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2022-11-02 20:35:51,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:35:51,797 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:35:51,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2022-11-02 20:35:51,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:35:51,856 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:35:51,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51 WrapperNode [2022-11-02 20:35:51,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:35:51,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:35:51,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:35:51,858 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:35:51,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:51,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:51,942 INFO L138 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 676 [2022-11-02 20:35:51,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:35:51,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:35:51,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:35:51,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:35:51,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:51,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:51,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:51,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:52,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:52,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:52,040 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:52,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:52,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:35:52,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:35:52,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:35:52,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:35:52,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (1/1) ... [2022-11-02 20:35:52,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:35:52,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:52,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:52,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:35:52,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:35:52,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:35:52,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:35:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:35:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:35:52,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:35:52,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:35:52,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:35:52,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:35:52,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:35:52,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:35:52,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:35:52,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:35:52,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:35:52,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:35:52,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:35:52,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:35:52,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:35:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:35:52,159 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:35:52,353 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:35:52,355 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:35:53,538 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:35:54,288 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:35:54,288 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-02 20:35:54,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:54 BoogieIcfgContainer [2022-11-02 20:35:54,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:35:54,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:35:54,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:35:54,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:35:54,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:35:51" (1/3) ... [2022-11-02 20:35:54,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f41ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:35:54, skipping insertion in model container [2022-11-02 20:35:54,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:35:51" (2/3) ... [2022-11-02 20:35:54,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f41ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:35:54, skipping insertion in model container [2022-11-02 20:35:54,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:54" (3/3) ... [2022-11-02 20:35:54,306 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2022-11-02 20:35:54,319 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:35:54,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:35:54,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2022-11-02 20:35:54,331 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:35:54,533 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:35:54,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 453 places, 462 transitions, 956 flow [2022-11-02 20:35:54,772 INFO L130 PetriNetUnfolder]: 22/458 cut-off events. [2022-11-02 20:35:54,773 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:35:54,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 458 events. 22/458 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 687 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 373. Up to 2 conditions per place. [2022-11-02 20:35:54,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 453 places, 462 transitions, 956 flow [2022-11-02 20:35:54,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 428 places, 436 transitions, 896 flow [2022-11-02 20:35:54,801 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:35:54,807 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1e5eeebc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:35:54,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 186 error locations. [2022-11-02 20:35:54,813 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-11-02 20:35:54,813 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:35:54,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:54,814 INFO L208 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] [2022-11-02 20:35:54,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:54,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2028716034, now seen corresponding path program 1 times [2022-11-02 20:35:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:54,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941620146] [2022-11-02 20:35:54,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:54,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:55,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:55,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941620146] [2022-11-02 20:35:55,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941620146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:55,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:55,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:55,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606338869] [2022-11-02 20:35:55,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:55,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:55,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:55,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:55,147 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 462 [2022-11-02 20:35:55,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 436 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:55,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:55,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 462 [2022-11-02 20:35:55,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:55,904 INFO L130 PetriNetUnfolder]: 451/1218 cut-off events. [2022-11-02 20:35:55,904 INFO L131 PetriNetUnfolder]: For 177/248 co-relation queries the response was YES. [2022-11-02 20:35:55,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1963 conditions, 1218 events. 451/1218 cut-off events. For 177/248 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5213 event pairs, 272 based on Foata normal form. 186/1233 useless extension candidates. Maximal degree in co-relation 1540. Up to 618 conditions per place. [2022-11-02 20:35:55,920 INFO L137 encePairwiseOnDemand]: 366/462 looper letters, 29 selfloop transitions, 2 changer transitions 7/342 dead transitions. [2022-11-02 20:35:55,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 342 transitions, 770 flow [2022-11-02 20:35:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2022-11-02 20:35:55,946 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8152958152958153 [2022-11-02 20:35:55,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1130 transitions. [2022-11-02 20:35:55,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1130 transitions. [2022-11-02 20:35:55,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:55,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1130 transitions. [2022-11-02 20:35:55,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:55,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:55,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:55,977 INFO L175 Difference]: Start difference. First operand has 428 places, 436 transitions, 896 flow. Second operand 3 states and 1130 transitions. [2022-11-02 20:35:55,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 342 transitions, 770 flow [2022-11-02 20:35:55,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 342 transitions, 754 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:35:56,000 INFO L231 Difference]: Finished difference. Result has 342 places, 335 transitions, 682 flow [2022-11-02 20:35:56,003 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=342, PETRI_TRANSITIONS=335} [2022-11-02 20:35:56,008 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -86 predicate places. [2022-11-02 20:35:56,009 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 335 transitions, 682 flow [2022-11-02 20:35:56,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:56,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:56,010 INFO L208 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] [2022-11-02 20:35:56,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:35:56,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1177456158, now seen corresponding path program 1 times [2022-11-02 20:35:56,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:56,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477109488] [2022-11-02 20:35:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:56,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:56,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:56,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477109488] [2022-11-02 20:35:56,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477109488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:56,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:56,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:56,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129459019] [2022-11-02 20:35:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:56,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:56,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:56,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:56,152 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 462 [2022-11-02 20:35:56,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 335 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:56,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:56,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 462 [2022-11-02 20:35:56,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:56,695 INFO L130 PetriNetUnfolder]: 451/1210 cut-off events. [2022-11-02 20:35:56,695 INFO L131 PetriNetUnfolder]: For 40/111 co-relation queries the response was YES. [2022-11-02 20:35:56,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 1210 events. 451/1210 cut-off events. For 40/111 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5156 event pairs, 272 based on Foata normal form. 0/1047 useless extension candidates. Maximal degree in co-relation 1829. Up to 615 conditions per place. [2022-11-02 20:35:56,705 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 26 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2022-11-02 20:35:56,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 334 transitions, 736 flow [2022-11-02 20:35:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1043 transitions. [2022-11-02 20:35:56,709 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7525252525252525 [2022-11-02 20:35:56,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1043 transitions. [2022-11-02 20:35:56,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1043 transitions. [2022-11-02 20:35:56,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:56,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1043 transitions. [2022-11-02 20:35:56,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 347.6666666666667) internal successors, (1043), 3 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:56,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:56,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:56,717 INFO L175 Difference]: Start difference. First operand has 342 places, 335 transitions, 682 flow. Second operand 3 states and 1043 transitions. [2022-11-02 20:35:56,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 334 transitions, 736 flow [2022-11-02 20:35:56,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 334 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:56,725 INFO L231 Difference]: Finished difference. Result has 334 places, 334 transitions, 680 flow [2022-11-02 20:35:56,726 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=334, PETRI_TRANSITIONS=334} [2022-11-02 20:35:56,727 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -94 predicate places. [2022-11-02 20:35:56,727 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 334 transitions, 680 flow [2022-11-02 20:35:56,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:56,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:56,728 INFO L208 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] [2022-11-02 20:35:56,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:35:56,728 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:56,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash -277649647, now seen corresponding path program 1 times [2022-11-02 20:35:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:56,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568971208] [2022-11-02 20:35:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:56,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568971208] [2022-11-02 20:35:56,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568971208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:56,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:56,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:56,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469023853] [2022-11-02 20:35:56,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:56,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:56,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:56,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:56,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:56,787 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 462 [2022-11-02 20:35:56,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 334 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:56,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:56,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 462 [2022-11-02 20:35:56,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:57,329 INFO L130 PetriNetUnfolder]: 451/1209 cut-off events. [2022-11-02 20:35:57,330 INFO L131 PetriNetUnfolder]: For 40/111 co-relation queries the response was YES. [2022-11-02 20:35:57,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 1209 events. 451/1209 cut-off events. For 40/111 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5165 event pairs, 272 based on Foata normal form. 0/1047 useless extension candidates. Maximal degree in co-relation 1821. Up to 615 conditions per place. [2022-11-02 20:35:57,339 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 26 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2022-11-02 20:35:57,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 333 transitions, 734 flow [2022-11-02 20:35:57,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1043 transitions. [2022-11-02 20:35:57,344 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7525252525252525 [2022-11-02 20:35:57,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1043 transitions. [2022-11-02 20:35:57,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1043 transitions. [2022-11-02 20:35:57,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:57,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1043 transitions. [2022-11-02 20:35:57,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 347.6666666666667) internal successors, (1043), 3 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:57,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:57,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:57,353 INFO L175 Difference]: Start difference. First operand has 334 places, 334 transitions, 680 flow. Second operand 3 states and 1043 transitions. [2022-11-02 20:35:57,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 333 transitions, 734 flow [2022-11-02 20:35:57,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 333 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:57,360 INFO L231 Difference]: Finished difference. Result has 333 places, 333 transitions, 678 flow [2022-11-02 20:35:57,361 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=333, PETRI_TRANSITIONS=333} [2022-11-02 20:35:57,363 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -95 predicate places. [2022-11-02 20:35:57,364 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 333 transitions, 678 flow [2022-11-02 20:35:57,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:57,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:57,365 INFO L208 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] [2022-11-02 20:35:57,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:35:57,366 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:57,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:57,366 INFO L85 PathProgramCache]: Analyzing trace with hash -820878027, now seen corresponding path program 1 times [2022-11-02 20:35:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:57,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868623158] [2022-11-02 20:35:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:57,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:57,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:57,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868623158] [2022-11-02 20:35:57,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868623158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:57,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:57,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:57,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283502753] [2022-11-02 20:35:57,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:57,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:57,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:57,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:57,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:57,474 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 462 [2022-11-02 20:35:57,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 333 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:57,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:57,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 462 [2022-11-02 20:35:57,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:57,912 INFO L130 PetriNetUnfolder]: 451/1208 cut-off events. [2022-11-02 20:35:57,912 INFO L131 PetriNetUnfolder]: For 40/111 co-relation queries the response was YES. [2022-11-02 20:35:57,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 1208 events. 451/1208 cut-off events. For 40/111 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5191 event pairs, 272 based on Foata normal form. 0/1047 useless extension candidates. Maximal degree in co-relation 1813. Up to 615 conditions per place. [2022-11-02 20:35:57,922 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 26 selfloop transitions, 2 changer transitions 0/332 dead transitions. [2022-11-02 20:35:57,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 332 transitions, 732 flow [2022-11-02 20:35:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1043 transitions. [2022-11-02 20:35:57,926 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7525252525252525 [2022-11-02 20:35:57,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1043 transitions. [2022-11-02 20:35:57,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1043 transitions. [2022-11-02 20:35:57,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:57,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1043 transitions. [2022-11-02 20:35:57,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 347.6666666666667) internal successors, (1043), 3 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:57,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:57,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:57,936 INFO L175 Difference]: Start difference. First operand has 333 places, 333 transitions, 678 flow. Second operand 3 states and 1043 transitions. [2022-11-02 20:35:57,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 332 transitions, 732 flow [2022-11-02 20:35:57,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 332 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:57,971 INFO L231 Difference]: Finished difference. Result has 332 places, 332 transitions, 676 flow [2022-11-02 20:35:57,971 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=332, PETRI_TRANSITIONS=332} [2022-11-02 20:35:57,972 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -96 predicate places. [2022-11-02 20:35:57,972 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 332 transitions, 676 flow [2022-11-02 20:35:57,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:57,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:57,973 INFO L208 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] [2022-11-02 20:35:57,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:35:57,974 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1943045435, now seen corresponding path program 1 times [2022-11-02 20:35:57,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:57,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379652870] [2022-11-02 20:35:57,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:57,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:58,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:58,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379652870] [2022-11-02 20:35:58,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379652870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:58,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:58,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:58,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231715947] [2022-11-02 20:35:58,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:58,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:58,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:58,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:58,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:58,024 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 462 [2022-11-02 20:35:58,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 332 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:58,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:58,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 462 [2022-11-02 20:35:58,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:58,693 INFO L130 PetriNetUnfolder]: 595/1570 cut-off events. [2022-11-02 20:35:58,693 INFO L131 PetriNetUnfolder]: For 57/157 co-relation queries the response was YES. [2022-11-02 20:35:58,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 1570 events. 595/1570 cut-off events. For 57/157 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7657 event pairs, 171 based on Foata normal form. 0/1364 useless extension candidates. Maximal degree in co-relation 2368. Up to 436 conditions per place. [2022-11-02 20:35:58,708 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 37 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2022-11-02 20:35:58,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 346 transitions, 787 flow [2022-11-02 20:35:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1063 transitions. [2022-11-02 20:35:58,711 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.766955266955267 [2022-11-02 20:35:58,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1063 transitions. [2022-11-02 20:35:58,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1063 transitions. [2022-11-02 20:35:58,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:58,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1063 transitions. [2022-11-02 20:35:58,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 354.3333333333333) internal successors, (1063), 3 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:58,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:58,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:58,721 INFO L175 Difference]: Start difference. First operand has 332 places, 332 transitions, 676 flow. Second operand 3 states and 1063 transitions. [2022-11-02 20:35:58,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 346 transitions, 787 flow [2022-11-02 20:35:58,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 346 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:35:58,730 INFO L231 Difference]: Finished difference. Result has 332 places, 332 transitions, 680 flow [2022-11-02 20:35:58,731 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=332, PETRI_TRANSITIONS=332} [2022-11-02 20:35:58,734 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -96 predicate places. [2022-11-02 20:35:58,735 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 332 transitions, 680 flow [2022-11-02 20:35:58,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:58,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:58,737 INFO L208 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] [2022-11-02 20:35:58,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:35:58,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:58,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1570159548, now seen corresponding path program 1 times [2022-11-02 20:35:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:58,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886951533] [2022-11-02 20:35:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:58,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:58,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886951533] [2022-11-02 20:35:58,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886951533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:58,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:58,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107841028] [2022-11-02 20:35:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:58,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:58,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:58,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:58,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:58,844 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 462 [2022-11-02 20:35:58,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 332 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:58,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:58,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 462 [2022-11-02 20:35:58,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:35:59,378 INFO L130 PetriNetUnfolder]: 595/1557 cut-off events. [2022-11-02 20:35:59,378 INFO L131 PetriNetUnfolder]: For 153/253 co-relation queries the response was YES. [2022-11-02 20:35:59,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2564 conditions, 1557 events. 595/1557 cut-off events. For 153/253 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7767 event pairs, 375 based on Foata normal form. 0/1347 useless extension candidates. Maximal degree in co-relation 1265. Up to 808 conditions per place. [2022-11-02 20:35:59,393 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 24 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2022-11-02 20:35:59,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 331 transitions, 730 flow [2022-11-02 20:35:59,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:35:59,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:35:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2022-11-02 20:35:59,397 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7568542568542569 [2022-11-02 20:35:59,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1049 transitions. [2022-11-02 20:35:59,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1049 transitions. [2022-11-02 20:35:59,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:59,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1049 transitions. [2022-11-02 20:35:59,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.6666666666667) internal successors, (1049), 3 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:59,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:59,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:59,406 INFO L175 Difference]: Start difference. First operand has 332 places, 332 transitions, 680 flow. Second operand 3 states and 1049 transitions. [2022-11-02 20:35:59,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 331 transitions, 730 flow [2022-11-02 20:35:59,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 331 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:35:59,415 INFO L231 Difference]: Finished difference. Result has 332 places, 331 transitions, 680 flow [2022-11-02 20:35:59,416 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=332, PETRI_TRANSITIONS=331} [2022-11-02 20:35:59,418 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -96 predicate places. [2022-11-02 20:35:59,419 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 331 transitions, 680 flow [2022-11-02 20:35:59,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:59,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:35:59,421 INFO L208 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] [2022-11-02 20:35:59,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:35:59,421 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:35:59,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1031986706, now seen corresponding path program 1 times [2022-11-02 20:35:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:59,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112252898] [2022-11-02 20:35:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:59,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:35:59,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:59,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112252898] [2022-11-02 20:35:59,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112252898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:59,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:59,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:35:59,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412850490] [2022-11-02 20:35:59,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:59,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:35:59,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:59,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:35:59,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:35:59,499 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 462 [2022-11-02 20:35:59,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 331 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:35:59,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:35:59,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 462 [2022-11-02 20:35:59,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:00,011 INFO L130 PetriNetUnfolder]: 595/1556 cut-off events. [2022-11-02 20:36:00,011 INFO L131 PetriNetUnfolder]: For 152/252 co-relation queries the response was YES. [2022-11-02 20:36:00,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 1556 events. 595/1556 cut-off events. For 152/252 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7773 event pairs, 375 based on Foata normal form. 0/1347 useless extension candidates. Maximal degree in co-relation 2448. Up to 811 conditions per place. [2022-11-02 20:36:00,027 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 27 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2022-11-02 20:36:00,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 330 transitions, 736 flow [2022-11-02 20:36:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1043 transitions. [2022-11-02 20:36:00,031 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7525252525252525 [2022-11-02 20:36:00,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1043 transitions. [2022-11-02 20:36:00,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1043 transitions. [2022-11-02 20:36:00,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:00,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1043 transitions. [2022-11-02 20:36:00,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 347.6666666666667) internal successors, (1043), 3 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:00,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:00,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:00,040 INFO L175 Difference]: Start difference. First operand has 332 places, 331 transitions, 680 flow. Second operand 3 states and 1043 transitions. [2022-11-02 20:36:00,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 330 transitions, 736 flow [2022-11-02 20:36:00,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 330 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:00,047 INFO L231 Difference]: Finished difference. Result has 331 places, 330 transitions, 678 flow [2022-11-02 20:36:00,048 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=331, PETRI_TRANSITIONS=330} [2022-11-02 20:36:00,048 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -97 predicate places. [2022-11-02 20:36:00,049 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 330 transitions, 678 flow [2022-11-02 20:36:00,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:00,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:00,050 INFO L208 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] [2022-11-02 20:36:00,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:36:00,051 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 494912098, now seen corresponding path program 1 times [2022-11-02 20:36:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:00,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019077807] [2022-11-02 20:36:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:00,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:00,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019077807] [2022-11-02 20:36:00,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019077807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:00,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:00,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:00,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028243416] [2022-11-02 20:36:00,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:00,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:00,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:00,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:00,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:00,098 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 462 [2022-11-02 20:36:00,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 330 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:00,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:00,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 462 [2022-11-02 20:36:00,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:00,773 INFO L130 PetriNetUnfolder]: 749/2167 cut-off events. [2022-11-02 20:36:00,773 INFO L131 PetriNetUnfolder]: For 199/298 co-relation queries the response was YES. [2022-11-02 20:36:00,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 2167 events. 749/2167 cut-off events. For 199/298 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12632 event pairs, 280 based on Foata normal form. 0/1884 useless extension candidates. Maximal degree in co-relation 3283. Up to 544 conditions per place. [2022-11-02 20:36:00,793 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 38 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2022-11-02 20:36:00,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 344 transitions, 794 flow [2022-11-02 20:36:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2022-11-02 20:36:00,796 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7662337662337663 [2022-11-02 20:36:00,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1062 transitions. [2022-11-02 20:36:00,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1062 transitions. [2022-11-02 20:36:00,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:00,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1062 transitions. [2022-11-02 20:36:00,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:00,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:00,803 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:00,804 INFO L175 Difference]: Start difference. First operand has 331 places, 330 transitions, 678 flow. Second operand 3 states and 1062 transitions. [2022-11-02 20:36:00,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 344 transitions, 794 flow [2022-11-02 20:36:00,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 344 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:00,811 INFO L231 Difference]: Finished difference. Result has 331 places, 330 transitions, 682 flow [2022-11-02 20:36:00,811 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=331, PETRI_TRANSITIONS=330} [2022-11-02 20:36:00,812 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -97 predicate places. [2022-11-02 20:36:00,812 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 330 transitions, 682 flow [2022-11-02 20:36:00,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:00,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:00,813 INFO L208 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] [2022-11-02 20:36:00,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:36:00,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:00,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash -57108604, now seen corresponding path program 1 times [2022-11-02 20:36:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:00,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391800116] [2022-11-02 20:36:00,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:00,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:00,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391800116] [2022-11-02 20:36:00,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391800116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:00,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:00,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:00,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824321121] [2022-11-02 20:36:00,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:00,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:00,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:00,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:00,855 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 462 [2022-11-02 20:36:00,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 330 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:00,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:00,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 462 [2022-11-02 20:36:00,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:01,614 INFO L130 PetriNetUnfolder]: 749/1986 cut-off events. [2022-11-02 20:36:01,615 INFO L131 PetriNetUnfolder]: For 307/436 co-relation queries the response was YES. [2022-11-02 20:36:01,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3345 conditions, 1986 events. 749/1986 cut-off events. For 307/436 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11276 event pairs, 488 based on Foata normal form. 0/1714 useless extension candidates. Maximal degree in co-relation 1885. Up to 1018 conditions per place. [2022-11-02 20:36:01,637 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 25 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2022-11-02 20:36:01,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 329 transitions, 734 flow [2022-11-02 20:36:01,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2022-11-02 20:36:01,640 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7568542568542569 [2022-11-02 20:36:01,640 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1049 transitions. [2022-11-02 20:36:01,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1049 transitions. [2022-11-02 20:36:01,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:01,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1049 transitions. [2022-11-02 20:36:01,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.6666666666667) internal successors, (1049), 3 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:01,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:01,653 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:01,654 INFO L175 Difference]: Start difference. First operand has 331 places, 330 transitions, 682 flow. Second operand 3 states and 1049 transitions. [2022-11-02 20:36:01,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 329 transitions, 734 flow [2022-11-02 20:36:01,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 329 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:36:01,663 INFO L231 Difference]: Finished difference. Result has 331 places, 329 transitions, 682 flow [2022-11-02 20:36:01,664 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=331, PETRI_TRANSITIONS=329} [2022-11-02 20:36:01,665 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -97 predicate places. [2022-11-02 20:36:01,665 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 329 transitions, 682 flow [2022-11-02 20:36:01,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:01,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:01,666 INFO L208 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] [2022-11-02 20:36:01,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:36:01,666 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:01,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:01,667 INFO L85 PathProgramCache]: Analyzing trace with hash -513445290, now seen corresponding path program 1 times [2022-11-02 20:36:01,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:01,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647719824] [2022-11-02 20:36:01,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:01,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:01,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647719824] [2022-11-02 20:36:01,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647719824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:01,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:01,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327483200] [2022-11-02 20:36:01,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:01,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:01,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:01,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:01,715 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 462 [2022-11-02 20:36:01,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 329 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:01,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:01,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 462 [2022-11-02 20:36:01,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:02,349 INFO L130 PetriNetUnfolder]: 749/1985 cut-off events. [2022-11-02 20:36:02,349 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:36:02,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3291 conditions, 1985 events. 749/1985 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11382 event pairs, 488 based on Foata normal form. 0/1714 useless extension candidates. Maximal degree in co-relation 3202. Up to 1016 conditions per place. [2022-11-02 20:36:02,365 INFO L137 encePairwiseOnDemand]: 460/462 looper letters, 25 selfloop transitions, 1 changer transitions 0/328 dead transitions. [2022-11-02 20:36:02,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 328 transitions, 732 flow [2022-11-02 20:36:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2022-11-02 20:36:02,370 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7561327561327561 [2022-11-02 20:36:02,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2022-11-02 20:36:02,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2022-11-02 20:36:02,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:02,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2022-11-02 20:36:02,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:02,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:02,394 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:02,395 INFO L175 Difference]: Start difference. First operand has 331 places, 329 transitions, 682 flow. Second operand 3 states and 1048 transitions. [2022-11-02 20:36:02,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 328 transitions, 732 flow [2022-11-02 20:36:02,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 328 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:02,401 INFO L231 Difference]: Finished difference. Result has 330 places, 328 transitions, 678 flow [2022-11-02 20:36:02,402 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=330, PETRI_TRANSITIONS=328} [2022-11-02 20:36:02,403 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -98 predicate places. [2022-11-02 20:36:02,403 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 328 transitions, 678 flow [2022-11-02 20:36:02,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:02,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:02,404 INFO L208 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] [2022-11-02 20:36:02,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:36:02,405 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:02,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:02,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1038828729, now seen corresponding path program 1 times [2022-11-02 20:36:02,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:02,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974165498] [2022-11-02 20:36:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:02,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:02,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:02,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974165498] [2022-11-02 20:36:02,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974165498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:02,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:02,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:02,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554050297] [2022-11-02 20:36:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:02,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:02,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:02,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:02,484 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 462 [2022-11-02 20:36:02,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 328 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:02,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:02,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 462 [2022-11-02 20:36:02,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:03,117 INFO L130 PetriNetUnfolder]: 749/1984 cut-off events. [2022-11-02 20:36:03,117 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:36:03,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 1984 events. 749/1984 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11370 event pairs, 488 based on Foata normal form. 0/1714 useless extension candidates. Maximal degree in co-relation 3202. Up to 1018 conditions per place. [2022-11-02 20:36:03,135 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 25 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2022-11-02 20:36:03,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 327 transitions, 730 flow [2022-11-02 20:36:03,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2022-11-02 20:36:03,140 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7568542568542569 [2022-11-02 20:36:03,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1049 transitions. [2022-11-02 20:36:03,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1049 transitions. [2022-11-02 20:36:03,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:03,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1049 transitions. [2022-11-02 20:36:03,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.6666666666667) internal successors, (1049), 3 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:03,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:03,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:03,147 INFO L175 Difference]: Start difference. First operand has 330 places, 328 transitions, 678 flow. Second operand 3 states and 1049 transitions. [2022-11-02 20:36:03,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 327 transitions, 730 flow [2022-11-02 20:36:03,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 327 transitions, 729 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:36:03,154 INFO L231 Difference]: Finished difference. Result has 330 places, 327 transitions, 679 flow [2022-11-02 20:36:03,154 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=330, PETRI_TRANSITIONS=327} [2022-11-02 20:36:03,155 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -98 predicate places. [2022-11-02 20:36:03,155 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 327 transitions, 679 flow [2022-11-02 20:36:03,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:03,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:03,156 INFO L208 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] [2022-11-02 20:36:03,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:36:03,156 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:03,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1629040318, now seen corresponding path program 1 times [2022-11-02 20:36:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:03,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820172528] [2022-11-02 20:36:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:03,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:03,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820172528] [2022-11-02 20:36:03,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820172528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:03,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:03,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:03,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619651325] [2022-11-02 20:36:03,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:03,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:03,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:03,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:03,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:03,638 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 462 [2022-11-02 20:36:03,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 327 transitions, 679 flow. Second operand has 6 states, 6 states have (on average 273.8333333333333) internal successors, (1643), 6 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:03,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:03,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 462 [2022-11-02 20:36:03,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:06,655 INFO L130 PetriNetUnfolder]: 5309/8139 cut-off events. [2022-11-02 20:36:06,655 INFO L131 PetriNetUnfolder]: For 1502/1502 co-relation queries the response was YES. [2022-11-02 20:36:06,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16618 conditions, 8139 events. 5309/8139 cut-off events. For 1502/1502 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 41547 event pairs, 3740 based on Foata normal form. 0/7652 useless extension candidates. Maximal degree in co-relation 16531. Up to 6904 conditions per place. [2022-11-02 20:36:06,713 INFO L137 encePairwiseOnDemand]: 444/462 looper letters, 79 selfloop transitions, 15 changer transitions 0/324 dead transitions. [2022-11-02 20:36:06,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 324 transitions, 861 flow [2022-11-02 20:36:06,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:36:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1727 transitions. [2022-11-02 20:36:06,719 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.623015873015873 [2022-11-02 20:36:06,719 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1727 transitions. [2022-11-02 20:36:06,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1727 transitions. [2022-11-02 20:36:06,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:06,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1727 transitions. [2022-11-02 20:36:06,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 287.8333333333333) internal successors, (1727), 6 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:06,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:06,732 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:06,732 INFO L175 Difference]: Start difference. First operand has 330 places, 327 transitions, 679 flow. Second operand 6 states and 1727 transitions. [2022-11-02 20:36:06,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 324 transitions, 861 flow [2022-11-02 20:36:06,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 324 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:06,740 INFO L231 Difference]: Finished difference. Result has 330 places, 324 transitions, 699 flow [2022-11-02 20:36:06,740 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=699, PETRI_PLACES=330, PETRI_TRANSITIONS=324} [2022-11-02 20:36:06,741 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -98 predicate places. [2022-11-02 20:36:06,741 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 324 transitions, 699 flow [2022-11-02 20:36:06,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.8333333333333) internal successors, (1643), 6 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:06,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:06,743 INFO L208 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] [2022-11-02 20:36:06,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:36:06,743 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:06,744 INFO L85 PathProgramCache]: Analyzing trace with hash -354191309, now seen corresponding path program 1 times [2022-11-02 20:36:06,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:06,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719985073] [2022-11-02 20:36:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:06,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:06,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:06,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719985073] [2022-11-02 20:36:06,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719985073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:06,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:06,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556230622] [2022-11-02 20:36:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:06,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:06,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:06,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:06,808 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 462 [2022-11-02 20:36:06,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 324 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:06,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:06,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 462 [2022-11-02 20:36:06,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:07,467 INFO L130 PetriNetUnfolder]: 749/1980 cut-off events. [2022-11-02 20:36:07,467 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:36:07,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3300 conditions, 1980 events. 749/1980 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11307 event pairs, 488 based on Foata normal form. 0/1714 useless extension candidates. Maximal degree in co-relation 3250. Up to 1016 conditions per place. [2022-11-02 20:36:07,484 INFO L137 encePairwiseOnDemand]: 460/462 looper letters, 25 selfloop transitions, 1 changer transitions 0/323 dead transitions. [2022-11-02 20:36:07,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 323 transitions, 749 flow [2022-11-02 20:36:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2022-11-02 20:36:07,488 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7561327561327561 [2022-11-02 20:36:07,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2022-11-02 20:36:07,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2022-11-02 20:36:07,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:07,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2022-11-02 20:36:07,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:07,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:07,495 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:07,496 INFO L175 Difference]: Start difference. First operand has 330 places, 324 transitions, 699 flow. Second operand 3 states and 1048 transitions. [2022-11-02 20:36:07,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 323 transitions, 749 flow [2022-11-02 20:36:07,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 323 transitions, 719 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:36:07,502 INFO L231 Difference]: Finished difference. Result has 326 places, 323 transitions, 669 flow [2022-11-02 20:36:07,503 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=326, PETRI_TRANSITIONS=323} [2022-11-02 20:36:07,503 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -102 predicate places. [2022-11-02 20:36:07,504 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 323 transitions, 669 flow [2022-11-02 20:36:07,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:07,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:07,505 INFO L208 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] [2022-11-02 20:36:07,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:36:07,505 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:07,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2107351673, now seen corresponding path program 1 times [2022-11-02 20:36:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:07,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676803255] [2022-11-02 20:36:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:07,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:07,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676803255] [2022-11-02 20:36:07,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676803255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:07,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:07,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887714454] [2022-11-02 20:36:07,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:07,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:07,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:07,562 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 462 [2022-11-02 20:36:07,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 323 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:07,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:07,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 462 [2022-11-02 20:36:07,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:08,165 INFO L130 PetriNetUnfolder]: 749/1979 cut-off events. [2022-11-02 20:36:08,165 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:36:08,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3286 conditions, 1979 events. 749/1979 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11306 event pairs, 488 based on Foata normal form. 0/1714 useless extension candidates. Maximal degree in co-relation 3198. Up to 1018 conditions per place. [2022-11-02 20:36:08,186 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 25 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2022-11-02 20:36:08,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 322 transitions, 721 flow [2022-11-02 20:36:08,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2022-11-02 20:36:08,190 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7568542568542569 [2022-11-02 20:36:08,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1049 transitions. [2022-11-02 20:36:08,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1049 transitions. [2022-11-02 20:36:08,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:08,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1049 transitions. [2022-11-02 20:36:08,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.6666666666667) internal successors, (1049), 3 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:08,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:08,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:08,198 INFO L175 Difference]: Start difference. First operand has 326 places, 323 transitions, 669 flow. Second operand 3 states and 1049 transitions. [2022-11-02 20:36:08,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 322 transitions, 721 flow [2022-11-02 20:36:08,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 322 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:36:08,207 INFO L231 Difference]: Finished difference. Result has 326 places, 322 transitions, 670 flow [2022-11-02 20:36:08,208 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=326, PETRI_TRANSITIONS=322} [2022-11-02 20:36:08,209 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -102 predicate places. [2022-11-02 20:36:08,209 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 322 transitions, 670 flow [2022-11-02 20:36:08,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:08,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:08,210 INFO L208 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] [2022-11-02 20:36:08,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:36:08,211 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:08,211 INFO L85 PathProgramCache]: Analyzing trace with hash 763138446, now seen corresponding path program 1 times [2022-11-02 20:36:08,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:08,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140254809] [2022-11-02 20:36:08,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:08,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:08,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:08,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140254809] [2022-11-02 20:36:08,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140254809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:08,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:08,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:08,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206026392] [2022-11-02 20:36:08,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:08,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:08,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:08,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:08,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:08,286 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 462 [2022-11-02 20:36:08,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 322 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:08,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:08,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 462 [2022-11-02 20:36:08,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:09,009 INFO L130 PetriNetUnfolder]: 749/1977 cut-off events. [2022-11-02 20:36:09,009 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:36:09,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3287 conditions, 1977 events. 749/1977 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11315 event pairs, 488 based on Foata normal form. 0/1714 useless extension candidates. Maximal degree in co-relation 3198. Up to 1018 conditions per place. [2022-11-02 20:36:09,026 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 27 selfloop transitions, 1 changer transitions 0/320 dead transitions. [2022-11-02 20:36:09,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 320 transitions, 722 flow [2022-11-02 20:36:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1042 transitions. [2022-11-02 20:36:09,030 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7518037518037518 [2022-11-02 20:36:09,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1042 transitions. [2022-11-02 20:36:09,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1042 transitions. [2022-11-02 20:36:09,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:09,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1042 transitions. [2022-11-02 20:36:09,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 347.3333333333333) internal successors, (1042), 3 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:09,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:09,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:09,039 INFO L175 Difference]: Start difference. First operand has 326 places, 322 transitions, 670 flow. Second operand 3 states and 1042 transitions. [2022-11-02 20:36:09,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 320 transitions, 722 flow [2022-11-02 20:36:09,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 320 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:09,047 INFO L231 Difference]: Finished difference. Result has 324 places, 320 transitions, 664 flow [2022-11-02 20:36:09,059 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=324, PETRI_TRANSITIONS=320} [2022-11-02 20:36:09,059 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -104 predicate places. [2022-11-02 20:36:09,059 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 320 transitions, 664 flow [2022-11-02 20:36:09,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:09,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:09,060 INFO L208 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] [2022-11-02 20:36:09,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:36:09,061 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:09,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:09,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1838561785, now seen corresponding path program 1 times [2022-11-02 20:36:09,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:09,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000326168] [2022-11-02 20:36:09,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:09,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:09,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000326168] [2022-11-02 20:36:09,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000326168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:09,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:09,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25446269] [2022-11-02 20:36:09,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:09,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:09,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:09,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:09,161 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 462 [2022-11-02 20:36:09,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 320 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:09,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:09,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 462 [2022-11-02 20:36:09,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:09,868 INFO L130 PetriNetUnfolder]: 749/1976 cut-off events. [2022-11-02 20:36:09,869 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:36:09,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 1976 events. 749/1976 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11293 event pairs, 488 based on Foata normal form. 0/1714 useless extension candidates. Maximal degree in co-relation 3196. Up to 1018 conditions per place. [2022-11-02 20:36:09,883 INFO L137 encePairwiseOnDemand]: 459/462 looper letters, 25 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2022-11-02 20:36:09,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 319 transitions, 716 flow [2022-11-02 20:36:09,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2022-11-02 20:36:09,886 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7568542568542569 [2022-11-02 20:36:09,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1049 transitions. [2022-11-02 20:36:09,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1049 transitions. [2022-11-02 20:36:09,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:09,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1049 transitions. [2022-11-02 20:36:09,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.6666666666667) internal successors, (1049), 3 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:09,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:09,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:09,893 INFO L175 Difference]: Start difference. First operand has 324 places, 320 transitions, 664 flow. Second operand 3 states and 1049 transitions. [2022-11-02 20:36:09,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 319 transitions, 716 flow [2022-11-02 20:36:09,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 319 transitions, 715 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:36:09,900 INFO L231 Difference]: Finished difference. Result has 324 places, 319 transitions, 665 flow [2022-11-02 20:36:09,900 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=665, PETRI_PLACES=324, PETRI_TRANSITIONS=319} [2022-11-02 20:36:09,901 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -104 predicate places. [2022-11-02 20:36:09,901 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 319 transitions, 665 flow [2022-11-02 20:36:09,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:09,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:09,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:09,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:36:09,902 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:09,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2016945814, now seen corresponding path program 1 times [2022-11-02 20:36:09,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:09,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567877840] [2022-11-02 20:36:09,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:09,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:10,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:10,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567877840] [2022-11-02 20:36:10,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567877840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:10,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:10,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967802916] [2022-11-02 20:36:10,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:10,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:10,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:10,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:10,678 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 462 [2022-11-02 20:36:10,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 319 transitions, 665 flow. Second operand has 6 states, 6 states have (on average 301.1666666666667) internal successors, (1807), 6 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:10,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:10,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 462 [2022-11-02 20:36:10,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:13,618 INFO L130 PetriNetUnfolder]: 5309/8133 cut-off events. [2022-11-02 20:36:13,618 INFO L131 PetriNetUnfolder]: For 1502/1502 co-relation queries the response was YES. [2022-11-02 20:36:13,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16584 conditions, 8133 events. 5309/8133 cut-off events. For 1502/1502 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 41317 event pairs, 762 based on Foata normal form. 0/7802 useless extension candidates. Maximal degree in co-relation 16495. Up to 3236 conditions per place. [2022-11-02 20:36:13,691 INFO L137 encePairwiseOnDemand]: 457/462 looper letters, 116 selfloop transitions, 4 changer transitions 0/374 dead transitions. [2022-11-02 20:36:13,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 374 transitions, 1047 flow [2022-11-02 20:36:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:13,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:36:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1905 transitions. [2022-11-02 20:36:13,697 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6872294372294372 [2022-11-02 20:36:13,697 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1905 transitions. [2022-11-02 20:36:13,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1905 transitions. [2022-11-02 20:36:13,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:13,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1905 transitions. [2022-11-02 20:36:13,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 317.5) internal successors, (1905), 6 states have internal predecessors, (1905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:13,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:13,711 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:13,711 INFO L175 Difference]: Start difference. First operand has 324 places, 319 transitions, 665 flow. Second operand 6 states and 1905 transitions. [2022-11-02 20:36:13,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 374 transitions, 1047 flow [2022-11-02 20:36:13,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 374 transitions, 1043 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:36:13,720 INFO L231 Difference]: Finished difference. Result has 326 places, 318 transitions, 667 flow [2022-11-02 20:36:13,720 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=667, PETRI_PLACES=326, PETRI_TRANSITIONS=318} [2022-11-02 20:36:13,721 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -102 predicate places. [2022-11-02 20:36:13,721 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 318 transitions, 667 flow [2022-11-02 20:36:13,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.1666666666667) internal successors, (1807), 6 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:13,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:13,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:13,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:36:13,722 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:13,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:13,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2024857427, now seen corresponding path program 1 times [2022-11-02 20:36:13,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:13,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342481914] [2022-11-02 20:36:13,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:13,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:14,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:14,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342481914] [2022-11-02 20:36:14,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342481914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:14,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:14,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:14,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349310587] [2022-11-02 20:36:14,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:14,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:14,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:14,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:14,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:14,656 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 462 [2022-11-02 20:36:14,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 318 transitions, 667 flow. Second operand has 6 states, 6 states have (on average 302.3333333333333) internal successors, (1814), 6 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:14,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:14,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 462 [2022-11-02 20:36:14,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:17,418 INFO L130 PetriNetUnfolder]: 4736/7385 cut-off events. [2022-11-02 20:36:17,419 INFO L131 PetriNetUnfolder]: For 1643/1643 co-relation queries the response was YES. [2022-11-02 20:36:17,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15551 conditions, 7385 events. 4736/7385 cut-off events. For 1643/1643 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 37530 event pairs, 2604 based on Foata normal form. 0/7084 useless extension candidates. Maximal degree in co-relation 15462. Up to 4762 conditions per place. [2022-11-02 20:36:17,476 INFO L137 encePairwiseOnDemand]: 457/462 looper letters, 103 selfloop transitions, 4 changer transitions 0/361 dead transitions. [2022-11-02 20:36:17,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 361 transitions, 999 flow [2022-11-02 20:36:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:36:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1892 transitions. [2022-11-02 20:36:17,483 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2022-11-02 20:36:17,483 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1892 transitions. [2022-11-02 20:36:17,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1892 transitions. [2022-11-02 20:36:17,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:17,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1892 transitions. [2022-11-02 20:36:17,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 315.3333333333333) internal successors, (1892), 6 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:17,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:17,495 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:17,495 INFO L175 Difference]: Start difference. First operand has 326 places, 318 transitions, 667 flow. Second operand 6 states and 1892 transitions. [2022-11-02 20:36:17,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 361 transitions, 999 flow [2022-11-02 20:36:17,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 361 transitions, 992 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:36:17,504 INFO L231 Difference]: Finished difference. Result has 326 places, 317 transitions, 666 flow [2022-11-02 20:36:17,505 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=666, PETRI_PLACES=326, PETRI_TRANSITIONS=317} [2022-11-02 20:36:17,505 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -102 predicate places. [2022-11-02 20:36:17,505 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 317 transitions, 666 flow [2022-11-02 20:36:17,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 302.3333333333333) internal successors, (1814), 6 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:17,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:17,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:17,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:36:17,507 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:17,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1596694574, now seen corresponding path program 1 times [2022-11-02 20:36:17,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:17,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998584276] [2022-11-02 20:36:17,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:18,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998584276] [2022-11-02 20:36:18,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998584276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:18,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:18,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:18,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083796455] [2022-11-02 20:36:18,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:18,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:18,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:18,556 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 462 [2022-11-02 20:36:18,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 317 transitions, 666 flow. Second operand has 6 states, 6 states have (on average 303.5) internal successors, (1821), 6 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:18,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:18,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 462 [2022-11-02 20:36:18,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:21,291 INFO L130 PetriNetUnfolder]: 4607/7264 cut-off events. [2022-11-02 20:36:21,292 INFO L131 PetriNetUnfolder]: For 1358/1358 co-relation queries the response was YES. [2022-11-02 20:36:21,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14971 conditions, 7264 events. 4607/7264 cut-off events. For 1358/1358 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 37259 event pairs, 3078 based on Foata normal form. 0/6974 useless extension candidates. Maximal degree in co-relation 14882. Up to 5647 conditions per place. [2022-11-02 20:36:21,349 INFO L137 encePairwiseOnDemand]: 457/462 looper letters, 90 selfloop transitions, 4 changer transitions 0/348 dead transitions. [2022-11-02 20:36:21,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 348 transitions, 948 flow [2022-11-02 20:36:21,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:36:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1879 transitions. [2022-11-02 20:36:21,354 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6778499278499278 [2022-11-02 20:36:21,355 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1879 transitions. [2022-11-02 20:36:21,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1879 transitions. [2022-11-02 20:36:21,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:21,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1879 transitions. [2022-11-02 20:36:21,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 313.1666666666667) internal successors, (1879), 6 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:21,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:21,366 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:21,367 INFO L175 Difference]: Start difference. First operand has 326 places, 317 transitions, 666 flow. Second operand 6 states and 1879 transitions. [2022-11-02 20:36:21,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 348 transitions, 948 flow [2022-11-02 20:36:21,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 348 transitions, 941 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:36:21,376 INFO L231 Difference]: Finished difference. Result has 326 places, 316 transitions, 665 flow [2022-11-02 20:36:21,376 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=665, PETRI_PLACES=326, PETRI_TRANSITIONS=316} [2022-11-02 20:36:21,377 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -102 predicate places. [2022-11-02 20:36:21,377 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 316 transitions, 665 flow [2022-11-02 20:36:21,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 303.5) internal successors, (1821), 6 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:21,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:21,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:21,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:36:21,379 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:21,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:21,379 INFO L85 PathProgramCache]: Analyzing trace with hash 642588474, now seen corresponding path program 1 times [2022-11-02 20:36:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:21,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986302905] [2022-11-02 20:36:21,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:21,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:22,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:22,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986302905] [2022-11-02 20:36:22,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986302905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:22,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:22,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:36:22,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557473586] [2022-11-02 20:36:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:22,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:36:22,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:22,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:36:22,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:36:22,203 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 462 [2022-11-02 20:36:22,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 316 transitions, 665 flow. Second operand has 6 states, 6 states have (on average 304.6666666666667) internal successors, (1828), 6 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:22,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:22,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 462 [2022-11-02 20:36:22,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:24,825 INFO L130 PetriNetUnfolder]: 4665/7326 cut-off events. [2022-11-02 20:36:24,825 INFO L131 PetriNetUnfolder]: For 1328/1328 co-relation queries the response was YES. [2022-11-02 20:36:24,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15024 conditions, 7326 events. 4665/7326 cut-off events. For 1328/1328 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 37416 event pairs, 3249 based on Foata normal form. 0/7069 useless extension candidates. Maximal degree in co-relation 14935. Up to 5988 conditions per place. [2022-11-02 20:36:24,872 INFO L137 encePairwiseOnDemand]: 457/462 looper letters, 73 selfloop transitions, 4 changer transitions 0/331 dead transitions. [2022-11-02 20:36:24,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 331 transitions, 865 flow [2022-11-02 20:36:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:36:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:36:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1866 transitions. [2022-11-02 20:36:24,877 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6731601731601732 [2022-11-02 20:36:24,878 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1866 transitions. [2022-11-02 20:36:24,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1866 transitions. [2022-11-02 20:36:24,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:24,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1866 transitions. [2022-11-02 20:36:24,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 311.0) internal successors, (1866), 6 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:24,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:24,889 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 462.0) internal successors, (3234), 7 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:24,889 INFO L175 Difference]: Start difference. First operand has 326 places, 316 transitions, 665 flow. Second operand 6 states and 1866 transitions. [2022-11-02 20:36:24,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 331 transitions, 865 flow [2022-11-02 20:36:24,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 331 transitions, 858 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:36:24,897 INFO L231 Difference]: Finished difference. Result has 326 places, 315 transitions, 664 flow [2022-11-02 20:36:24,898 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=664, PETRI_PLACES=326, PETRI_TRANSITIONS=315} [2022-11-02 20:36:24,898 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -102 predicate places. [2022-11-02 20:36:24,898 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 315 transitions, 664 flow [2022-11-02 20:36:24,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.6666666666667) internal successors, (1828), 6 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:24,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:36:24,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:36:24,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:36:24,900 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2022-11-02 20:36:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:36:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash 434215497, now seen corresponding path program 1 times [2022-11-02 20:36:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:36:24,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606554378] [2022-11-02 20:36:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:36:24,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:36:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:36:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:36:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:36:25,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606554378] [2022-11-02 20:36:25,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606554378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:36:25,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:36:25,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:36:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163545332] [2022-11-02 20:36:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:36:25,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:36:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:36:25,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:36:25,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:36:25,026 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 344 out of 462 [2022-11-02 20:36:25,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 315 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 348.6666666666667) internal successors, (1046), 3 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:25,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:36:25,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 344 of 462 [2022-11-02 20:36:25,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:36:25,666 INFO L130 PetriNetUnfolder]: 749/1967 cut-off events. [2022-11-02 20:36:25,666 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:36:25,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3285 conditions, 1967 events. 749/1967 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11255 event pairs, 488 based on Foata normal form. 4/1714 useless extension candidates. Maximal degree in co-relation 3242. Up to 1015 conditions per place. [2022-11-02 20:36:25,672 INFO L137 encePairwiseOnDemand]: 460/462 looper letters, 0 selfloop transitions, 0 changer transitions 314/314 dead transitions. [2022-11-02 20:36:25,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 314 transitions, 708 flow [2022-11-02 20:36:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:36:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:36:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1054 transitions. [2022-11-02 20:36:25,675 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7604617604617605 [2022-11-02 20:36:25,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1054 transitions. [2022-11-02 20:36:25,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1054 transitions. [2022-11-02 20:36:25,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:36:25,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1054 transitions. [2022-11-02 20:36:25,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 351.3333333333333) internal successors, (1054), 3 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:25,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:25,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 462.0) internal successors, (1848), 4 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:25,682 INFO L175 Difference]: Start difference. First operand has 326 places, 315 transitions, 664 flow. Second operand 3 states and 1054 transitions. [2022-11-02 20:36:25,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 314 transitions, 708 flow [2022-11-02 20:36:25,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 314 transitions, 701 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:36:25,686 INFO L231 Difference]: Finished difference. Result has 323 places, 0 transitions, 0 flow [2022-11-02 20:36:25,687 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=462, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=323, PETRI_TRANSITIONS=0} [2022-11-02 20:36:25,687 INFO L287 CegarLoopForPetriNet]: 428 programPoint places, -105 predicate places. [2022-11-02 20:36:25,687 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 0 transitions, 0 flow [2022-11-02 20:36:25,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.6666666666667) internal successors, (1046), 3 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:36:25,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (185 of 186 remaining) [2022-11-02 20:36:25,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (184 of 186 remaining) [2022-11-02 20:36:25,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (183 of 186 remaining) [2022-11-02 20:36:25,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (182 of 186 remaining) [2022-11-02 20:36:25,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (181 of 186 remaining) [2022-11-02 20:36:25,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (180 of 186 remaining) [2022-11-02 20:36:25,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (179 of 186 remaining) [2022-11-02 20:36:25,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (178 of 186 remaining) [2022-11-02 20:36:25,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (177 of 186 remaining) [2022-11-02 20:36:25,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (176 of 186 remaining) [2022-11-02 20:36:25,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (175 of 186 remaining) [2022-11-02 20:36:25,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (174 of 186 remaining) [2022-11-02 20:36:25,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (173 of 186 remaining) [2022-11-02 20:36:25,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (172 of 186 remaining) [2022-11-02 20:36:25,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (171 of 186 remaining) [2022-11-02 20:36:25,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (170 of 186 remaining) [2022-11-02 20:36:25,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (169 of 186 remaining) [2022-11-02 20:36:25,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (168 of 186 remaining) [2022-11-02 20:36:25,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (167 of 186 remaining) [2022-11-02 20:36:25,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (166 of 186 remaining) [2022-11-02 20:36:25,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (165 of 186 remaining) [2022-11-02 20:36:25,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (164 of 186 remaining) [2022-11-02 20:36:25,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (163 of 186 remaining) [2022-11-02 20:36:25,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (162 of 186 remaining) [2022-11-02 20:36:25,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (161 of 186 remaining) [2022-11-02 20:36:25,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (160 of 186 remaining) [2022-11-02 20:36:25,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (159 of 186 remaining) [2022-11-02 20:36:25,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (158 of 186 remaining) [2022-11-02 20:36:25,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (157 of 186 remaining) [2022-11-02 20:36:25,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (156 of 186 remaining) [2022-11-02 20:36:25,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (155 of 186 remaining) [2022-11-02 20:36:25,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (154 of 186 remaining) [2022-11-02 20:36:25,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (153 of 186 remaining) [2022-11-02 20:36:25,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (152 of 186 remaining) [2022-11-02 20:36:25,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (151 of 186 remaining) [2022-11-02 20:36:25,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (150 of 186 remaining) [2022-11-02 20:36:25,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (149 of 186 remaining) [2022-11-02 20:36:25,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (148 of 186 remaining) [2022-11-02 20:36:25,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (147 of 186 remaining) [2022-11-02 20:36:25,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (146 of 186 remaining) [2022-11-02 20:36:25,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (145 of 186 remaining) [2022-11-02 20:36:25,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (144 of 186 remaining) [2022-11-02 20:36:25,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (143 of 186 remaining) [2022-11-02 20:36:25,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (142 of 186 remaining) [2022-11-02 20:36:25,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (141 of 186 remaining) [2022-11-02 20:36:25,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (140 of 186 remaining) [2022-11-02 20:36:25,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (139 of 186 remaining) [2022-11-02 20:36:25,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (138 of 186 remaining) [2022-11-02 20:36:25,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (137 of 186 remaining) [2022-11-02 20:36:25,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (136 of 186 remaining) [2022-11-02 20:36:25,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (135 of 186 remaining) [2022-11-02 20:36:25,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (134 of 186 remaining) [2022-11-02 20:36:25,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (133 of 186 remaining) [2022-11-02 20:36:25,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (132 of 186 remaining) [2022-11-02 20:36:25,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (131 of 186 remaining) [2022-11-02 20:36:25,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (130 of 186 remaining) [2022-11-02 20:36:25,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (129 of 186 remaining) [2022-11-02 20:36:25,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (128 of 186 remaining) [2022-11-02 20:36:25,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (127 of 186 remaining) [2022-11-02 20:36:25,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (126 of 186 remaining) [2022-11-02 20:36:25,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (125 of 186 remaining) [2022-11-02 20:36:25,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (124 of 186 remaining) [2022-11-02 20:36:25,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (123 of 186 remaining) [2022-11-02 20:36:25,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (122 of 186 remaining) [2022-11-02 20:36:25,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (121 of 186 remaining) [2022-11-02 20:36:25,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (120 of 186 remaining) [2022-11-02 20:36:25,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (119 of 186 remaining) [2022-11-02 20:36:25,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (118 of 186 remaining) [2022-11-02 20:36:25,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (117 of 186 remaining) [2022-11-02 20:36:25,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (116 of 186 remaining) [2022-11-02 20:36:25,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (115 of 186 remaining) [2022-11-02 20:36:25,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (114 of 186 remaining) [2022-11-02 20:36:25,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (113 of 186 remaining) [2022-11-02 20:36:25,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (112 of 186 remaining) [2022-11-02 20:36:25,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (111 of 186 remaining) [2022-11-02 20:36:25,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (110 of 186 remaining) [2022-11-02 20:36:25,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (109 of 186 remaining) [2022-11-02 20:36:25,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (108 of 186 remaining) [2022-11-02 20:36:25,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (107 of 186 remaining) [2022-11-02 20:36:25,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (106 of 186 remaining) [2022-11-02 20:36:25,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (105 of 186 remaining) [2022-11-02 20:36:25,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (104 of 186 remaining) [2022-11-02 20:36:25,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (103 of 186 remaining) [2022-11-02 20:36:25,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 186 remaining) [2022-11-02 20:36:25,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 186 remaining) [2022-11-02 20:36:25,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 186 remaining) [2022-11-02 20:36:25,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 186 remaining) [2022-11-02 20:36:25,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (98 of 186 remaining) [2022-11-02 20:36:25,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (97 of 186 remaining) [2022-11-02 20:36:25,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (96 of 186 remaining) [2022-11-02 20:36:25,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (95 of 186 remaining) [2022-11-02 20:36:25,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (94 of 186 remaining) [2022-11-02 20:36:25,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (93 of 186 remaining) [2022-11-02 20:36:25,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (92 of 186 remaining) [2022-11-02 20:36:25,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (91 of 186 remaining) [2022-11-02 20:36:25,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (90 of 186 remaining) [2022-11-02 20:36:25,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (89 of 186 remaining) [2022-11-02 20:36:25,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (88 of 186 remaining) [2022-11-02 20:36:25,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (87 of 186 remaining) [2022-11-02 20:36:25,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (86 of 186 remaining) [2022-11-02 20:36:25,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (85 of 186 remaining) [2022-11-02 20:36:25,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (84 of 186 remaining) [2022-11-02 20:36:25,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (83 of 186 remaining) [2022-11-02 20:36:25,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (82 of 186 remaining) [2022-11-02 20:36:25,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (81 of 186 remaining) [2022-11-02 20:36:25,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (80 of 186 remaining) [2022-11-02 20:36:25,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (79 of 186 remaining) [2022-11-02 20:36:25,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (78 of 186 remaining) [2022-11-02 20:36:25,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (77 of 186 remaining) [2022-11-02 20:36:25,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 186 remaining) [2022-11-02 20:36:25,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 186 remaining) [2022-11-02 20:36:25,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 186 remaining) [2022-11-02 20:36:25,713 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 186 remaining) [2022-11-02 20:36:25,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 186 remaining) [2022-11-02 20:36:25,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 186 remaining) [2022-11-02 20:36:25,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 186 remaining) [2022-11-02 20:36:25,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 186 remaining) [2022-11-02 20:36:25,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (68 of 186 remaining) [2022-11-02 20:36:25,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (67 of 186 remaining) [2022-11-02 20:36:25,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (66 of 186 remaining) [2022-11-02 20:36:25,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (65 of 186 remaining) [2022-11-02 20:36:25,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 186 remaining) [2022-11-02 20:36:25,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 186 remaining) [2022-11-02 20:36:25,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 186 remaining) [2022-11-02 20:36:25,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 186 remaining) [2022-11-02 20:36:25,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (60 of 186 remaining) [2022-11-02 20:36:25,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (59 of 186 remaining) [2022-11-02 20:36:25,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (58 of 186 remaining) [2022-11-02 20:36:25,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 186 remaining) [2022-11-02 20:36:25,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 186 remaining) [2022-11-02 20:36:25,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 186 remaining) [2022-11-02 20:36:25,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 186 remaining) [2022-11-02 20:36:25,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 186 remaining) [2022-11-02 20:36:25,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 186 remaining) [2022-11-02 20:36:25,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (51 of 186 remaining) [2022-11-02 20:36:25,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 186 remaining) [2022-11-02 20:36:25,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (49 of 186 remaining) [2022-11-02 20:36:25,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 186 remaining) [2022-11-02 20:36:25,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (47 of 186 remaining) [2022-11-02 20:36:25,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (46 of 186 remaining) [2022-11-02 20:36:25,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (45 of 186 remaining) [2022-11-02 20:36:25,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (44 of 186 remaining) [2022-11-02 20:36:25,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (43 of 186 remaining) [2022-11-02 20:36:25,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (42 of 186 remaining) [2022-11-02 20:36:25,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (41 of 186 remaining) [2022-11-02 20:36:25,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (40 of 186 remaining) [2022-11-02 20:36:25,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 186 remaining) [2022-11-02 20:36:25,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 186 remaining) [2022-11-02 20:36:25,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 186 remaining) [2022-11-02 20:36:25,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 186 remaining) [2022-11-02 20:36:25,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 186 remaining) [2022-11-02 20:36:25,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 186 remaining) [2022-11-02 20:36:25,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 186 remaining) [2022-11-02 20:36:25,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 186 remaining) [2022-11-02 20:36:25,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 186 remaining) [2022-11-02 20:36:25,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 186 remaining) [2022-11-02 20:36:25,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 186 remaining) [2022-11-02 20:36:25,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 186 remaining) [2022-11-02 20:36:25,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 186 remaining) [2022-11-02 20:36:25,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 186 remaining) [2022-11-02 20:36:25,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 186 remaining) [2022-11-02 20:36:25,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 186 remaining) [2022-11-02 20:36:25,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 186 remaining) [2022-11-02 20:36:25,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 186 remaining) [2022-11-02 20:36:25,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 186 remaining) [2022-11-02 20:36:25,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 186 remaining) [2022-11-02 20:36:25,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 186 remaining) [2022-11-02 20:36:25,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 186 remaining) [2022-11-02 20:36:25,724 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 186 remaining) [2022-11-02 20:36:25,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 186 remaining) [2022-11-02 20:36:25,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 186 remaining) [2022-11-02 20:36:25,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 186 remaining) [2022-11-02 20:36:25,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 186 remaining) [2022-11-02 20:36:25,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 186 remaining) [2022-11-02 20:36:25,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 186 remaining) [2022-11-02 20:36:25,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 186 remaining) [2022-11-02 20:36:25,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 186 remaining) [2022-11-02 20:36:25,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 186 remaining) [2022-11-02 20:36:25,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 186 remaining) [2022-11-02 20:36:25,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 186 remaining) [2022-11-02 20:36:25,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 186 remaining) [2022-11-02 20:36:25,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 186 remaining) [2022-11-02 20:36:25,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 186 remaining) [2022-11-02 20:36:25,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 186 remaining) [2022-11-02 20:36:25,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 186 remaining) [2022-11-02 20:36:25,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 186 remaining) [2022-11-02 20:36:25,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:36:25,729 INFO L444 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] [2022-11-02 20:36:25,736 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:36:25,736 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:36:25,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:36:25 BasicIcfg [2022-11-02 20:36:25,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:36:25,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:36:25,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:36:25,742 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:36:25,743 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:35:54" (3/4) ... [2022-11-02 20:36:25,745 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:36:25,751 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:36:25,751 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:36:25,751 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:36:25,752 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-02 20:36:25,759 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2022-11-02 20:36:25,759 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:36:25,760 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:36:25,760 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:36:25,812 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:36:25,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:36:25,813 INFO L158 Benchmark]: Toolchain (without parser) took 34322.98ms. Allocated memory was 113.2MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 78.2MB in the beginning and 6.3GB in the end (delta: -6.3GB). Peak memory consumption was 759.2MB. Max. memory is 16.1GB. [2022-11-02 20:36:25,813 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 81.8MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:36:25,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.58ms. Allocated memory is still 113.2MB. Free memory was 78.1MB in the beginning and 85.0MB in the end (delta: -6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:36:25,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.27ms. Allocated memory is still 113.2MB. Free memory was 85.0MB in the beginning and 80.4MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:36:25,814 INFO L158 Benchmark]: Boogie Preprocessor took 105.96ms. Allocated memory is still 113.2MB. Free memory was 80.4MB in the beginning and 76.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:36:25,814 INFO L158 Benchmark]: RCFGBuilder took 2235.95ms. Allocated memory was 113.2MB in the beginning and 138.4MB in the end (delta: 25.2MB). Free memory was 76.2MB in the beginning and 91.2MB in the end (delta: -15.1MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2022-11-02 20:36:25,815 INFO L158 Benchmark]: TraceAbstraction took 31446.34ms. Allocated memory was 138.4MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 91.2MB in the beginning and 6.3GB in the end (delta: -6.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-02 20:36:25,815 INFO L158 Benchmark]: Witness Printer took 70.11ms. Allocated memory is still 7.1GB. Free memory was 6.3GB in the beginning and 6.3GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:36:25,817 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 81.8MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.58ms. Allocated memory is still 113.2MB. Free memory was 78.1MB in the beginning and 85.0MB in the end (delta: -6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.27ms. Allocated memory is still 113.2MB. Free memory was 85.0MB in the beginning and 80.4MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.96ms. Allocated memory is still 113.2MB. Free memory was 80.4MB in the beginning and 76.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2235.95ms. Allocated memory was 113.2MB in the beginning and 138.4MB in the end (delta: 25.2MB). Free memory was 76.2MB in the beginning and 91.2MB in the end (delta: -15.1MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31446.34ms. Allocated memory was 138.4MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 91.2MB in the beginning and 6.3GB in the end (delta: -6.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 70.11ms. Allocated memory is still 7.1GB. Free memory was 6.3GB in the beginning and 6.3GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: 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: 75]: 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: 75]: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: 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: 90]: 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: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: 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: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: 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 9 procedures, 552 locations, 186 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: 31.1s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 237 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 245 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 431 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1546 IncrementalHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 245 mSDtfsCounter, 1546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=896occurred 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.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 2585 NumberOfCodeBlocks, 2585 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2564 ConstructedInterpolants, 0 QuantifiedInterpolants, 3035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 - AllSpecificationsHoldResult: All specifications hold 103 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:36:25,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa82fff-30e1-4110-bd68-7686b5c6c5e5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE