./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f 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_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8 --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 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 --- 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-e04fb08 [2022-11-16 11:47:06,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:47:06,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:47:06,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:47:06,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:47:06,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:47:06,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:47:06,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:47:06,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:47:06,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:47:06,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:47:06,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:47:06,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:47:06,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:47:06,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:47:06,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:47:06,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:47:06,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:47:06,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:47:06,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:47:06,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:47:06,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:47:06,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:47:06,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:47:06,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:47:06,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:47:06,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:47:06,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:47:06,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:47:06,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:47:06,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:47:06,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:47:06,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:47:06,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:47:06,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:47:06,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:47:06,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:47:06,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:47:06,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:47:06,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:47:06,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:47:06,560 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 11:47:06,594 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:47:06,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:47:06,595 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:47:06,595 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:47:06,596 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:47:06,596 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:47:06,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:47:06,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:47:06,597 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:47:06,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:47:06,597 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:47:06,597 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:47:06,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:47:06,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:47:06,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:47:06,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:47:06,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:47:06,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:47:06,601 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 11:47:06,601 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:47:06,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:47:06,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:47:06,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:47:06,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:47:06,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:47:06,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:47:06,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:47:06,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:47:06,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:47:06,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:47:06,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:47:06,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:47:06,605 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:47:06,606 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:47:06,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:47:06,606 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_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/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_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8 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 -> 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 [2022-11-16 11:47:06,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:47:06,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:47:06,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:47:06,933 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:47:06,934 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:47:06,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2022-11-16 11:47:07,018 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/data/4ddaedd45/cd07cf20d5f84423898ea75136578c60/FLAGca8acfe6a [2022-11-16 11:47:07,523 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:47:07,524 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2022-11-16 11:47:07,532 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/data/4ddaedd45/cd07cf20d5f84423898ea75136578c60/FLAGca8acfe6a [2022-11-16 11:47:07,875 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/data/4ddaedd45/cd07cf20d5f84423898ea75136578c60 [2022-11-16 11:47:07,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:47:07,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:47:07,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:47:07,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:47:07,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:47:07,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:47:07" (1/1) ... [2022-11-16 11:47:07,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd36582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:07, skipping insertion in model container [2022-11-16 11:47:07,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:47:07" (1/1) ... [2022-11-16 11:47:07,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:47:07,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:47:08,181 WARN L229 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_17404663-aa78-4588-a417-07ee46c7e173/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-11-16 11:47:08,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:47:08,195 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:47:08,229 WARN L229 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_17404663-aa78-4588-a417-07ee46c7e173/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-11-16 11:47:08,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:47:08,248 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:47:08,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08 WrapperNode [2022-11-16 11:47:08,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:47:08,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:47:08,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:47:08,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:47:08,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (1/1) ... [2022-11-16 11:47:08,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (1/1) ... [2022-11-16 11:47:08,307 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 420 [2022-11-16 11:47:08,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:47:08,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:47:08,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:47:08,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:47:08,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (1/1) ... [2022-11-16 11:47:08,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (1/1) ... [2022-11-16 11:47:08,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (1/1) ... [2022-11-16 11:47:08,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (1/1) ... [2022-11-16 11:47:08,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (1/1) ... [2022-11-16 11:47:08,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (1/1) ... [2022-11-16 11:47:08,351 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (1/1) ... [2022-11-16 11:47:08,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (1/1) ... [2022-11-16 11:47:08,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:47:08,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:47:08,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:47:08,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:47:08,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (1/1) ... [2022-11-16 11:47:08,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:47:08,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:47:08,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:47:08,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:47:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:47:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 11:47:08,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 11:47:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 11:47:08,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 11:47:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:47:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:47:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:47:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:47:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:47:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:47:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:47:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:47:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:47:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:47:08,452 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:47:08,613 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:47:08,622 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:47:09,405 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:47:09,943 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:47:09,943 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 11:47:09,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:47:09 BoogieIcfgContainer [2022-11-16 11:47:09,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:47:09,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:47:09,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:47:09,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:47:09,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:47:07" (1/3) ... [2022-11-16 11:47:09,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157c99d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:47:09, skipping insertion in model container [2022-11-16 11:47:09,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:47:08" (2/3) ... [2022-11-16 11:47:09,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157c99d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:47:09, skipping insertion in model container [2022-11-16 11:47:09,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:47:09" (3/3) ... [2022-11-16 11:47:09,959 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-11-16 11:47:09,971 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:47:09,982 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:47:09,982 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-11-16 11:47:09,983 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:47:10,152 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 11:47:10,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 330 places, 336 transitions, 688 flow [2022-11-16 11:47:10,414 INFO L130 PetriNetUnfolder]: 13/334 cut-off events. [2022-11-16 11:47:10,415 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-16 11:47:10,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 334 events. 13/334 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 507 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 248. Up to 2 conditions per place. [2022-11-16 11:47:10,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 330 places, 336 transitions, 688 flow [2022-11-16 11:47:10,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 316 transitions, 644 flow [2022-11-16 11:47:10,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:47:10,469 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;@5ff67a28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:47:10,469 INFO L358 AbstractCegarLoop]: Starting to check reachability of 117 error locations. [2022-11-16 11:47:10,478 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-11-16 11:47:10,478 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:47:10,478 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:10,479 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] [2022-11-16 11:47:10,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:10,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1317478839, now seen corresponding path program 1 times [2022-11-16 11:47:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:10,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36857485] [2022-11-16 11:47:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,758 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-16 11:47:10,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:10,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36857485] [2022-11-16 11:47:10,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36857485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:10,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:10,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:10,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299860554] [2022-11-16 11:47:10,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:10,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:10,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:10,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:10,818 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 336 [2022-11-16 11:47:10,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 316 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 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-16 11:47:10,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:10,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 336 [2022-11-16 11:47:10,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:11,091 INFO L130 PetriNetUnfolder]: 47/465 cut-off events. [2022-11-16 11:47:11,091 INFO L131 PetriNetUnfolder]: For 47/70 co-relation queries the response was YES. [2022-11-16 11:47:11,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 465 events. 47/465 cut-off events. For 47/70 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1509 event pairs, 35 based on Foata normal form. 20/410 useless extension candidates. Maximal degree in co-relation 314. Up to 88 conditions per place. [2022-11-16 11:47:11,101 INFO L137 encePairwiseOnDemand]: 285/336 looper letters, 17 selfloop transitions, 2 changer transitions 4/267 dead transitions. [2022-11-16 11:47:11,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 267 transitions, 584 flow [2022-11-16 11:47:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2022-11-16 11:47:11,127 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8591269841269841 [2022-11-16 11:47:11,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 866 transitions. [2022-11-16 11:47:11,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 866 transitions. [2022-11-16 11:47:11,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:11,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 866 transitions. [2022-11-16 11:47:11,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 288.6666666666667) internal successors, (866), 3 states have internal predecessors, (866), 0 states have call successors, (0), 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-16 11:47:11,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:11,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:11,157 INFO L175 Difference]: Start difference. First operand has 311 places, 316 transitions, 644 flow. Second operand 3 states and 866 transitions. [2022-11-16 11:47:11,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 267 transitions, 584 flow [2022-11-16 11:47:11,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 267 transitions, 576 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:47:11,178 INFO L231 Difference]: Finished difference. Result has 268 places, 263 transitions, 534 flow [2022-11-16 11:47:11,181 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=268, PETRI_TRANSITIONS=263} [2022-11-16 11:47:11,185 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -43 predicate places. [2022-11-16 11:47:11,185 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 263 transitions, 534 flow [2022-11-16 11:47:11,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 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-16 11:47:11,187 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:11,187 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] [2022-11-16 11:47:11,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:47:11,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:11,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:11,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2106332800, now seen corresponding path program 1 times [2022-11-16 11:47:11,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:11,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77384570] [2022-11-16 11:47:11,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:11,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:11,293 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-16 11:47:11,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:11,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77384570] [2022-11-16 11:47:11,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77384570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:11,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:11,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:11,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550337669] [2022-11-16 11:47:11,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:11,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:11,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:11,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:11,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:11,300 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 336 [2022-11-16 11:47:11,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 263 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-16 11:47:11,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:11,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 336 [2022-11-16 11:47:11,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:11,411 INFO L130 PetriNetUnfolder]: 17/352 cut-off events. [2022-11-16 11:47:11,412 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-11-16 11:47:11,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 352 events. 17/352 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 761 event pairs, 8 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 355. Up to 31 conditions per place. [2022-11-16 11:47:11,414 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 14 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2022-11-16 11:47:11,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 262 transitions, 564 flow [2022-11-16 11:47:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 824 transitions. [2022-11-16 11:47:11,417 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8174603174603174 [2022-11-16 11:47:11,417 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 824 transitions. [2022-11-16 11:47:11,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 824 transitions. [2022-11-16 11:47:11,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:11,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 824 transitions. [2022-11-16 11:47:11,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 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-16 11:47:11,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:11,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:11,424 INFO L175 Difference]: Start difference. First operand has 268 places, 263 transitions, 534 flow. Second operand 3 states and 824 transitions. [2022-11-16 11:47:11,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 262 transitions, 564 flow [2022-11-16 11:47:11,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 262 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:11,430 INFO L231 Difference]: Finished difference. Result has 263 places, 262 transitions, 532 flow [2022-11-16 11:47:11,431 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=263, PETRI_TRANSITIONS=262} [2022-11-16 11:47:11,431 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -48 predicate places. [2022-11-16 11:47:11,432 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 262 transitions, 532 flow [2022-11-16 11:47:11,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-16 11:47:11,433 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:11,433 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] [2022-11-16 11:47:11,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:47:11,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:11,434 INFO L85 PathProgramCache]: Analyzing trace with hash -667660326, now seen corresponding path program 1 times [2022-11-16 11:47:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:11,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921293824] [2022-11-16 11:47:11,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:11,481 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-16 11:47:11,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:11,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921293824] [2022-11-16 11:47:11,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921293824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:11,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:11,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307982613] [2022-11-16 11:47:11,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:11,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:11,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:11,485 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 336 [2022-11-16 11:47:11,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 262 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-16 11:47:11,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:11,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 336 [2022-11-16 11:47:11,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:11,610 INFO L130 PetriNetUnfolder]: 17/351 cut-off events. [2022-11-16 11:47:11,610 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-11-16 11:47:11,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 351 events. 17/351 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 760 event pairs, 8 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 347. Up to 31 conditions per place. [2022-11-16 11:47:11,612 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 14 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2022-11-16 11:47:11,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 261 transitions, 562 flow [2022-11-16 11:47:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 824 transitions. [2022-11-16 11:47:11,615 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8174603174603174 [2022-11-16 11:47:11,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 824 transitions. [2022-11-16 11:47:11,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 824 transitions. [2022-11-16 11:47:11,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:11,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 824 transitions. [2022-11-16 11:47:11,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 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-16 11:47:11,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:11,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:11,622 INFO L175 Difference]: Start difference. First operand has 263 places, 262 transitions, 532 flow. Second operand 3 states and 824 transitions. [2022-11-16 11:47:11,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 261 transitions, 562 flow [2022-11-16 11:47:11,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 261 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:11,627 INFO L231 Difference]: Finished difference. Result has 262 places, 261 transitions, 530 flow [2022-11-16 11:47:11,627 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=262, PETRI_TRANSITIONS=261} [2022-11-16 11:47:11,628 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -49 predicate places. [2022-11-16 11:47:11,628 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 261 transitions, 530 flow [2022-11-16 11:47:11,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-16 11:47:11,629 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:11,630 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] [2022-11-16 11:47:11,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:47:11,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1394995409, now seen corresponding path program 1 times [2022-11-16 11:47:11,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:11,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200835131] [2022-11-16 11:47:11,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:11,678 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-16 11:47:11,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:11,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200835131] [2022-11-16 11:47:11,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200835131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:11,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:11,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:11,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783970397] [2022-11-16 11:47:11,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:11,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:11,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:11,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:11,682 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 336 [2022-11-16 11:47:11,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 261 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-16 11:47:11,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:11,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 336 [2022-11-16 11:47:11,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:11,776 INFO L130 PetriNetUnfolder]: 17/350 cut-off events. [2022-11-16 11:47:11,777 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-11-16 11:47:11,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 350 events. 17/350 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 760 event pairs, 8 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 339. Up to 31 conditions per place. [2022-11-16 11:47:11,779 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 14 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2022-11-16 11:47:11,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 260 transitions, 560 flow [2022-11-16 11:47:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 824 transitions. [2022-11-16 11:47:11,782 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8174603174603174 [2022-11-16 11:47:11,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 824 transitions. [2022-11-16 11:47:11,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 824 transitions. [2022-11-16 11:47:11,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:11,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 824 transitions. [2022-11-16 11:47:11,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 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-16 11:47:11,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:11,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:11,789 INFO L175 Difference]: Start difference. First operand has 262 places, 261 transitions, 530 flow. Second operand 3 states and 824 transitions. [2022-11-16 11:47:11,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 260 transitions, 560 flow [2022-11-16 11:47:11,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 260 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:11,794 INFO L231 Difference]: Finished difference. Result has 261 places, 260 transitions, 528 flow [2022-11-16 11:47:11,794 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=261, PETRI_TRANSITIONS=260} [2022-11-16 11:47:11,795 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -50 predicate places. [2022-11-16 11:47:11,795 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 260 transitions, 528 flow [2022-11-16 11:47:11,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-16 11:47:11,796 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:11,797 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] [2022-11-16 11:47:11,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:47:11,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:11,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:11,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2090009422, now seen corresponding path program 1 times [2022-11-16 11:47:11,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:11,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66995194] [2022-11-16 11:47:11,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:11,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:11,852 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-16 11:47:11,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:11,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66995194] [2022-11-16 11:47:11,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66995194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:11,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:11,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883327061] [2022-11-16 11:47:11,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:11,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:11,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:11,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:11,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:11,858 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 336 [2022-11-16 11:47:11,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 260 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:11,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:11,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 336 [2022-11-16 11:47:11,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:12,013 INFO L130 PetriNetUnfolder]: 22/436 cut-off events. [2022-11-16 11:47:12,014 INFO L131 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2022-11-16 11:47:12,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 436 events. 22/436 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1225 event pairs, 5 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 431. Up to 27 conditions per place. [2022-11-16 11:47:12,017 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 17 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2022-11-16 11:47:12,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 266 transitions, 581 flow [2022-11-16 11:47:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 836 transitions. [2022-11-16 11:47:12,020 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8293650793650794 [2022-11-16 11:47:12,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 836 transitions. [2022-11-16 11:47:12,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 836 transitions. [2022-11-16 11:47:12,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:12,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 836 transitions. [2022-11-16 11:47:12,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 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-16 11:47:12,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:12,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:12,027 INFO L175 Difference]: Start difference. First operand has 261 places, 260 transitions, 528 flow. Second operand 3 states and 836 transitions. [2022-11-16 11:47:12,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 266 transitions, 581 flow [2022-11-16 11:47:12,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 266 transitions, 577 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:12,033 INFO L231 Difference]: Finished difference. Result has 261 places, 260 transitions, 532 flow [2022-11-16 11:47:12,033 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=261, PETRI_TRANSITIONS=260} [2022-11-16 11:47:12,037 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -50 predicate places. [2022-11-16 11:47:12,037 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 260 transitions, 532 flow [2022-11-16 11:47:12,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:12,038 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:12,039 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] [2022-11-16 11:47:12,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:47:12,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:12,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:12,040 INFO L85 PathProgramCache]: Analyzing trace with hash 732914540, now seen corresponding path program 1 times [2022-11-16 11:47:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:12,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799852544] [2022-11-16 11:47:12,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:12,141 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-16 11:47:12,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:12,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799852544] [2022-11-16 11:47:12,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799852544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:12,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:12,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:12,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503627905] [2022-11-16 11:47:12,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:12,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:12,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:12,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:12,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:12,146 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 336 [2022-11-16 11:47:12,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 260 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:12,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:12,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 336 [2022-11-16 11:47:12,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:12,284 INFO L130 PetriNetUnfolder]: 25/439 cut-off events. [2022-11-16 11:47:12,284 INFO L131 PetriNetUnfolder]: For 13/15 co-relation queries the response was YES. [2022-11-16 11:47:12,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 439 events. 25/439 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1209 event pairs, 13 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 267. Up to 45 conditions per place. [2022-11-16 11:47:12,287 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 12 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2022-11-16 11:47:12,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 259 transitions, 558 flow [2022-11-16 11:47:12,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 830 transitions. [2022-11-16 11:47:12,290 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8234126984126984 [2022-11-16 11:47:12,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 830 transitions. [2022-11-16 11:47:12,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 830 transitions. [2022-11-16 11:47:12,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:12,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 830 transitions. [2022-11-16 11:47:12,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.6666666666667) internal successors, (830), 3 states have internal predecessors, (830), 0 states have call successors, (0), 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-16 11:47:12,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:12,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:12,296 INFO L175 Difference]: Start difference. First operand has 261 places, 260 transitions, 532 flow. Second operand 3 states and 830 transitions. [2022-11-16 11:47:12,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 259 transitions, 558 flow [2022-11-16 11:47:12,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 259 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:47:12,302 INFO L231 Difference]: Finished difference. Result has 261 places, 259 transitions, 532 flow [2022-11-16 11:47:12,302 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=261, PETRI_TRANSITIONS=259} [2022-11-16 11:47:12,305 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -50 predicate places. [2022-11-16 11:47:12,305 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 259 transitions, 532 flow [2022-11-16 11:47:12,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:12,307 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:12,307 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] [2022-11-16 11:47:12,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:47:12,307 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:12,308 INFO L85 PathProgramCache]: Analyzing trace with hash -601729006, now seen corresponding path program 1 times [2022-11-16 11:47:12,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:12,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814021993] [2022-11-16 11:47:12,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:12,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:12,401 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-16 11:47:12,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:12,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814021993] [2022-11-16 11:47:12,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814021993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:12,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:12,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:12,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870969792] [2022-11-16 11:47:12,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:12,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:12,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:12,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:12,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:12,407 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 336 [2022-11-16 11:47:12,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 259 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-16 11:47:12,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:12,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 336 [2022-11-16 11:47:12,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:12,526 INFO L130 PetriNetUnfolder]: 25/438 cut-off events. [2022-11-16 11:47:12,526 INFO L131 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2022-11-16 11:47:12,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 438 events. 25/438 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1207 event pairs, 13 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 439. Up to 48 conditions per place. [2022-11-16 11:47:12,529 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 15 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2022-11-16 11:47:12,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 258 transitions, 564 flow [2022-11-16 11:47:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 824 transitions. [2022-11-16 11:47:12,533 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8174603174603174 [2022-11-16 11:47:12,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 824 transitions. [2022-11-16 11:47:12,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 824 transitions. [2022-11-16 11:47:12,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:12,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 824 transitions. [2022-11-16 11:47:12,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 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-16 11:47:12,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:12,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:12,540 INFO L175 Difference]: Start difference. First operand has 261 places, 259 transitions, 532 flow. Second operand 3 states and 824 transitions. [2022-11-16 11:47:12,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 258 transitions, 564 flow [2022-11-16 11:47:12,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 258 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:12,550 INFO L231 Difference]: Finished difference. Result has 260 places, 258 transitions, 530 flow [2022-11-16 11:47:12,551 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=260, PETRI_TRANSITIONS=258} [2022-11-16 11:47:12,552 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -51 predicate places. [2022-11-16 11:47:12,552 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 258 transitions, 530 flow [2022-11-16 11:47:12,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-16 11:47:12,553 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:12,553 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] [2022-11-16 11:47:12,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:47:12,554 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:12,554 INFO L85 PathProgramCache]: Analyzing trace with hash -701706545, now seen corresponding path program 1 times [2022-11-16 11:47:12,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:12,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506579443] [2022-11-16 11:47:12,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:12,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:12,631 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-16 11:47:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:12,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506579443] [2022-11-16 11:47:12,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506579443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:12,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:12,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503437578] [2022-11-16 11:47:12,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:12,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:12,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:12,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:12,636 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 336 [2022-11-16 11:47:12,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 258 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:12,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:12,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 336 [2022-11-16 11:47:12,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:12,775 INFO L130 PetriNetUnfolder]: 31/511 cut-off events. [2022-11-16 11:47:12,775 INFO L131 PetriNetUnfolder]: For 19/20 co-relation queries the response was YES. [2022-11-16 11:47:12,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 511 events. 31/511 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1765 event pairs, 10 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 522. Up to 35 conditions per place. [2022-11-16 11:47:12,778 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 18 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2022-11-16 11:47:12,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 264 transitions, 588 flow [2022-11-16 11:47:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2022-11-16 11:47:12,781 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8283730158730159 [2022-11-16 11:47:12,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 835 transitions. [2022-11-16 11:47:12,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 835 transitions. [2022-11-16 11:47:12,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:12,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 835 transitions. [2022-11-16 11:47:12,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 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-16 11:47:12,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:12,791 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:12,791 INFO L175 Difference]: Start difference. First operand has 260 places, 258 transitions, 530 flow. Second operand 3 states and 835 transitions. [2022-11-16 11:47:12,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 264 transitions, 588 flow [2022-11-16 11:47:12,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 264 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:12,813 INFO L231 Difference]: Finished difference. Result has 260 places, 258 transitions, 534 flow [2022-11-16 11:47:12,814 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=260, PETRI_TRANSITIONS=258} [2022-11-16 11:47:12,814 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -51 predicate places. [2022-11-16 11:47:12,815 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 258 transitions, 534 flow [2022-11-16 11:47:12,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:12,815 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:12,815 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-16 11:47:12,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:47:12,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1149422104, now seen corresponding path program 1 times [2022-11-16 11:47:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:12,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014022100] [2022-11-16 11:47:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:12,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:47:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:12,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014022100] [2022-11-16 11:47:12,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014022100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:12,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:12,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001676111] [2022-11-16 11:47:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:12,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:12,854 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 336 [2022-11-16 11:47:12,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 258 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:12,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:12,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 336 [2022-11-16 11:47:12,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:12,977 INFO L130 PetriNetUnfolder]: 31/528 cut-off events. [2022-11-16 11:47:12,977 INFO L131 PetriNetUnfolder]: For 22/24 co-relation queries the response was YES. [2022-11-16 11:47:12,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 528 events. 31/528 cut-off events. For 22/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1821 event pairs, 18 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 334. Up to 65 conditions per place. [2022-11-16 11:47:12,981 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 13 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2022-11-16 11:47:12,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 257 transitions, 562 flow [2022-11-16 11:47:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 830 transitions. [2022-11-16 11:47:12,984 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8234126984126984 [2022-11-16 11:47:12,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 830 transitions. [2022-11-16 11:47:12,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 830 transitions. [2022-11-16 11:47:12,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:12,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 830 transitions. [2022-11-16 11:47:12,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.6666666666667) internal successors, (830), 3 states have internal predecessors, (830), 0 states have call successors, (0), 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-16 11:47:12,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:12,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:12,989 INFO L175 Difference]: Start difference. First operand has 260 places, 258 transitions, 534 flow. Second operand 3 states and 830 transitions. [2022-11-16 11:47:12,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 257 transitions, 562 flow [2022-11-16 11:47:12,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 257 transitions, 560 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:47:12,994 INFO L231 Difference]: Finished difference. Result has 260 places, 257 transitions, 534 flow [2022-11-16 11:47:12,995 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=260, PETRI_TRANSITIONS=257} [2022-11-16 11:47:12,995 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -51 predicate places. [2022-11-16 11:47:12,996 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 257 transitions, 534 flow [2022-11-16 11:47:12,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:12,996 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:12,996 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] [2022-11-16 11:47:12,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:47:12,997 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:12,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:12,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1339194486, now seen corresponding path program 1 times [2022-11-16 11:47:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:12,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945206727] [2022-11-16 11:47:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:13,030 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-16 11:47:13,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:13,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945206727] [2022-11-16 11:47:13,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945206727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:13,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:13,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:13,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174697860] [2022-11-16 11:47:13,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:13,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:13,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:13,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:13,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:13,033 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 336 [2022-11-16 11:47:13,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 257 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:13,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:13,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 336 [2022-11-16 11:47:13,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:13,149 INFO L130 PetriNetUnfolder]: 31/527 cut-off events. [2022-11-16 11:47:13,149 INFO L131 PetriNetUnfolder]: For 21/23 co-relation queries the response was YES. [2022-11-16 11:47:13,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 527 events. 31/527 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1832 event pairs, 18 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 543. Up to 63 conditions per place. [2022-11-16 11:47:13,152 INFO L137 encePairwiseOnDemand]: 334/336 looper letters, 13 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2022-11-16 11:47:13,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 256 transitions, 560 flow [2022-11-16 11:47:13,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2022-11-16 11:47:13,155 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8224206349206349 [2022-11-16 11:47:13,155 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 829 transitions. [2022-11-16 11:47:13,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 829 transitions. [2022-11-16 11:47:13,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:13,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 829 transitions. [2022-11-16 11:47:13,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 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-16 11:47:13,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:13,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:13,160 INFO L175 Difference]: Start difference. First operand has 260 places, 257 transitions, 534 flow. Second operand 3 states and 829 transitions. [2022-11-16 11:47:13,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 256 transitions, 560 flow [2022-11-16 11:47:13,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 256 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:13,165 INFO L231 Difference]: Finished difference. Result has 259 places, 256 transitions, 530 flow [2022-11-16 11:47:13,166 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=259, PETRI_TRANSITIONS=256} [2022-11-16 11:47:13,166 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -52 predicate places. [2022-11-16 11:47:13,167 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 256 transitions, 530 flow [2022-11-16 11:47:13,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:13,167 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:13,167 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-16 11:47:13,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:47:13,168 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1908194966, now seen corresponding path program 1 times [2022-11-16 11:47:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:13,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425742442] [2022-11-16 11:47:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:13,246 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-16 11:47:13,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:13,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425742442] [2022-11-16 11:47:13,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425742442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:13,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:13,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:13,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048606152] [2022-11-16 11:47:13,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:13,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:13,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:13,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:13,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:13,251 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 336 [2022-11-16 11:47:13,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 256 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:13,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:13,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 336 [2022-11-16 11:47:13,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:13,400 INFO L130 PetriNetUnfolder]: 31/526 cut-off events. [2022-11-16 11:47:13,400 INFO L131 PetriNetUnfolder]: For 21/23 co-relation queries the response was YES. [2022-11-16 11:47:13,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 526 events. 31/526 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1829 event pairs, 18 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 543. Up to 65 conditions per place. [2022-11-16 11:47:13,404 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 13 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2022-11-16 11:47:13,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 255 transitions, 558 flow [2022-11-16 11:47:13,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 830 transitions. [2022-11-16 11:47:13,407 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8234126984126984 [2022-11-16 11:47:13,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 830 transitions. [2022-11-16 11:47:13,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 830 transitions. [2022-11-16 11:47:13,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:13,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 830 transitions. [2022-11-16 11:47:13,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.6666666666667) internal successors, (830), 3 states have internal predecessors, (830), 0 states have call successors, (0), 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-16 11:47:13,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:13,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:13,414 INFO L175 Difference]: Start difference. First operand has 259 places, 256 transitions, 530 flow. Second operand 3 states and 830 transitions. [2022-11-16 11:47:13,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 255 transitions, 558 flow [2022-11-16 11:47:13,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 255 transitions, 557 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:47:13,420 INFO L231 Difference]: Finished difference. Result has 259 places, 255 transitions, 531 flow [2022-11-16 11:47:13,421 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=259, PETRI_TRANSITIONS=255} [2022-11-16 11:47:13,421 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -52 predicate places. [2022-11-16 11:47:13,422 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 255 transitions, 531 flow [2022-11-16 11:47:13,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:13,422 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:13,423 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] [2022-11-16 11:47:13,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:47:13,423 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:13,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:13,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1223728021, now seen corresponding path program 1 times [2022-11-16 11:47:13,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:13,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131551158] [2022-11-16 11:47:13,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:13,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:14,019 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-16 11:47:14,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:14,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131551158] [2022-11-16 11:47:14,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131551158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:14,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:14,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:47:14,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26006283] [2022-11-16 11:47:14,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:14,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:47:14,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:14,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:47:14,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:47:14,024 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 336 [2022-11-16 11:47:14,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 255 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 233.83333333333334) internal successors, (1403), 6 states have internal predecessors, (1403), 0 states have call successors, (0), 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-16 11:47:14,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:14,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 336 [2022-11-16 11:47:14,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:14,408 INFO L130 PetriNetUnfolder]: 271/1119 cut-off events. [2022-11-16 11:47:14,408 INFO L131 PetriNetUnfolder]: For 122/153 co-relation queries the response was YES. [2022-11-16 11:47:14,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 1119 events. 271/1119 cut-off events. For 122/153 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6366 event pairs, 198 based on Foata normal form. 0/939 useless extension candidates. Maximal degree in co-relation 1670. Up to 468 conditions per place. [2022-11-16 11:47:14,417 INFO L137 encePairwiseOnDemand]: 324/336 looper letters, 44 selfloop transitions, 10 changer transitions 0/253 dead transitions. [2022-11-16 11:47:14,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 253 transitions, 635 flow [2022-11-16 11:47:14,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:47:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:47:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1446 transitions. [2022-11-16 11:47:14,421 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7172619047619048 [2022-11-16 11:47:14,421 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1446 transitions. [2022-11-16 11:47:14,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1446 transitions. [2022-11-16 11:47:14,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:14,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1446 transitions. [2022-11-16 11:47:14,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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-16 11:47:14,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 336.0) internal successors, (2352), 7 states have internal predecessors, (2352), 0 states have call successors, (0), 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-16 11:47:14,430 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 336.0) internal successors, (2352), 7 states have internal predecessors, (2352), 0 states have call successors, (0), 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-16 11:47:14,430 INFO L175 Difference]: Start difference. First operand has 259 places, 255 transitions, 531 flow. Second operand 6 states and 1446 transitions. [2022-11-16 11:47:14,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 253 transitions, 635 flow [2022-11-16 11:47:14,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 253 transitions, 631 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:14,436 INFO L231 Difference]: Finished difference. Result has 260 places, 253 transitions, 543 flow [2022-11-16 11:47:14,436 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=543, PETRI_PLACES=260, PETRI_TRANSITIONS=253} [2022-11-16 11:47:14,438 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -51 predicate places. [2022-11-16 11:47:14,438 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 253 transitions, 543 flow [2022-11-16 11:47:14,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 233.83333333333334) internal successors, (1403), 6 states have internal predecessors, (1403), 0 states have call successors, (0), 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-16 11:47:14,456 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:14,456 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] [2022-11-16 11:47:14,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:47:14,456 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1357841511, now seen corresponding path program 1 times [2022-11-16 11:47:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:14,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691381936] [2022-11-16 11:47:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:14,500 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-16 11:47:14,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:14,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691381936] [2022-11-16 11:47:14,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691381936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:14,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:14,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:14,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369211203] [2022-11-16 11:47:14,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:14,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:14,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:14,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:14,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:14,508 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 336 [2022-11-16 11:47:14,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 253 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:14,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:14,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 336 [2022-11-16 11:47:14,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:14,626 INFO L130 PetriNetUnfolder]: 31/523 cut-off events. [2022-11-16 11:47:14,626 INFO L131 PetriNetUnfolder]: For 21/23 co-relation queries the response was YES. [2022-11-16 11:47:14,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 523 events. 31/523 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1800 event pairs, 18 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 598. Up to 63 conditions per place. [2022-11-16 11:47:14,630 INFO L137 encePairwiseOnDemand]: 334/336 looper letters, 13 selfloop transitions, 1 changer transitions 0/252 dead transitions. [2022-11-16 11:47:14,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 252 transitions, 569 flow [2022-11-16 11:47:14,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2022-11-16 11:47:14,632 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8224206349206349 [2022-11-16 11:47:14,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 829 transitions. [2022-11-16 11:47:14,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 829 transitions. [2022-11-16 11:47:14,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:14,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 829 transitions. [2022-11-16 11:47:14,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 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-16 11:47:14,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:14,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:14,639 INFO L175 Difference]: Start difference. First operand has 260 places, 253 transitions, 543 flow. Second operand 3 states and 829 transitions. [2022-11-16 11:47:14,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 252 transitions, 569 flow [2022-11-16 11:47:14,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 252 transitions, 549 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:47:14,644 INFO L231 Difference]: Finished difference. Result has 256 places, 252 transitions, 523 flow [2022-11-16 11:47:14,644 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=256, PETRI_TRANSITIONS=252} [2022-11-16 11:47:14,646 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -55 predicate places. [2022-11-16 11:47:14,646 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 252 transitions, 523 flow [2022-11-16 11:47:14,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:14,646 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:14,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:47:14,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:47:14,647 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash 252027893, now seen corresponding path program 1 times [2022-11-16 11:47:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:14,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378459228] [2022-11-16 11:47:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:14,698 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-16 11:47:14,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378459228] [2022-11-16 11:47:14,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378459228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:14,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:14,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:14,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113570055] [2022-11-16 11:47:14,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:14,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:14,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:14,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:14,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:14,702 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 336 [2022-11-16 11:47:14,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 252 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:14,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:14,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 336 [2022-11-16 11:47:14,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:14,813 INFO L130 PetriNetUnfolder]: 31/522 cut-off events. [2022-11-16 11:47:14,814 INFO L131 PetriNetUnfolder]: For 21/23 co-relation queries the response was YES. [2022-11-16 11:47:14,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 522 events. 31/522 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1798 event pairs, 18 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 540. Up to 65 conditions per place. [2022-11-16 11:47:14,817 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 13 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2022-11-16 11:47:14,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 251 transitions, 551 flow [2022-11-16 11:47:14,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 830 transitions. [2022-11-16 11:47:14,820 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8234126984126984 [2022-11-16 11:47:14,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 830 transitions. [2022-11-16 11:47:14,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 830 transitions. [2022-11-16 11:47:14,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:14,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 830 transitions. [2022-11-16 11:47:14,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.6666666666667) internal successors, (830), 3 states have internal predecessors, (830), 0 states have call successors, (0), 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-16 11:47:14,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:14,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:14,825 INFO L175 Difference]: Start difference. First operand has 256 places, 252 transitions, 523 flow. Second operand 3 states and 830 transitions. [2022-11-16 11:47:14,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 251 transitions, 551 flow [2022-11-16 11:47:14,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 251 transitions, 550 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:47:14,830 INFO L231 Difference]: Finished difference. Result has 256 places, 251 transitions, 524 flow [2022-11-16 11:47:14,831 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=256, PETRI_TRANSITIONS=251} [2022-11-16 11:47:14,831 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -55 predicate places. [2022-11-16 11:47:14,832 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 251 transitions, 524 flow [2022-11-16 11:47:14,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:14,832 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:14,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:47:14,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:47:14,833 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:14,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash -900654036, now seen corresponding path program 1 times [2022-11-16 11:47:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:14,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014583162] [2022-11-16 11:47:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:14,886 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-16 11:47:14,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:14,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014583162] [2022-11-16 11:47:14,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014583162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:14,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:14,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:14,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611087758] [2022-11-16 11:47:14,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:14,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:14,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:14,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:14,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:14,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 336 [2022-11-16 11:47:14,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 251 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 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-16 11:47:14,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:14,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 336 [2022-11-16 11:47:14,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:15,083 INFO L130 PetriNetUnfolder]: 76/661 cut-off events. [2022-11-16 11:47:15,084 INFO L131 PetriNetUnfolder]: For 33/42 co-relation queries the response was YES. [2022-11-16 11:47:15,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 661 events. 76/661 cut-off events. For 33/42 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2827 event pairs, 25 based on Foata normal form. 1/580 useless extension candidates. Maximal degree in co-relation 802. Up to 108 conditions per place. [2022-11-16 11:47:15,088 INFO L137 encePairwiseOnDemand]: 329/336 looper letters, 18 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2022-11-16 11:47:15,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 252 transitions, 577 flow [2022-11-16 11:47:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2022-11-16 11:47:15,090 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.814484126984127 [2022-11-16 11:47:15,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 821 transitions. [2022-11-16 11:47:15,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 821 transitions. [2022-11-16 11:47:15,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:15,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 821 transitions. [2022-11-16 11:47:15,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 273.6666666666667) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 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-16 11:47:15,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:15,095 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:15,096 INFO L175 Difference]: Start difference. First operand has 256 places, 251 transitions, 524 flow. Second operand 3 states and 821 transitions. [2022-11-16 11:47:15,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 252 transitions, 577 flow [2022-11-16 11:47:15,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 252 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:15,100 INFO L231 Difference]: Finished difference. Result has 253 places, 248 transitions, 524 flow [2022-11-16 11:47:15,101 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=253, PETRI_TRANSITIONS=248} [2022-11-16 11:47:15,102 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -58 predicate places. [2022-11-16 11:47:15,103 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 524 flow [2022-11-16 11:47:15,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 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-16 11:47:15,103 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:15,103 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, 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-16 11:47:15,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:47:15,103 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:15,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2054908270, now seen corresponding path program 1 times [2022-11-16 11:47:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:15,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510730327] [2022-11-16 11:47:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:15,154 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-16 11:47:15,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:15,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510730327] [2022-11-16 11:47:15,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510730327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:15,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:15,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:15,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429264126] [2022-11-16 11:47:15,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:15,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:15,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:15,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:15,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:15,157 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 336 [2022-11-16 11:47:15,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 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-16 11:47:15,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:15,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 336 [2022-11-16 11:47:15,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:15,312 INFO L130 PetriNetUnfolder]: 91/715 cut-off events. [2022-11-16 11:47:15,312 INFO L131 PetriNetUnfolder]: For 62/95 co-relation queries the response was YES. [2022-11-16 11:47:15,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 715 events. 91/715 cut-off events. For 62/95 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3230 event pairs, 62 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 897. Up to 179 conditions per place. [2022-11-16 11:47:15,317 INFO L137 encePairwiseOnDemand]: 332/336 looper letters, 17 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2022-11-16 11:47:15,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 249 transitions, 565 flow [2022-11-16 11:47:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2022-11-16 11:47:15,320 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8194444444444444 [2022-11-16 11:47:15,320 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 826 transitions. [2022-11-16 11:47:15,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 826 transitions. [2022-11-16 11:47:15,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:15,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 826 transitions. [2022-11-16 11:47:15,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 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-16 11:47:15,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:15,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:15,325 INFO L175 Difference]: Start difference. First operand has 253 places, 248 transitions, 524 flow. Second operand 3 states and 826 transitions. [2022-11-16 11:47:15,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 249 transitions, 565 flow [2022-11-16 11:47:15,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:15,330 INFO L231 Difference]: Finished difference. Result has 252 places, 248 transitions, 524 flow [2022-11-16 11:47:15,330 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=252, PETRI_TRANSITIONS=248} [2022-11-16 11:47:15,331 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -59 predicate places. [2022-11-16 11:47:15,331 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 248 transitions, 524 flow [2022-11-16 11:47:15,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 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-16 11:47:15,332 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:15,332 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, 1, 1, 1, 1, 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-16 11:47:15,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:47:15,332 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash 389583927, now seen corresponding path program 1 times [2022-11-16 11:47:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:15,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642209404] [2022-11-16 11:47:15,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:15,386 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-16 11:47:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:15,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642209404] [2022-11-16 11:47:15,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642209404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:15,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:15,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563235496] [2022-11-16 11:47:15,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:15,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:15,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:15,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:15,389 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 336 [2022-11-16 11:47:15,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 248 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 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-16 11:47:15,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:15,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 336 [2022-11-16 11:47:15,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:15,567 INFO L130 PetriNetUnfolder]: 91/601 cut-off events. [2022-11-16 11:47:15,567 INFO L131 PetriNetUnfolder]: For 55/66 co-relation queries the response was YES. [2022-11-16 11:47:15,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 601 events. 91/601 cut-off events. For 55/66 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2530 event pairs, 25 based on Foata normal form. 6/568 useless extension candidates. Maximal degree in co-relation 796. Up to 116 conditions per place. [2022-11-16 11:47:15,571 INFO L137 encePairwiseOnDemand]: 329/336 looper letters, 15 selfloop transitions, 5 changer transitions 5/249 dead transitions. [2022-11-16 11:47:15,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 249 transitions, 575 flow [2022-11-16 11:47:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2022-11-16 11:47:15,574 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8134920634920635 [2022-11-16 11:47:15,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 820 transitions. [2022-11-16 11:47:15,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 820 transitions. [2022-11-16 11:47:15,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:15,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 820 transitions. [2022-11-16 11:47:15,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-16 11:47:15,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:15,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:15,580 INFO L175 Difference]: Start difference. First operand has 252 places, 248 transitions, 524 flow. Second operand 3 states and 820 transitions. [2022-11-16 11:47:15,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 249 transitions, 575 flow [2022-11-16 11:47:15,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 575 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:47:15,586 INFO L231 Difference]: Finished difference. Result has 251 places, 240 transitions, 517 flow [2022-11-16 11:47:15,586 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=251, PETRI_TRANSITIONS=240} [2022-11-16 11:47:15,587 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -60 predicate places. [2022-11-16 11:47:15,587 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 240 transitions, 517 flow [2022-11-16 11:47:15,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 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-16 11:47:15,588 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:15,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:47:15,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:47:15,588 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:15,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1969104157, now seen corresponding path program 1 times [2022-11-16 11:47:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:15,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759844343] [2022-11-16 11:47:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:15,670 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-16 11:47:15,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:15,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759844343] [2022-11-16 11:47:15,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759844343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:15,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:15,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213182874] [2022-11-16 11:47:15,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:15,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:15,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:15,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:15,674 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 336 [2022-11-16 11:47:15,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 240 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 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-16 11:47:15,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:15,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 336 [2022-11-16 11:47:15,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:15,876 INFO L130 PetriNetUnfolder]: 89/715 cut-off events. [2022-11-16 11:47:15,876 INFO L131 PetriNetUnfolder]: For 78/88 co-relation queries the response was YES. [2022-11-16 11:47:15,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 715 events. 89/715 cut-off events. For 78/88 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3352 event pairs, 53 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 984. Up to 146 conditions per place. [2022-11-16 11:47:15,882 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 19 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2022-11-16 11:47:15,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 243 transitions, 574 flow [2022-11-16 11:47:15,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2022-11-16 11:47:15,885 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8045634920634921 [2022-11-16 11:47:15,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 811 transitions. [2022-11-16 11:47:15,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 811 transitions. [2022-11-16 11:47:15,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:15,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 811 transitions. [2022-11-16 11:47:15,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-16 11:47:15,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:15,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:15,890 INFO L175 Difference]: Start difference. First operand has 251 places, 240 transitions, 517 flow. Second operand 3 states and 811 transitions. [2022-11-16 11:47:15,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 243 transitions, 574 flow [2022-11-16 11:47:15,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 243 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:15,897 INFO L231 Difference]: Finished difference. Result has 245 places, 239 transitions, 509 flow [2022-11-16 11:47:15,897 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=245, PETRI_TRANSITIONS=239} [2022-11-16 11:47:15,898 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -66 predicate places. [2022-11-16 11:47:15,898 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 239 transitions, 509 flow [2022-11-16 11:47:15,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 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-16 11:47:15,899 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:15,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:47:15,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:47:15,899 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash 419763907, now seen corresponding path program 1 times [2022-11-16 11:47:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:15,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977179870] [2022-11-16 11:47:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,415 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-16 11:47:16,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:16,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977179870] [2022-11-16 11:47:16,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977179870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:16,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:16,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:47:16,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048876830] [2022-11-16 11:47:16,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:16,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:47:16,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:16,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:47:16,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:47:16,418 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 336 [2022-11-16 11:47:16,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 239 transitions, 509 flow. Second operand has 6 states, 6 states have (on average 249.83333333333334) internal successors, (1499), 6 states have internal predecessors, (1499), 0 states have call successors, (0), 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-16 11:47:16,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:16,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 336 [2022-11-16 11:47:16,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:17,016 INFO L130 PetriNetUnfolder]: 355/1104 cut-off events. [2022-11-16 11:47:17,016 INFO L131 PetriNetUnfolder]: For 153/210 co-relation queries the response was YES. [2022-11-16 11:47:17,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 1104 events. 355/1104 cut-off events. For 153/210 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5582 event pairs, 56 based on Foata normal form. 15/1028 useless extension candidates. Maximal degree in co-relation 1823. Up to 258 conditions per place. [2022-11-16 11:47:17,024 INFO L137 encePairwiseOnDemand]: 331/336 looper letters, 54 selfloop transitions, 4 changer transitions 0/262 dead transitions. [2022-11-16 11:47:17,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 262 transitions, 703 flow [2022-11-16 11:47:17,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:47:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:47:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1537 transitions. [2022-11-16 11:47:17,028 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7624007936507936 [2022-11-16 11:47:17,028 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1537 transitions. [2022-11-16 11:47:17,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1537 transitions. [2022-11-16 11:47:17,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:17,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1537 transitions. [2022-11-16 11:47:17,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 0 states have call successors, (0), 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-16 11:47:17,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 336.0) internal successors, (2352), 7 states have internal predecessors, (2352), 0 states have call successors, (0), 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-16 11:47:17,036 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 336.0) internal successors, (2352), 7 states have internal predecessors, (2352), 0 states have call successors, (0), 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-16 11:47:17,036 INFO L175 Difference]: Start difference. First operand has 245 places, 239 transitions, 509 flow. Second operand 6 states and 1537 transitions. [2022-11-16 11:47:17,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 262 transitions, 703 flow [2022-11-16 11:47:17,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 262 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:17,041 INFO L231 Difference]: Finished difference. Result has 247 places, 238 transitions, 511 flow [2022-11-16 11:47:17,042 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=511, PETRI_PLACES=247, PETRI_TRANSITIONS=238} [2022-11-16 11:47:17,042 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -64 predicate places. [2022-11-16 11:47:17,042 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 238 transitions, 511 flow [2022-11-16 11:47:17,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 249.83333333333334) internal successors, (1499), 6 states have internal predecessors, (1499), 0 states have call successors, (0), 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-16 11:47:17,043 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:17,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:47:17,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:47:17,044 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash -326605400, now seen corresponding path program 1 times [2022-11-16 11:47:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:17,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036205101] [2022-11-16 11:47:17,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:17,114 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-16 11:47:17,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:17,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036205101] [2022-11-16 11:47:17,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036205101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:17,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:17,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:17,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577923591] [2022-11-16 11:47:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:17,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:17,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:17,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:17,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 336 [2022-11-16 11:47:17,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 238 transitions, 511 flow. Second operand has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 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-16 11:47:17,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:17,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 336 [2022-11-16 11:47:17,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:17,275 INFO L130 PetriNetUnfolder]: 97/575 cut-off events. [2022-11-16 11:47:17,275 INFO L131 PetriNetUnfolder]: For 55/58 co-relation queries the response was YES. [2022-11-16 11:47:17,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 575 events. 97/575 cut-off events. For 55/58 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2419 event pairs, 60 based on Foata normal form. 0/545 useless extension candidates. Maximal degree in co-relation 786. Up to 174 conditions per place. [2022-11-16 11:47:17,279 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 19 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2022-11-16 11:47:17,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 241 transitions, 564 flow [2022-11-16 11:47:17,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2022-11-16 11:47:17,282 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8045634920634921 [2022-11-16 11:47:17,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 811 transitions. [2022-11-16 11:47:17,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 811 transitions. [2022-11-16 11:47:17,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:17,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 811 transitions. [2022-11-16 11:47:17,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-16 11:47:17,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:17,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:47:17,287 INFO L175 Difference]: Start difference. First operand has 247 places, 238 transitions, 511 flow. Second operand 3 states and 811 transitions. [2022-11-16 11:47:17,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 241 transitions, 564 flow [2022-11-16 11:47:17,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 241 transitions, 557 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:47:17,292 INFO L231 Difference]: Finished difference. Result has 244 places, 237 transitions, 506 flow [2022-11-16 11:47:17,292 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=244, PETRI_TRANSITIONS=237} [2022-11-16 11:47:17,292 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -67 predicate places. [2022-11-16 11:47:17,293 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 237 transitions, 506 flow [2022-11-16 11:47:17,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 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-16 11:47:17,293 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:17,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:47:17,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:47:17,294 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2022-11-16 11:47:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash 407903783, now seen corresponding path program 1 times [2022-11-16 11:47:17,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:17,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254644970] [2022-11-16 11:47:17,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:17,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:17,834 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-16 11:47:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:17,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254644970] [2022-11-16 11:47:17,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254644970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:17,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:17,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:47:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169619046] [2022-11-16 11:47:17,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:17,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:47:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:17,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:47:17,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:47:17,838 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 336 [2022-11-16 11:47:17,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 237 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 250.83333333333334) internal successors, (1505), 6 states have internal predecessors, (1505), 0 states have call successors, (0), 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-16 11:47:17,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:17,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 336 [2022-11-16 11:47:17,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:18,335 INFO L130 PetriNetUnfolder]: 309/1213 cut-off events. [2022-11-16 11:47:18,336 INFO L131 PetriNetUnfolder]: For 119/145 co-relation queries the response was YES. [2022-11-16 11:47:18,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1995 conditions, 1213 events. 309/1213 cut-off events. For 119/145 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7005 event pairs, 197 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 1909. Up to 419 conditions per place. [2022-11-16 11:47:18,341 INFO L137 encePairwiseOnDemand]: 331/336 looper letters, 0 selfloop transitions, 0 changer transitions 248/248 dead transitions. [2022-11-16 11:47:18,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 248 transitions, 634 flow [2022-11-16 11:47:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:47:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:47:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1528 transitions. [2022-11-16 11:47:18,347 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7579365079365079 [2022-11-16 11:47:18,347 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1528 transitions. [2022-11-16 11:47:18,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1528 transitions. [2022-11-16 11:47:18,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:18,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1528 transitions. [2022-11-16 11:47:18,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 254.66666666666666) internal successors, (1528), 6 states have internal predecessors, (1528), 0 states have call successors, (0), 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-16 11:47:18,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 336.0) internal successors, (2352), 7 states have internal predecessors, (2352), 0 states have call successors, (0), 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-16 11:47:18,357 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 336.0) internal successors, (2352), 7 states have internal predecessors, (2352), 0 states have call successors, (0), 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-16 11:47:18,357 INFO L175 Difference]: Start difference. First operand has 244 places, 237 transitions, 506 flow. Second operand 6 states and 1528 transitions. [2022-11-16 11:47:18,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 248 transitions, 634 flow [2022-11-16 11:47:18,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 248 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:18,362 INFO L231 Difference]: Finished difference. Result has 246 places, 0 transitions, 0 flow [2022-11-16 11:47:18,363 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=246, PETRI_TRANSITIONS=0} [2022-11-16 11:47:18,363 INFO L288 CegarLoopForPetriNet]: 311 programPoint places, -65 predicate places. [2022-11-16 11:47:18,364 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 0 transitions, 0 flow [2022-11-16 11:47:18,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 250.83333333333334) internal successors, (1505), 6 states have internal predecessors, (1505), 0 states have call successors, (0), 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-16 11:47:18,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (116 of 117 remaining) [2022-11-16 11:47:18,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (115 of 117 remaining) [2022-11-16 11:47:18,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (114 of 117 remaining) [2022-11-16 11:47:18,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (113 of 117 remaining) [2022-11-16 11:47:18,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (112 of 117 remaining) [2022-11-16 11:47:18,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (111 of 117 remaining) [2022-11-16 11:47:18,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (110 of 117 remaining) [2022-11-16 11:47:18,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (109 of 117 remaining) [2022-11-16 11:47:18,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (108 of 117 remaining) [2022-11-16 11:47:18,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (107 of 117 remaining) [2022-11-16 11:47:18,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (106 of 117 remaining) [2022-11-16 11:47:18,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (105 of 117 remaining) [2022-11-16 11:47:18,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (104 of 117 remaining) [2022-11-16 11:47:18,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (103 of 117 remaining) [2022-11-16 11:47:18,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (102 of 117 remaining) [2022-11-16 11:47:18,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (101 of 117 remaining) [2022-11-16 11:47:18,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (100 of 117 remaining) [2022-11-16 11:47:18,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (99 of 117 remaining) [2022-11-16 11:47:18,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (98 of 117 remaining) [2022-11-16 11:47:18,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (97 of 117 remaining) [2022-11-16 11:47:18,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (96 of 117 remaining) [2022-11-16 11:47:18,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (95 of 117 remaining) [2022-11-16 11:47:18,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (94 of 117 remaining) [2022-11-16 11:47:18,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (93 of 117 remaining) [2022-11-16 11:47:18,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (92 of 117 remaining) [2022-11-16 11:47:18,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (91 of 117 remaining) [2022-11-16 11:47:18,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (90 of 117 remaining) [2022-11-16 11:47:18,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (89 of 117 remaining) [2022-11-16 11:47:18,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (88 of 117 remaining) [2022-11-16 11:47:18,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (87 of 117 remaining) [2022-11-16 11:47:18,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (86 of 117 remaining) [2022-11-16 11:47:18,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (85 of 117 remaining) [2022-11-16 11:47:18,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (84 of 117 remaining) [2022-11-16 11:47:18,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (83 of 117 remaining) [2022-11-16 11:47:18,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (82 of 117 remaining) [2022-11-16 11:47:18,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (81 of 117 remaining) [2022-11-16 11:47:18,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (80 of 117 remaining) [2022-11-16 11:47:18,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (79 of 117 remaining) [2022-11-16 11:47:18,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (78 of 117 remaining) [2022-11-16 11:47:18,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (77 of 117 remaining) [2022-11-16 11:47:18,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (76 of 117 remaining) [2022-11-16 11:47:18,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (75 of 117 remaining) [2022-11-16 11:47:18,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (74 of 117 remaining) [2022-11-16 11:47:18,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (73 of 117 remaining) [2022-11-16 11:47:18,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (72 of 117 remaining) [2022-11-16 11:47:18,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (71 of 117 remaining) [2022-11-16 11:47:18,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (70 of 117 remaining) [2022-11-16 11:47:18,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (69 of 117 remaining) [2022-11-16 11:47:18,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (68 of 117 remaining) [2022-11-16 11:47:18,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (67 of 117 remaining) [2022-11-16 11:47:18,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (66 of 117 remaining) [2022-11-16 11:47:18,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (65 of 117 remaining) [2022-11-16 11:47:18,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (64 of 117 remaining) [2022-11-16 11:47:18,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (63 of 117 remaining) [2022-11-16 11:47:18,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (62 of 117 remaining) [2022-11-16 11:47:18,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (61 of 117 remaining) [2022-11-16 11:47:18,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (60 of 117 remaining) [2022-11-16 11:47:18,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (59 of 117 remaining) [2022-11-16 11:47:18,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (58 of 117 remaining) [2022-11-16 11:47:18,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (57 of 117 remaining) [2022-11-16 11:47:18,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (56 of 117 remaining) [2022-11-16 11:47:18,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (55 of 117 remaining) [2022-11-16 11:47:18,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (54 of 117 remaining) [2022-11-16 11:47:18,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (53 of 117 remaining) [2022-11-16 11:47:18,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (52 of 117 remaining) [2022-11-16 11:47:18,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (51 of 117 remaining) [2022-11-16 11:47:18,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (50 of 117 remaining) [2022-11-16 11:47:18,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 117 remaining) [2022-11-16 11:47:18,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 117 remaining) [2022-11-16 11:47:18,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 117 remaining) [2022-11-16 11:47:18,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 117 remaining) [2022-11-16 11:47:18,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 117 remaining) [2022-11-16 11:47:18,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 117 remaining) [2022-11-16 11:47:18,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 117 remaining) [2022-11-16 11:47:18,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (42 of 117 remaining) [2022-11-16 11:47:18,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 117 remaining) [2022-11-16 11:47:18,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (40 of 117 remaining) [2022-11-16 11:47:18,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (39 of 117 remaining) [2022-11-16 11:47:18,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (38 of 117 remaining) [2022-11-16 11:47:18,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 117 remaining) [2022-11-16 11:47:18,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 117 remaining) [2022-11-16 11:47:18,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 117 remaining) [2022-11-16 11:47:18,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 117 remaining) [2022-11-16 11:47:18,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (33 of 117 remaining) [2022-11-16 11:47:18,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (32 of 117 remaining) [2022-11-16 11:47:18,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 117 remaining) [2022-11-16 11:47:18,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (30 of 117 remaining) [2022-11-16 11:47:18,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (29 of 117 remaining) [2022-11-16 11:47:18,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (28 of 117 remaining) [2022-11-16 11:47:18,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (27 of 117 remaining) [2022-11-16 11:47:18,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (26 of 117 remaining) [2022-11-16 11:47:18,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (25 of 117 remaining) [2022-11-16 11:47:18,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (24 of 117 remaining) [2022-11-16 11:47:18,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 117 remaining) [2022-11-16 11:47:18,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 117 remaining) [2022-11-16 11:47:18,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 117 remaining) [2022-11-16 11:47:18,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 117 remaining) [2022-11-16 11:47:18,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 117 remaining) [2022-11-16 11:47:18,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 117 remaining) [2022-11-16 11:47:18,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 117 remaining) [2022-11-16 11:47:18,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 117 remaining) [2022-11-16 11:47:18,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (15 of 117 remaining) [2022-11-16 11:47:18,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (14 of 117 remaining) [2022-11-16 11:47:18,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (13 of 117 remaining) [2022-11-16 11:47:18,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (12 of 117 remaining) [2022-11-16 11:47:18,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (11 of 117 remaining) [2022-11-16 11:47:18,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (10 of 117 remaining) [2022-11-16 11:47:18,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (9 of 117 remaining) [2022-11-16 11:47:18,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (8 of 117 remaining) [2022-11-16 11:47:18,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (7 of 117 remaining) [2022-11-16 11:47:18,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (6 of 117 remaining) [2022-11-16 11:47:18,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (5 of 117 remaining) [2022-11-16 11:47:18,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (4 of 117 remaining) [2022-11-16 11:47:18,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (3 of 117 remaining) [2022-11-16 11:47:18,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (2 of 117 remaining) [2022-11-16 11:47:18,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (1 of 117 remaining) [2022-11-16 11:47:18,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (0 of 117 remaining) [2022-11-16 11:47:18,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:47:18,392 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:47:18,398 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:47:18,398 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:47:18,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:47:18 BasicIcfg [2022-11-16 11:47:18,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:47:18,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:47:18,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:47:18,405 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:47:18,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:47:09" (3/4) ... [2022-11-16 11:47:18,408 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 11:47:18,412 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-16 11:47:18,413 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-16 11:47:18,418 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-11-16 11:47:18,419 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-16 11:47:18,419 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 11:47:18,420 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 11:47:18,462 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:47:18,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:47:18,463 INFO L158 Benchmark]: Toolchain (without parser) took 10583.86ms. Allocated memory was 157.3MB in the beginning and 402.7MB in the end (delta: 245.4MB). Free memory was 124.7MB in the beginning and 286.2MB in the end (delta: -161.5MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2022-11-16 11:47:18,463 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 88.1MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:47:18,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.15ms. Allocated memory is still 157.3MB. Free memory was 124.4MB in the beginning and 130.7MB in the end (delta: -6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:47:18,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.72ms. Allocated memory is still 157.3MB. Free memory was 130.7MB in the beginning and 127.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:47:18,464 INFO L158 Benchmark]: Boogie Preprocessor took 49.48ms. Allocated memory is still 157.3MB. Free memory was 127.4MB in the beginning and 124.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:47:18,464 INFO L158 Benchmark]: RCFGBuilder took 1589.71ms. Allocated memory is still 157.3MB. Free memory was 124.5MB in the beginning and 120.1MB in the end (delta: 4.4MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2022-11-16 11:47:18,465 INFO L158 Benchmark]: TraceAbstraction took 8451.80ms. Allocated memory was 157.3MB in the beginning and 402.7MB in the end (delta: 245.4MB). Free memory was 119.1MB in the beginning and 290.4MB in the end (delta: -171.3MB). Peak memory consumption was 200.9MB. Max. memory is 16.1GB. [2022-11-16 11:47:18,465 INFO L158 Benchmark]: Witness Printer took 58.00ms. Allocated memory is still 402.7MB. Free memory was 290.4MB in the beginning and 286.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:47:18,467 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.24ms. Allocated memory is still 88.1MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.15ms. Allocated memory is still 157.3MB. Free memory was 124.4MB in the beginning and 130.7MB in the end (delta: -6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.72ms. Allocated memory is still 157.3MB. Free memory was 130.7MB in the beginning and 127.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.48ms. Allocated memory is still 157.3MB. Free memory was 127.4MB in the beginning and 124.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1589.71ms. Allocated memory is still 157.3MB. Free memory was 124.5MB in the beginning and 120.1MB in the end (delta: 4.4MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8451.80ms. Allocated memory was 157.3MB in the beginning and 402.7MB in the end (delta: 245.4MB). Free memory was 119.1MB in the beginning and 290.4MB in the end (delta: -171.3MB). Peak memory consumption was 200.9MB. Max. memory is 16.1GB. * Witness Printer took 58.00ms. Allocated memory is still 402.7MB. Free memory was 290.4MB in the beginning and 286.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: 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: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: 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: 101]: 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, 412 locations, 117 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: 8.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 169 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 580 IncrementalHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 169 mSDtfsCounter, 580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=644occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2116 NumberOfCodeBlocks, 2116 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2095 ConstructedInterpolants, 0 QuantifiedInterpolants, 2408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-16 11:47:18,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17404663-aa78-4588-a417-07ee46c7e173/bin/uautomizer-tPACEb0tL8/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