./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN --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 c902137dd689344b33e1214981c74c26e47854ade5db7e5e71980f90fd07d90c --- 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-6b4ec56 [2022-11-20 12:11:18,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:11:18,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:11:18,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:11:18,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:11:18,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:11:18,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:11:18,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:11:18,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:11:18,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:11:18,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:11:18,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:11:18,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:11:18,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:11:18,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:11:18,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:11:18,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:11:18,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:11:18,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:11:18,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:11:18,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:11:18,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:11:18,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:11:18,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:11:18,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:11:18,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:11:18,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:11:18,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:11:18,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:11:18,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:11:18,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:11:18,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:11:18,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:11:18,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:11:18,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:11:18,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:11:18,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:11:18,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:11:18,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:11:18,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:11:18,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:11:18,190 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 12:11:18,241 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:11:18,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:11:18,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:11:18,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:11:18,243 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:11:18,243 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:11:18,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:11:18,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:11:18,245 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:11:18,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:11:18,246 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:11:18,246 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:11:18,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:11:18,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:11:18,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:11:18,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:11:18,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:11:18,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:11:18,248 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 12:11:18,248 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:11:18,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:11:18,248 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:11:18,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:11:18,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:11:18,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:11:18,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:11:18,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:11:18,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:11:18,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:11:18,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:11:18,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:11:18,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:11:18,251 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:11:18,251 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:11:18,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:11:18,252 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_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/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_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN 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 -> c902137dd689344b33e1214981c74c26e47854ade5db7e5e71980f90fd07d90c [2022-11-20 12:11:18,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:11:18,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:11:18,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:11:18,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:11:18,602 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:11:18,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2022-11-20 12:11:21,777 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:11:22,071 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:11:22,072 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2022-11-20 12:11:22,079 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/data/fa4e00a9a/92fb7d8642b741fa99e8adf72881c1ec/FLAG2651164a0 [2022-11-20 12:11:22,095 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/data/fa4e00a9a/92fb7d8642b741fa99e8adf72881c1ec [2022-11-20 12:11:22,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:11:22,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:11:22,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:11:22,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:11:22,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:11:22,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fd4eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22, skipping insertion in model container [2022-11-20 12:11:22,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:11:22,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:11:22,348 WARN L237 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_3b49b24d-bba9-4f24-90da-2593f7e5f26c/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-11-20 12:11:22,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:11:22,366 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:11:22,398 WARN L237 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_3b49b24d-bba9-4f24-90da-2593f7e5f26c/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-11-20 12:11:22,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:11:22,416 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:11:22,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22 WrapperNode [2022-11-20 12:11:22,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:11:22,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:11:22,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:11:22,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:11:22,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,474 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 281 [2022-11-20 12:11:22,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:11:22,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:11:22,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:11:22,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:11:22,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,516 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:11:22,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:11:22,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:11:22,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:11:22,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (1/1) ... [2022-11-20 12:11:22,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:11:22,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:11:22,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:11:22,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:11:22,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:11:22,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 12:11:22,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 12:11:22,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 12:11:22,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 12:11:22,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:11:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:11:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:11:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:11:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:11:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:11:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:11:22,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:11:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:11:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:11:22,660 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:11:22,860 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:11:22,863 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:11:23,632 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:11:23,844 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:11:23,845 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 12:11:23,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:11:23 BoogieIcfgContainer [2022-11-20 12:11:23,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:11:23,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:11:23,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:11:23,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:11:23,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:11:22" (1/3) ... [2022-11-20 12:11:23,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f37de31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:11:23, skipping insertion in model container [2022-11-20 12:11:23,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:11:22" (2/3) ... [2022-11-20 12:11:23,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f37de31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:11:23, skipping insertion in model container [2022-11-20 12:11:23,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:11:23" (3/3) ... [2022-11-20 12:11:23,857 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-11-20 12:11:23,868 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:11:23,877 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:11:23,877 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2022-11-20 12:11:23,877 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:11:23,979 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 12:11:24,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 265 transitions, 546 flow [2022-11-20 12:11:24,238 INFO L130 PetriNetUnfolder]: 13/263 cut-off events. [2022-11-20 12:11:24,238 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 12:11:24,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 263 events. 13/263 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 424 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. [2022-11-20 12:11:24,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 265 transitions, 546 flow [2022-11-20 12:11:24,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 242 transitions, 496 flow [2022-11-20 12:11:24,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:11:24,279 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;@6aba1b84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:11:24,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2022-11-20 12:11:24,287 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-11-20 12:11:24,289 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:11:24,289 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:24,290 INFO L209 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] [2022-11-20 12:11:24,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:24,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1386209113, now seen corresponding path program 1 times [2022-11-20 12:11:24,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:24,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325540511] [2022-11-20 12:11:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:24,556 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-20 12:11:24,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:24,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325540511] [2022-11-20 12:11:24,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325540511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:24,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:24,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404789763] [2022-11-20 12:11:24,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:24,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:24,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:24,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:24,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:24,625 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 265 [2022-11-20 12:11:24,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 242 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 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-20 12:11:24,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:24,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 265 [2022-11-20 12:11:24,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:25,114 INFO L130 PetriNetUnfolder]: 133/756 cut-off events. [2022-11-20 12:11:25,115 INFO L131 PetriNetUnfolder]: For 39/76 co-relation queries the response was YES. [2022-11-20 12:11:25,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 756 events. 133/756 cut-off events. For 39/76 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3755 event pairs, 84 based on Foata normal form. 48/679 useless extension candidates. Maximal degree in co-relation 850. Up to 241 conditions per place. [2022-11-20 12:11:25,128 INFO L137 encePairwiseOnDemand]: 239/265 looper letters, 32 selfloop transitions, 2 changer transitions 2/218 dead transitions. [2022-11-20 12:11:25,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 218 transitions, 516 flow [2022-11-20 12:11:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2022-11-20 12:11:25,163 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8465408805031447 [2022-11-20 12:11:25,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 673 transitions. [2022-11-20 12:11:25,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 673 transitions. [2022-11-20 12:11:25,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:25,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 673 transitions. [2022-11-20 12:11:25,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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-20 12:11:25,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:25,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:25,194 INFO L175 Difference]: Start difference. First operand has 238 places, 242 transitions, 496 flow. Second operand 3 states and 673 transitions. [2022-11-20 12:11:25,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 218 transitions, 516 flow [2022-11-20 12:11:25,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 218 transitions, 508 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 12:11:25,207 INFO L231 Difference]: Finished difference. Result has 218 places, 216 transitions, 440 flow [2022-11-20 12:11:25,210 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2022-11-20 12:11:25,215 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -20 predicate places. [2022-11-20 12:11:25,216 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 440 flow [2022-11-20 12:11:25,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 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-20 12:11:25,217 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:25,217 INFO L209 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] [2022-11-20 12:11:25,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:11:25,218 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash 934886058, now seen corresponding path program 1 times [2022-11-20 12:11:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:25,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865776292] [2022-11-20 12:11:25,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:25,372 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-20 12:11:25,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:25,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865776292] [2022-11-20 12:11:25,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865776292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:25,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:25,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80792643] [2022-11-20 12:11:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:25,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:25,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:25,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:25,383 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 265 [2022-11-20 12:11:25,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 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-20 12:11:25,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:25,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 265 [2022-11-20 12:11:25,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:25,740 INFO L130 PetriNetUnfolder]: 105/687 cut-off events. [2022-11-20 12:11:25,740 INFO L131 PetriNetUnfolder]: For 8/39 co-relation queries the response was YES. [2022-11-20 12:11:25,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 687 events. 105/687 cut-off events. For 8/39 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3269 event pairs, 49 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 858. Up to 145 conditions per place. [2022-11-20 12:11:25,750 INFO L137 encePairwiseOnDemand]: 257/265 looper letters, 29 selfloop transitions, 3 changer transitions 0/217 dead transitions. [2022-11-20 12:11:25,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 217 transitions, 507 flow [2022-11-20 12:11:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2022-11-20 12:11:25,755 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8314465408805032 [2022-11-20 12:11:25,755 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2022-11-20 12:11:25,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2022-11-20 12:11:25,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:25,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2022-11-20 12:11:25,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 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-20 12:11:25,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:25,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:25,764 INFO L175 Difference]: Start difference. First operand has 218 places, 216 transitions, 440 flow. Second operand 3 states and 661 transitions. [2022-11-20 12:11:25,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 217 transitions, 507 flow [2022-11-20 12:11:25,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 217 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:11:25,778 INFO L231 Difference]: Finished difference. Result has 211 places, 211 transitions, 432 flow [2022-11-20 12:11:25,779 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=211, PETRI_TRANSITIONS=211} [2022-11-20 12:11:25,780 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -27 predicate places. [2022-11-20 12:11:25,781 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 211 transitions, 432 flow [2022-11-20 12:11:25,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 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-20 12:11:25,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:25,782 INFO L209 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] [2022-11-20 12:11:25,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:11:25,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:25,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:25,784 INFO L85 PathProgramCache]: Analyzing trace with hash -283225401, now seen corresponding path program 1 times [2022-11-20 12:11:25,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:25,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757170204] [2022-11-20 12:11:25,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:25,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:25,900 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-20 12:11:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:25,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757170204] [2022-11-20 12:11:25,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757170204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:25,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:25,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:25,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492761628] [2022-11-20 12:11:25,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:25,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:25,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:25,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:25,907 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-11-20 12:11:25,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 211 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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-20 12:11:25,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:25,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-11-20 12:11:25,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:26,049 INFO L130 PetriNetUnfolder]: 28/532 cut-off events. [2022-11-20 12:11:26,050 INFO L131 PetriNetUnfolder]: For 13/32 co-relation queries the response was YES. [2022-11-20 12:11:26,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 532 events. 28/532 cut-off events. For 13/32 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2181 event pairs, 9 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 453. Up to 43 conditions per place. [2022-11-20 12:11:26,055 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 14 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2022-11-20 12:11:26,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 210 transitions, 462 flow [2022-11-20 12:11:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2022-11-20 12:11:26,059 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8628930817610063 [2022-11-20 12:11:26,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2022-11-20 12:11:26,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2022-11-20 12:11:26,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:26,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2022-11-20 12:11:26,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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-20 12:11:26,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:26,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:26,066 INFO L175 Difference]: Start difference. First operand has 211 places, 211 transitions, 432 flow. Second operand 3 states and 686 transitions. [2022-11-20 12:11:26,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 210 transitions, 462 flow [2022-11-20 12:11:26,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 210 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:11:26,072 INFO L231 Difference]: Finished difference. Result has 210 places, 210 transitions, 428 flow [2022-11-20 12:11:26,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=210, PETRI_TRANSITIONS=210} [2022-11-20 12:11:26,074 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -28 predicate places. [2022-11-20 12:11:26,074 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 210 transitions, 428 flow [2022-11-20 12:11:26,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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-20 12:11:26,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:26,075 INFO L209 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] [2022-11-20 12:11:26,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:11:26,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1096917963, now seen corresponding path program 1 times [2022-11-20 12:11:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:26,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995638084] [2022-11-20 12:11:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:26,126 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-20 12:11:26,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:26,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995638084] [2022-11-20 12:11:26,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995638084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:26,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:26,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870596620] [2022-11-20 12:11:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:26,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:26,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:26,131 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 265 [2022-11-20 12:11:26,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 210 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 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-20 12:11:26,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:26,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 265 [2022-11-20 12:11:26,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:26,311 INFO L130 PetriNetUnfolder]: 49/576 cut-off events. [2022-11-20 12:11:26,311 INFO L131 PetriNetUnfolder]: For 7/26 co-relation queries the response was YES. [2022-11-20 12:11:26,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 576 events. 49/576 cut-off events. For 7/26 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2524 event pairs, 24 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 633. Up to 85 conditions per place. [2022-11-20 12:11:26,316 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 20 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2022-11-20 12:11:26,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 209 transitions, 470 flow [2022-11-20 12:11:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2022-11-20 12:11:26,319 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8477987421383648 [2022-11-20 12:11:26,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 674 transitions. [2022-11-20 12:11:26,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 674 transitions. [2022-11-20 12:11:26,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:26,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 674 transitions. [2022-11-20 12:11:26,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 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-20 12:11:26,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:26,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:26,326 INFO L175 Difference]: Start difference. First operand has 210 places, 210 transitions, 428 flow. Second operand 3 states and 674 transitions. [2022-11-20 12:11:26,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 209 transitions, 470 flow [2022-11-20 12:11:26,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 209 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:11:26,332 INFO L231 Difference]: Finished difference. Result has 209 places, 209 transitions, 426 flow [2022-11-20 12:11:26,333 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=209, PETRI_TRANSITIONS=209} [2022-11-20 12:11:26,334 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-11-20 12:11:26,334 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 209 transitions, 426 flow [2022-11-20 12:11:26,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 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-20 12:11:26,335 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:26,335 INFO L209 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] [2022-11-20 12:11:26,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:11:26,336 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1375121806, now seen corresponding path program 1 times [2022-11-20 12:11:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:26,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769015860] [2022-11-20 12:11:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:26,383 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-20 12:11:26,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:26,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769015860] [2022-11-20 12:11:26,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769015860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:26,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:26,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:26,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470268491] [2022-11-20 12:11:26,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:26,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:26,388 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 265 [2022-11-20 12:11:26,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 209 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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-20 12:11:26,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:26,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 265 [2022-11-20 12:11:26,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:26,513 INFO L130 PetriNetUnfolder]: 42/555 cut-off events. [2022-11-20 12:11:26,513 INFO L131 PetriNetUnfolder]: For 8/27 co-relation queries the response was YES. [2022-11-20 12:11:26,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 555 events. 42/555 cut-off events. For 8/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2352 event pairs, 19 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 586. Up to 67 conditions per place. [2022-11-20 12:11:26,519 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 16 selfloop transitions, 1 changer transitions 0/207 dead transitions. [2022-11-20 12:11:26,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 207 transitions, 456 flow [2022-11-20 12:11:26,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2022-11-20 12:11:26,522 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8540880503144654 [2022-11-20 12:11:26,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2022-11-20 12:11:26,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2022-11-20 12:11:26,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:26,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2022-11-20 12:11:26,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 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-20 12:11:26,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:26,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:26,529 INFO L175 Difference]: Start difference. First operand has 209 places, 209 transitions, 426 flow. Second operand 3 states and 679 transitions. [2022-11-20 12:11:26,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 207 transitions, 456 flow [2022-11-20 12:11:26,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 207 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:11:26,534 INFO L231 Difference]: Finished difference. Result has 207 places, 207 transitions, 420 flow [2022-11-20 12:11:26,535 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=207, PETRI_TRANSITIONS=207} [2022-11-20 12:11:26,536 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -31 predicate places. [2022-11-20 12:11:26,536 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 207 transitions, 420 flow [2022-11-20 12:11:26,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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-20 12:11:26,537 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:26,537 INFO L209 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] [2022-11-20 12:11:26,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:11:26,538 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:26,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1573740915, now seen corresponding path program 1 times [2022-11-20 12:11:26,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:26,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784427121] [2022-11-20 12:11:26,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:26,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:26,626 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-20 12:11:26,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:26,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784427121] [2022-11-20 12:11:26,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784427121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:26,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:26,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:26,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374496112] [2022-11-20 12:11:26,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:26,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:26,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:26,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:26,631 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 265 [2022-11-20 12:11:26,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 207 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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-20 12:11:26,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:26,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 265 [2022-11-20 12:11:26,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:26,775 INFO L130 PetriNetUnfolder]: 49/593 cut-off events. [2022-11-20 12:11:26,775 INFO L131 PetriNetUnfolder]: For 7/26 co-relation queries the response was YES. [2022-11-20 12:11:26,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 593 events. 49/593 cut-off events. For 7/26 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2607 event pairs, 24 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 639. Up to 82 conditions per place. [2022-11-20 12:11:26,780 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 17 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2022-11-20 12:11:26,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 206 transitions, 456 flow [2022-11-20 12:11:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 680 transitions. [2022-11-20 12:11:26,783 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8553459119496856 [2022-11-20 12:11:26,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 680 transitions. [2022-11-20 12:11:26,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 680 transitions. [2022-11-20 12:11:26,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:26,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 680 transitions. [2022-11-20 12:11:26,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 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-20 12:11:26,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:26,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:26,789 INFO L175 Difference]: Start difference. First operand has 207 places, 207 transitions, 420 flow. Second operand 3 states and 680 transitions. [2022-11-20 12:11:26,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 206 transitions, 456 flow [2022-11-20 12:11:26,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 206 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:11:26,794 INFO L231 Difference]: Finished difference. Result has 207 places, 206 transitions, 421 flow [2022-11-20 12:11:26,795 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=207, PETRI_TRANSITIONS=206} [2022-11-20 12:11:26,798 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -31 predicate places. [2022-11-20 12:11:26,798 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 206 transitions, 421 flow [2022-11-20 12:11:26,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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-20 12:11:26,800 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:26,800 INFO L209 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-20 12:11:26,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:11:26,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:26,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:26,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1222548057, now seen corresponding path program 1 times [2022-11-20 12:11:26,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:26,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220729353] [2022-11-20 12:11:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:26,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:27,475 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-20 12:11:27,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:27,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220729353] [2022-11-20 12:11:27,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220729353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:27,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:27,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:11:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907029153] [2022-11-20 12:11:27,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:27,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:11:27,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:27,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:11:27,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:11:27,489 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 265 [2022-11-20 12:11:27,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 206 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 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-20 12:11:27,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:27,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 265 [2022-11-20 12:11:27,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:28,097 INFO L130 PetriNetUnfolder]: 635/2394 cut-off events. [2022-11-20 12:11:28,098 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:11:28,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 2394 events. 635/2394 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17330 event pairs, 465 based on Foata normal form. 0/2029 useless extension candidates. Maximal degree in co-relation 3330. Up to 963 conditions per place. [2022-11-20 12:11:28,171 INFO L137 encePairwiseOnDemand]: 259/265 looper letters, 40 selfloop transitions, 5 changer transitions 0/205 dead transitions. [2022-11-20 12:11:28,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 205 transitions, 509 flow [2022-11-20 12:11:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:11:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 12:11:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1210 transitions. [2022-11-20 12:11:28,177 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7610062893081762 [2022-11-20 12:11:28,177 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1210 transitions. [2022-11-20 12:11:28,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1210 transitions. [2022-11-20 12:11:28,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:28,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1210 transitions. [2022-11-20 12:11:28,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.66666666666666) internal successors, (1210), 6 states have internal predecessors, (1210), 0 states have call successors, (0), 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-20 12:11:28,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-20 12:11:28,189 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-20 12:11:28,189 INFO L175 Difference]: Start difference. First operand has 207 places, 206 transitions, 421 flow. Second operand 6 states and 1210 transitions. [2022-11-20 12:11:28,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 205 transitions, 509 flow [2022-11-20 12:11:28,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 205 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:11:28,197 INFO L231 Difference]: Finished difference. Result has 209 places, 205 transitions, 425 flow [2022-11-20 12:11:28,197 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=209, PETRI_TRANSITIONS=205} [2022-11-20 12:11:28,199 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-11-20 12:11:28,199 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 205 transitions, 425 flow [2022-11-20 12:11:28,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 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-20 12:11:28,200 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:28,201 INFO L209 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] [2022-11-20 12:11:28,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:11:28,201 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1280849672, now seen corresponding path program 1 times [2022-11-20 12:11:28,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:28,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605879662] [2022-11-20 12:11:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:28,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:28,779 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-20 12:11:28,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:28,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605879662] [2022-11-20 12:11:28,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605879662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:28,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:28,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:11:28,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27925817] [2022-11-20 12:11:28,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:28,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:11:28,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:28,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:11:28,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:11:28,785 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-11-20 12:11:28,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 205 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 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-20 12:11:28,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:28,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-11-20 12:11:28,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:29,450 INFO L130 PetriNetUnfolder]: 635/1599 cut-off events. [2022-11-20 12:11:29,451 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-20 12:11:29,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 1599 events. 635/1599 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8902 event pairs, 102 based on Foata normal form. 0/1440 useless extension candidates. Maximal degree in co-relation 2553. Up to 335 conditions per place. [2022-11-20 12:11:29,464 INFO L137 encePairwiseOnDemand]: 260/265 looper letters, 85 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2022-11-20 12:11:29,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 256 transitions, 705 flow [2022-11-20 12:11:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:11:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 12:11:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2022-11-20 12:11:29,469 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8075471698113208 [2022-11-20 12:11:29,470 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1284 transitions. [2022-11-20 12:11:29,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1284 transitions. [2022-11-20 12:11:29,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:29,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1284 transitions. [2022-11-20 12:11:29,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 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-20 12:11:29,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-20 12:11:29,479 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-20 12:11:29,479 INFO L175 Difference]: Start difference. First operand has 209 places, 205 transitions, 425 flow. Second operand 6 states and 1284 transitions. [2022-11-20 12:11:29,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 256 transitions, 705 flow [2022-11-20 12:11:29,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 256 transitions, 695 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 12:11:29,486 INFO L231 Difference]: Finished difference. Result has 208 places, 204 transitions, 421 flow [2022-11-20 12:11:29,487 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=208, PETRI_TRANSITIONS=204} [2022-11-20 12:11:29,487 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -30 predicate places. [2022-11-20 12:11:29,488 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 204 transitions, 421 flow [2022-11-20 12:11:29,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 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-20 12:11:29,489 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:29,489 INFO L209 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] [2022-11-20 12:11:29,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:11:29,490 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1955881516, now seen corresponding path program 1 times [2022-11-20 12:11:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:29,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510213536] [2022-11-20 12:11:29,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:29,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:29,547 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-20 12:11:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:29,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510213536] [2022-11-20 12:11:29,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510213536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:29,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:29,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094548775] [2022-11-20 12:11:29,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:29,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:29,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:29,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:29,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:29,553 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-11-20 12:11:29,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 204 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 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-20 12:11:29,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:29,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-11-20 12:11:29,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:29,688 INFO L130 PetriNetUnfolder]: 51/623 cut-off events. [2022-11-20 12:11:29,688 INFO L131 PetriNetUnfolder]: For 10/27 co-relation queries the response was YES. [2022-11-20 12:11:29,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 623 events. 51/623 cut-off events. For 10/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2722 event pairs, 7 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 675. Up to 70 conditions per place. [2022-11-20 12:11:29,692 INFO L137 encePairwiseOnDemand]: 261/265 looper letters, 20 selfloop transitions, 3 changer transitions 0/211 dead transitions. [2022-11-20 12:11:29,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 211 transitions, 484 flow [2022-11-20 12:11:29,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2022-11-20 12:11:29,695 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8716981132075472 [2022-11-20 12:11:29,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 693 transitions. [2022-11-20 12:11:29,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 693 transitions. [2022-11-20 12:11:29,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:29,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 693 transitions. [2022-11-20 12:11:29,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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-20 12:11:29,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:29,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:29,700 INFO L175 Difference]: Start difference. First operand has 208 places, 204 transitions, 421 flow. Second operand 3 states and 693 transitions. [2022-11-20 12:11:29,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 211 transitions, 484 flow [2022-11-20 12:11:29,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 211 transitions, 477 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 12:11:29,707 INFO L231 Difference]: Finished difference. Result has 206 places, 206 transitions, 433 flow [2022-11-20 12:11:29,707 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=206, PETRI_TRANSITIONS=206} [2022-11-20 12:11:29,708 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2022-11-20 12:11:29,709 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 206 transitions, 433 flow [2022-11-20 12:11:29,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 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-20 12:11:29,709 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:29,710 INFO L209 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] [2022-11-20 12:11:29,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:11:29,710 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:29,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:29,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1872926674, now seen corresponding path program 1 times [2022-11-20 12:11:29,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:29,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578999409] [2022-11-20 12:11:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:29,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:30,234 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-20 12:11:30,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:30,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578999409] [2022-11-20 12:11:30,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578999409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:30,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:30,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:11:30,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798133458] [2022-11-20 12:11:30,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:30,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:11:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:30,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:11:30,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:11:30,248 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 265 [2022-11-20 12:11:30,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 206 transitions, 433 flow. Second operand has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 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-20 12:11:30,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:30,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 265 [2022-11-20 12:11:30,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:30,979 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 302#(= |#race~queue~0| 0), 102#L52-5true, 280#(= |#race~n~0| 0), 296#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 305#true, 232#L68true]) [2022-11-20 12:11:30,980 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-20 12:11:30,980 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-20 12:11:30,981 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-20 12:11:30,981 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-20 12:11:30,985 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 172#L52-1true, 302#(= |#race~queue~0| 0), 199#L72true, 280#(= |#race~n~0| 0), 296#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 305#true]) [2022-11-20 12:11:30,986 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-20 12:11:30,986 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-20 12:11:30,986 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-20 12:11:30,986 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-20 12:11:30,987 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 172#L52-1true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 296#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 238#L79true, 305#true]) [2022-11-20 12:11:30,988 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-20 12:11:30,988 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-20 12:11:30,988 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-20 12:11:30,988 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-20 12:11:30,989 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 302#(= |#race~queue~0| 0), 102#L52-5true, 7#L101-4true, 280#(= |#race~n~0| 0), 305#true, 232#L68true]) [2022-11-20 12:11:30,989 INFO L383 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-11-20 12:11:30,990 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-20 12:11:30,990 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-20 12:11:30,990 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-20 12:11:31,006 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 172#L52-1true, 302#(= |#race~queue~0| 0), 199#L72true, 7#L101-4true, 280#(= |#race~n~0| 0), 305#true]) [2022-11-20 12:11:31,007 INFO L383 tUnfolder$Statistics]: this new event has 117 ancestors and is cut-off event [2022-11-20 12:11:31,007 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-20 12:11:31,007 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-20 12:11:31,008 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-20 12:11:31,008 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 172#L52-1true, 302#(= |#race~queue~0| 0), 7#L101-4true, 280#(= |#race~n~0| 0), 238#L79true, 305#true]) [2022-11-20 12:11:31,009 INFO L383 tUnfolder$Statistics]: this new event has 117 ancestors and is cut-off event [2022-11-20 12:11:31,009 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-20 12:11:31,009 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-20 12:11:31,009 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-20 12:11:31,010 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 102#L52-5true, 280#(= |#race~n~0| 0), 305#true, 232#L68true, 55#L101-5true]) [2022-11-20 12:11:31,011 INFO L383 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-11-20 12:11:31,011 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-20 12:11:31,011 INFO L386 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-11-20 12:11:31,011 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-20 12:11:31,028 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 172#L52-1true, 302#(= |#race~queue~0| 0), 199#L72true, 280#(= |#race~n~0| 0), 305#true, 55#L101-5true]) [2022-11-20 12:11:31,028 INFO L383 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-11-20 12:11:31,028 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-20 12:11:31,029 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-20 12:11:31,029 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-20 12:11:31,030 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 172#L52-1true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 238#L79true, 305#true, 55#L101-5true]) [2022-11-20 12:11:31,030 INFO L383 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-11-20 12:11:31,030 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-20 12:11:31,030 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-20 12:11:31,031 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-20 12:11:31,032 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 102#L52-5true, 280#(= |#race~n~0| 0), 305#true, 256#L101-6true, 232#L68true]) [2022-11-20 12:11:31,032 INFO L383 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-11-20 12:11:31,032 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-20 12:11:31,032 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-20 12:11:31,032 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-20 12:11:31,033 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 172#L52-1true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 238#L79true, 280#(= |#race~n~0| 0), 305#true, 256#L101-6true]) [2022-11-20 12:11:31,033 INFO L383 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-11-20 12:11:31,033 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-20 12:11:31,034 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-20 12:11:31,034 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-20 12:11:31,034 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 172#L52-1true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 199#L72true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 305#true, 256#L101-6true]) [2022-11-20 12:11:31,035 INFO L383 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-11-20 12:11:31,035 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-20 12:11:31,035 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-20 12:11:31,035 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-20 12:11:31,279 INFO L130 PetriNetUnfolder]: 988/3016 cut-off events. [2022-11-20 12:11:31,280 INFO L131 PetriNetUnfolder]: For 263/357 co-relation queries the response was YES. [2022-11-20 12:11:31,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4914 conditions, 3016 events. 988/3016 cut-off events. For 263/357 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 21304 event pairs, 332 based on Foata normal form. 0/2657 useless extension candidates. Maximal degree in co-relation 4864. Up to 901 conditions per place. [2022-11-20 12:11:31,304 INFO L137 encePairwiseOnDemand]: 259/265 looper letters, 83 selfloop transitions, 5 changer transitions 0/249 dead transitions. [2022-11-20 12:11:31,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 249 transitions, 719 flow [2022-11-20 12:11:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:11:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 12:11:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1257 transitions. [2022-11-20 12:11:31,309 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7905660377358491 [2022-11-20 12:11:31,310 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1257 transitions. [2022-11-20 12:11:31,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1257 transitions. [2022-11-20 12:11:31,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:31,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1257 transitions. [2022-11-20 12:11:31,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 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-20 12:11:31,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-20 12:11:31,364 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-20 12:11:31,365 INFO L175 Difference]: Start difference. First operand has 206 places, 206 transitions, 433 flow. Second operand 6 states and 1257 transitions. [2022-11-20 12:11:31,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 249 transitions, 719 flow [2022-11-20 12:11:31,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 249 transitions, 719 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 12:11:31,373 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 441 flow [2022-11-20 12:11:31,375 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2022-11-20 12:11:31,376 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -28 predicate places. [2022-11-20 12:11:31,376 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 441 flow [2022-11-20 12:11:31,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 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-20 12:11:31,377 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:31,378 INFO L209 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] [2022-11-20 12:11:31,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:11:31,378 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:31,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1918516166, now seen corresponding path program 1 times [2022-11-20 12:11:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:31,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997012941] [2022-11-20 12:11:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:32,000 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-20 12:11:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997012941] [2022-11-20 12:11:32,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997012941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:32,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:32,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:11:32,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406893432] [2022-11-20 12:11:32,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:32,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:11:32,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:32,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:11:32,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:11:32,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-11-20 12:11:32,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 441 flow. Second operand has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 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-20 12:11:32,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:32,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-11-20 12:11:32,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:32,711 INFO L130 PetriNetUnfolder]: 616/2429 cut-off events. [2022-11-20 12:11:32,712 INFO L131 PetriNetUnfolder]: For 255/407 co-relation queries the response was YES. [2022-11-20 12:11:32,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3815 conditions, 2429 events. 616/2429 cut-off events. For 255/407 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 17375 event pairs, 311 based on Foata normal form. 0/2122 useless extension candidates. Maximal degree in co-relation 3766. Up to 838 conditions per place. [2022-11-20 12:11:32,732 INFO L137 encePairwiseOnDemand]: 260/265 looper letters, 61 selfloop transitions, 4 changer transitions 0/232 dead transitions. [2022-11-20 12:11:32,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 232 transitions, 665 flow [2022-11-20 12:11:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:11:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 12:11:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1250 transitions. [2022-11-20 12:11:32,736 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7861635220125787 [2022-11-20 12:11:32,736 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1250 transitions. [2022-11-20 12:11:32,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1250 transitions. [2022-11-20 12:11:32,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:32,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1250 transitions. [2022-11-20 12:11:32,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 208.33333333333334) internal successors, (1250), 6 states have internal predecessors, (1250), 0 states have call successors, (0), 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-20 12:11:32,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-20 12:11:32,746 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 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-20 12:11:32,746 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 441 flow. Second operand 6 states and 1250 transitions. [2022-11-20 12:11:32,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 232 transitions, 665 flow [2022-11-20 12:11:32,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 232 transitions, 655 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 12:11:32,755 INFO L231 Difference]: Finished difference. Result has 209 places, 204 transitions, 437 flow [2022-11-20 12:11:32,755 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=209, PETRI_TRANSITIONS=204} [2022-11-20 12:11:32,756 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-11-20 12:11:32,756 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 204 transitions, 437 flow [2022-11-20 12:11:32,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 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-20 12:11:32,757 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:32,757 INFO L209 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] [2022-11-20 12:11:32,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:11:32,757 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash 731875413, now seen corresponding path program 1 times [2022-11-20 12:11:32,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:32,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864055167] [2022-11-20 12:11:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:32,823 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-20 12:11:32,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:32,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864055167] [2022-11-20 12:11:32,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864055167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:32,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:32,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:32,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245333233] [2022-11-20 12:11:32,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:32,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:32,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:32,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:32,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:32,827 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 265 [2022-11-20 12:11:32,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 204 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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-20 12:11:32,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:32,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 265 [2022-11-20 12:11:32,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:32,974 INFO L130 PetriNetUnfolder]: 92/678 cut-off events. [2022-11-20 12:11:32,974 INFO L131 PetriNetUnfolder]: For 40/64 co-relation queries the response was YES. [2022-11-20 12:11:32,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 678 events. 92/678 cut-off events. For 40/64 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3086 event pairs, 27 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 863. Up to 124 conditions per place. [2022-11-20 12:11:32,979 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 24 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2022-11-20 12:11:32,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 209 transitions, 504 flow [2022-11-20 12:11:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:32,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2022-11-20 12:11:32,982 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8654088050314466 [2022-11-20 12:11:32,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 688 transitions. [2022-11-20 12:11:32,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 688 transitions. [2022-11-20 12:11:32,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:32,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 688 transitions. [2022-11-20 12:11:32,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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-20 12:11:32,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:32,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:32,988 INFO L175 Difference]: Start difference. First operand has 209 places, 204 transitions, 437 flow. Second operand 3 states and 688 transitions. [2022-11-20 12:11:32,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 209 transitions, 504 flow [2022-11-20 12:11:32,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 497 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 12:11:32,993 INFO L231 Difference]: Finished difference. Result has 206 places, 203 transitions, 432 flow [2022-11-20 12:11:32,993 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=206, PETRI_TRANSITIONS=203} [2022-11-20 12:11:32,994 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2022-11-20 12:11:32,994 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 203 transitions, 432 flow [2022-11-20 12:11:32,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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-20 12:11:32,995 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:32,995 INFO L209 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-20 12:11:32,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:11:32,996 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash -776715436, now seen corresponding path program 1 times [2022-11-20 12:11:32,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:32,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745725128] [2022-11-20 12:11:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:32,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:33,051 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-20 12:11:33,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:33,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745725128] [2022-11-20 12:11:33,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745725128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:33,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:33,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:33,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360931049] [2022-11-20 12:11:33,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:33,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:33,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:33,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:33,056 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 265 [2022-11-20 12:11:33,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 203 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 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-20 12:11:33,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:33,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 265 [2022-11-20 12:11:33,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:33,208 INFO L130 PetriNetUnfolder]: 78/639 cut-off events. [2022-11-20 12:11:33,208 INFO L131 PetriNetUnfolder]: For 36/60 co-relation queries the response was YES. [2022-11-20 12:11:33,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 639 events. 78/639 cut-off events. For 36/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2788 event pairs, 21 based on Foata normal form. 2/583 useless extension candidates. Maximal degree in co-relation 793. Up to 97 conditions per place. [2022-11-20 12:11:33,213 INFO L137 encePairwiseOnDemand]: 259/265 looper letters, 20 selfloop transitions, 2 changer transitions 15/206 dead transitions. [2022-11-20 12:11:33,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 206 transitions, 497 flow [2022-11-20 12:11:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2022-11-20 12:11:33,217 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8540880503144654 [2022-11-20 12:11:33,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2022-11-20 12:11:33,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2022-11-20 12:11:33,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:33,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2022-11-20 12:11:33,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 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-20 12:11:33,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:33,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:33,224 INFO L175 Difference]: Start difference. First operand has 206 places, 203 transitions, 432 flow. Second operand 3 states and 679 transitions. [2022-11-20 12:11:33,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 206 transitions, 497 flow [2022-11-20 12:11:33,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:11:33,230 INFO L231 Difference]: Finished difference. Result has 203 places, 185 transitions, 393 flow [2022-11-20 12:11:33,230 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=203, PETRI_TRANSITIONS=185} [2022-11-20 12:11:33,231 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -35 predicate places. [2022-11-20 12:11:33,231 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 185 transitions, 393 flow [2022-11-20 12:11:33,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 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-20 12:11:33,232 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:33,233 INFO L209 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] [2022-11-20 12:11:33,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:11:33,233 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash -303010293, now seen corresponding path program 1 times [2022-11-20 12:11:33,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:33,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169951751] [2022-11-20 12:11:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:33,290 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-20 12:11:33,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:33,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169951751] [2022-11-20 12:11:33,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169951751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:33,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:33,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:33,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707475556] [2022-11-20 12:11:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:33,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:33,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:33,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:33,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:33,294 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 265 [2022-11-20 12:11:33,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 185 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 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-20 12:11:33,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:33,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 265 [2022-11-20 12:11:33,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:33,483 INFO L130 PetriNetUnfolder]: 133/691 cut-off events. [2022-11-20 12:11:33,483 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-11-20 12:11:33,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 691 events. 133/691 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3057 event pairs, 53 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 971. Up to 202 conditions per place. [2022-11-20 12:11:33,489 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2022-11-20 12:11:33,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 190 transitions, 474 flow [2022-11-20 12:11:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2022-11-20 12:11:33,492 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8176100628930818 [2022-11-20 12:11:33,492 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 650 transitions. [2022-11-20 12:11:33,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 650 transitions. [2022-11-20 12:11:33,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:33,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 650 transitions. [2022-11-20 12:11:33,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 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-20 12:11:33,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:33,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:33,499 INFO L175 Difference]: Start difference. First operand has 203 places, 185 transitions, 393 flow. Second operand 3 states and 650 transitions. [2022-11-20 12:11:33,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 190 transitions, 474 flow [2022-11-20 12:11:33,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:11:33,504 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 391 flow [2022-11-20 12:11:33,505 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2022-11-20 12:11:33,505 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-11-20 12:11:33,505 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 391 flow [2022-11-20 12:11:33,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 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-20 12:11:33,506 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:33,507 INFO L209 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] [2022-11-20 12:11:33,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:11:33,507 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:33,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash -345096208, now seen corresponding path program 1 times [2022-11-20 12:11:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:33,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677574601] [2022-11-20 12:11:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:33,569 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-20 12:11:33,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:33,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677574601] [2022-11-20 12:11:33,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677574601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:33,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:33,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:33,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781235399] [2022-11-20 12:11:33,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:33,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:33,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:33,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:33,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:33,573 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-11-20 12:11:33,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 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-20 12:11:33,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:33,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-11-20 12:11:33,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:33,744 INFO L130 PetriNetUnfolder]: 72/730 cut-off events. [2022-11-20 12:11:33,744 INFO L131 PetriNetUnfolder]: For 24/28 co-relation queries the response was YES. [2022-11-20 12:11:33,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 730 events. 72/730 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2998 event pairs, 12 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 855. Up to 64 conditions per place. [2022-11-20 12:11:33,750 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 20 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2022-11-20 12:11:33,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 190 transitions, 452 flow [2022-11-20 12:11:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2022-11-20 12:11:33,753 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8679245283018868 [2022-11-20 12:11:33,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 690 transitions. [2022-11-20 12:11:33,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 690 transitions. [2022-11-20 12:11:33,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:33,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 690 transitions. [2022-11-20 12:11:33,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 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-20 12:11:33,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:33,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:33,759 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 391 flow. Second operand 3 states and 690 transitions. [2022-11-20 12:11:33,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 190 transitions, 452 flow [2022-11-20 12:11:33,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 190 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:11:33,764 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 395 flow [2022-11-20 12:11:33,764 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2022-11-20 12:11:33,766 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-11-20 12:11:33,766 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 395 flow [2022-11-20 12:11:33,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 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-20 12:11:33,767 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:11:33,767 INFO L209 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] [2022-11-20 12:11:33,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:11:33,768 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-20 12:11:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:11:33,768 INFO L85 PathProgramCache]: Analyzing trace with hash 185153395, now seen corresponding path program 1 times [2022-11-20 12:11:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:11:33,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489834417] [2022-11-20 12:11:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:11:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:11:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:11:33,833 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-20 12:11:33,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:11:33,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489834417] [2022-11-20 12:11:33,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489834417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:11:33,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:11:33,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:11:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077391602] [2022-11-20 12:11:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:11:33,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:11:33,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:11:33,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:11:33,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:11:33,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 265 [2022-11-20 12:11:33,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 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-20 12:11:33,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:11:33,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 265 [2022-11-20 12:11:33,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:11:34,006 INFO L130 PetriNetUnfolder]: 86/738 cut-off events. [2022-11-20 12:11:34,006 INFO L131 PetriNetUnfolder]: For 34/38 co-relation queries the response was YES. [2022-11-20 12:11:34,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 738 events. 86/738 cut-off events. For 34/38 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2956 event pairs, 21 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 901. Up to 100 conditions per place. [2022-11-20 12:11:34,010 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 0 selfloop transitions, 0 changer transitions 189/189 dead transitions. [2022-11-20 12:11:34,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 189 transitions, 456 flow [2022-11-20 12:11:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:11:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:11:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2022-11-20 12:11:34,014 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8389937106918239 [2022-11-20 12:11:34,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2022-11-20 12:11:34,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2022-11-20 12:11:34,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:11:34,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2022-11-20 12:11:34,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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-20 12:11:34,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:34,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 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-20 12:11:34,021 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 395 flow. Second operand 3 states and 667 transitions. [2022-11-20 12:11:34,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 189 transitions, 456 flow [2022-11-20 12:11:34,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 189 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:11:34,026 INFO L231 Difference]: Finished difference. Result has 186 places, 0 transitions, 0 flow [2022-11-20 12:11:34,027 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=186, PETRI_TRANSITIONS=0} [2022-11-20 12:11:34,028 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-11-20 12:11:34,031 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 0 transitions, 0 flow [2022-11-20 12:11:34,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 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-20 12:11:34,035 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2022-11-20 12:11:34,035 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2022-11-20 12:11:34,036 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2022-11-20 12:11:34,036 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2022-11-20 12:11:34,036 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2022-11-20 12:11:34,037 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2022-11-20 12:11:34,037 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2022-11-20 12:11:34,037 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2022-11-20 12:11:34,037 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2022-11-20 12:11:34,038 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2022-11-20 12:11:34,038 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2022-11-20 12:11:34,038 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2022-11-20 12:11:34,038 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2022-11-20 12:11:34,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2022-11-20 12:11:34,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2022-11-20 12:11:34,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2022-11-20 12:11:34,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2022-11-20 12:11:34,040 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2022-11-20 12:11:34,040 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2022-11-20 12:11:34,040 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2022-11-20 12:11:34,040 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2022-11-20 12:11:34,041 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2022-11-20 12:11:34,041 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2022-11-20 12:11:34,041 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2022-11-20 12:11:34,041 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2022-11-20 12:11:34,042 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2022-11-20 12:11:34,042 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2022-11-20 12:11:34,042 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2022-11-20 12:11:34,042 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2022-11-20 12:11:34,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2022-11-20 12:11:34,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2022-11-20 12:11:34,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2022-11-20 12:11:34,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2022-11-20 12:11:34,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2022-11-20 12:11:34,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2022-11-20 12:11:34,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2022-11-20 12:11:34,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2022-11-20 12:11:34,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2022-11-20 12:11:34,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2022-11-20 12:11:34,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2022-11-20 12:11:34,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2022-11-20 12:11:34,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2022-11-20 12:11:34,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 71 remaining) [2022-11-20 12:11:34,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 71 remaining) [2022-11-20 12:11:34,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2022-11-20 12:11:34,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2022-11-20 12:11:34,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2022-11-20 12:11:34,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2022-11-20 12:11:34,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2022-11-20 12:11:34,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2022-11-20 12:11:34,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2022-11-20 12:11:34,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2022-11-20 12:11:34,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2022-11-20 12:11:34,049 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2022-11-20 12:11:34,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2022-11-20 12:11:34,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2022-11-20 12:11:34,051 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2022-11-20 12:11:34,051 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2022-11-20 12:11:34,051 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2022-11-20 12:11:34,052 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2022-11-20 12:11:34,052 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2022-11-20 12:11:34,052 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2022-11-20 12:11:34,052 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2022-11-20 12:11:34,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2022-11-20 12:11:34,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2022-11-20 12:11:34,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2022-11-20 12:11:34,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2022-11-20 12:11:34,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2022-11-20 12:11:34,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2022-11-20 12:11:34,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2022-11-20 12:11:34,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2022-11-20 12:11:34,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:11:34,055 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:11:34,065 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:11:34,066 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:11:34,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:11:34 BasicIcfg [2022-11-20 12:11:34,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:11:34,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:11:34,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:11:34,074 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:11:34,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:11:23" (3/4) ... [2022-11-20 12:11:34,085 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 12:11:34,092 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-20 12:11:34,092 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-20 12:11:34,100 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-20 12:11:34,100 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-20 12:11:34,101 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 12:11:34,101 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 12:11:34,183 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:11:34,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:11:34,184 INFO L158 Benchmark]: Toolchain (without parser) took 12084.13ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 121.2MB in the beginning and 143.8MB in the end (delta: -22.6MB). Peak memory consumption was 138.6MB. Max. memory is 16.1GB. [2022-11-20 12:11:34,184 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:11:34,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.35ms. Allocated memory is still 151.0MB. Free memory was 121.2MB in the beginning and 109.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 12:11:34,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.36ms. Allocated memory is still 151.0MB. Free memory was 109.0MB in the beginning and 106.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:11:34,186 INFO L158 Benchmark]: Boogie Preprocessor took 47.36ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 103.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:11:34,186 INFO L158 Benchmark]: RCFGBuilder took 1324.31ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 108.8MB in the end (delta: -4.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-20 12:11:34,187 INFO L158 Benchmark]: TraceAbstraction took 10222.87ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 108.0MB in the beginning and 147.0MB in the end (delta: -39.0MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. [2022-11-20 12:11:34,187 INFO L158 Benchmark]: Witness Printer took 109.93ms. Allocated memory is still 310.4MB. Free memory was 147.0MB in the beginning and 143.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:11:34,190 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.30ms. Allocated memory is still 121.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.35ms. Allocated memory is still 151.0MB. Free memory was 121.2MB in the beginning and 109.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.36ms. Allocated memory is still 151.0MB. Free memory was 109.0MB in the beginning and 106.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.36ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 103.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1324.31ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 108.8MB in the end (delta: -4.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10222.87ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 108.0MB in the beginning and 147.0MB in the end (delta: -39.0MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. * Witness Printer took 109.93ms. Allocated memory is still 310.4MB. Free memory was 147.0MB in the beginning and 143.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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: 78]: 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: 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: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 355 locations, 71 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 189 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=0, InterpolantAutomatonStates: 60, 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, 2.8s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1264 ConstructedInterpolants, 0 QuantifiedInterpolants, 1680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 40 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-20 12:11:34,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b49b24d-bba9-4f24-90da-2593f7e5f26c/bin/uautomizer-ug76WZFUDN/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