./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a 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_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b48bde914fb7ebeda4cbd6fd329f7fd1281e3c3e233b6f5149c7b66a2f709ab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:56:09,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:56:09,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:56:09,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:56:09,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:56:09,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:56:09,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:56:09,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:56:09,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:56:09,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:56:09,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:56:09,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:56:09,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:56:09,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:56:09,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:56:09,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:56:09,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:56:09,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:56:09,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:56:09,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:56:09,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:56:09,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:56:09,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:56:09,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:56:09,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:56:09,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:56:09,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:56:09,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:56:09,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:56:09,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:56:09,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:56:09,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:56:09,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:56:09,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:56:09,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:56:09,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:56:09,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:56:09,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:56:09,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:56:09,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:56:09,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:56:09,741 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:56:09,770 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:56:09,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:56:09,771 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:56:09,771 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:56:09,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:56:09,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:56:09,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:56:09,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:56:09,773 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:56:09,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:56:09,773 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:56:09,774 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:56:09,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:56:09,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:56:09,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:56:09,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:56:09,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:56:09,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:56:09,775 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:56:09,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:56:09,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:56:09,776 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:56:09,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:56:09,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:56:09,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:56:09,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:56:09,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:09,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:56:09,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:56:09,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:56:09,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:56:09,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:56:09,778 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:56:09,778 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:56:09,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:56:09,779 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_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b48bde914fb7ebeda4cbd6fd329f7fd1281e3c3e233b6f5149c7b66a2f709ab [2022-11-02 20:56:10,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:56:10,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:56:10,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:56:10,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:56:10,108 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:56:10,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2022-11-02 20:56:10,185 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/data/bac297ed7/4523fd721c3540d2946298617c6adfa7/FLAG091eb5dd7 [2022-11-02 20:56:10,731 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:56:10,734 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2022-11-02 20:56:10,743 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/data/bac297ed7/4523fd721c3540d2946298617c6adfa7/FLAG091eb5dd7 [2022-11-02 20:56:11,069 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/data/bac297ed7/4523fd721c3540d2946298617c6adfa7 [2022-11-02 20:56:11,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:56:11,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:56:11,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:11,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:56:11,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:56:11,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7233510a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11, skipping insertion in model container [2022-11-02 20:56:11,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:56:11,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:56:11,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2022-11-02 20:56:11,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:11,380 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:56:11,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2022-11-02 20:56:11,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:11,429 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:56:11,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11 WrapperNode [2022-11-02 20:56:11,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:11,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:11,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:56:11,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:56:11,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,478 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 270 [2022-11-02 20:56:11,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:11,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:56:11,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:56:11,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:56:11,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,507 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:56:11,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:56:11,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:56:11,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:56:11,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (1/1) ... [2022-11-02 20:56:11,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:11,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:11,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:56:11,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:56:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:56:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:56:11,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:56:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:56:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:56:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:56:11,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:56:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:56:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:56:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:56:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:56:11,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:56:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:56:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:56:11,623 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:56:11,757 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:56:11,759 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:56:12,373 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:56:12,386 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:56:12,386 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:56:12,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:12 BoogieIcfgContainer [2022-11-02 20:56:12,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:56:12,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:56:12,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:56:12,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:56:12,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:56:11" (1/3) ... [2022-11-02 20:56:12,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0dd545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:12, skipping insertion in model container [2022-11-02 20:56:12,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:11" (2/3) ... [2022-11-02 20:56:12,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0dd545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:12, skipping insertion in model container [2022-11-02 20:56:12,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:12" (3/3) ... [2022-11-02 20:56:12,400 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2022-11-02 20:56:12,409 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:56:12,420 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:56:12,420 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-02 20:56:12,420 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:56:12,521 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:56:12,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 345 places, 353 transitions, 730 flow [2022-11-02 20:56:12,837 INFO L130 PetriNetUnfolder]: 18/350 cut-off events. [2022-11-02 20:56:12,837 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:56:12,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 350 events. 18/350 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 869 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2022-11-02 20:56:12,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 345 places, 353 transitions, 730 flow [2022-11-02 20:56:12,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 320 places, 326 transitions, 670 flow [2022-11-02 20:56:12,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:56:12,875 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;@634aac11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:56:12,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2022-11-02 20:56:12,882 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-11-02 20:56:12,883 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:56:12,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:12,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:12,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:12,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1413365796, now seen corresponding path program 1 times [2022-11-02 20:56:12,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:12,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603305695] [2022-11-02 20:56:12,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:13,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:13,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603305695] [2022-11-02 20:56:13,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603305695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:13,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:13,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:13,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165498874] [2022-11-02 20:56:13,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:13,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:13,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:13,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:13,164 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 353 [2022-11-02 20:56:13,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 326 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:13,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:13,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 353 [2022-11-02 20:56:13,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:13,512 INFO L130 PetriNetUnfolder]: 52/781 cut-off events. [2022-11-02 20:56:13,512 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-02 20:56:13,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 781 events. 52/781 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3942 event pairs, 21 based on Foata normal form. 28/673 useless extension candidates. Maximal degree in co-relation 594. Up to 58 conditions per place. [2022-11-02 20:56:13,529 INFO L137 encePairwiseOnDemand]: 344/353 looper letters, 15 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2022-11-02 20:56:13,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 319 transitions, 690 flow [2022-11-02 20:56:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2022-11-02 20:56:13,555 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9490084985835694 [2022-11-02 20:56:13,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1005 transitions. [2022-11-02 20:56:13,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1005 transitions. [2022-11-02 20:56:13,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:13,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1005 transitions. [2022-11-02 20:56:13,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:13,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:13,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:13,586 INFO L175 Difference]: Start difference. First operand has 320 places, 326 transitions, 670 flow. Second operand 3 states and 1005 transitions. [2022-11-02 20:56:13,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 319 transitions, 690 flow [2022-11-02 20:56:13,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 319 transitions, 678 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:56:13,602 INFO L231 Difference]: Finished difference. Result has 315 places, 319 transitions, 648 flow [2022-11-02 20:56:13,605 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=315, PETRI_TRANSITIONS=319} [2022-11-02 20:56:13,609 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -5 predicate places. [2022-11-02 20:56:13,609 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 319 transitions, 648 flow [2022-11-02 20:56:13,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:13,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:13,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:13,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:56:13,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1458263111, now seen corresponding path program 1 times [2022-11-02 20:56:13,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:13,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812004829] [2022-11-02 20:56:13,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:13,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:13,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812004829] [2022-11-02 20:56:13,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812004829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:13,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:13,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497536362] [2022-11-02 20:56:13,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:13,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:13,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:13,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:13,764 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 353 [2022-11-02 20:56:13,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 319 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:13,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:13,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 353 [2022-11-02 20:56:13,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:14,002 INFO L130 PetriNetUnfolder]: 42/789 cut-off events. [2022-11-02 20:56:14,002 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-11-02 20:56:14,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 789 events. 42/789 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4176 event pairs, 21 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 830. Up to 63 conditions per place. [2022-11-02 20:56:14,015 INFO L137 encePairwiseOnDemand]: 350/353 looper letters, 15 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2022-11-02 20:56:14,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 318 transitions, 680 flow [2022-11-02 20:56:14,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 999 transitions. [2022-11-02 20:56:14,020 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.943342776203966 [2022-11-02 20:56:14,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 999 transitions. [2022-11-02 20:56:14,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 999 transitions. [2022-11-02 20:56:14,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:14,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 999 transitions. [2022-11-02 20:56:14,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:14,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:14,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:14,027 INFO L175 Difference]: Start difference. First operand has 315 places, 319 transitions, 648 flow. Second operand 3 states and 999 transitions. [2022-11-02 20:56:14,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 318 transitions, 680 flow [2022-11-02 20:56:14,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 318 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:14,038 INFO L231 Difference]: Finished difference. Result has 314 places, 318 transitions, 646 flow [2022-11-02 20:56:14,039 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=314, PETRI_TRANSITIONS=318} [2022-11-02 20:56:14,039 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -6 predicate places. [2022-11-02 20:56:14,040 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 318 transitions, 646 flow [2022-11-02 20:56:14,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:14,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:14,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:14,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:56:14,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1926137347, now seen corresponding path program 1 times [2022-11-02 20:56:14,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:14,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753126000] [2022-11-02 20:56:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:14,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:14,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:14,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753126000] [2022-11-02 20:56:14,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753126000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:14,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:14,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:14,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936099897] [2022-11-02 20:56:14,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:14,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:14,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:14,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:14,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:14,163 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 353 [2022-11-02 20:56:14,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 318 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:14,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:14,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 353 [2022-11-02 20:56:14,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:14,512 INFO L130 PetriNetUnfolder]: 130/1387 cut-off events. [2022-11-02 20:56:14,512 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:56:14,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1387 events. 130/1387 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 10641 event pairs, 72 based on Foata normal form. 0/1141 useless extension candidates. Maximal degree in co-relation 1530. Up to 145 conditions per place. [2022-11-02 20:56:14,536 INFO L137 encePairwiseOnDemand]: 350/353 looper letters, 18 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2022-11-02 20:56:14,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 317 transitions, 684 flow [2022-11-02 20:56:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2022-11-02 20:56:14,541 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9376770538243626 [2022-11-02 20:56:14,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 993 transitions. [2022-11-02 20:56:14,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 993 transitions. [2022-11-02 20:56:14,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:14,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 993 transitions. [2022-11-02 20:56:14,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:14,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:14,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:14,550 INFO L175 Difference]: Start difference. First operand has 314 places, 318 transitions, 646 flow. Second operand 3 states and 993 transitions. [2022-11-02 20:56:14,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 317 transitions, 684 flow [2022-11-02 20:56:14,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 317 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:14,557 INFO L231 Difference]: Finished difference. Result has 313 places, 317 transitions, 644 flow [2022-11-02 20:56:14,558 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=313, PETRI_TRANSITIONS=317} [2022-11-02 20:56:14,560 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -7 predicate places. [2022-11-02 20:56:14,561 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 317 transitions, 644 flow [2022-11-02 20:56:14,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:14,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:14,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:14,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:56:14,562 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1290132050, now seen corresponding path program 1 times [2022-11-02 20:56:14,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:14,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796016076] [2022-11-02 20:56:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:14,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:14,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796016076] [2022-11-02 20:56:14,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796016076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:14,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:14,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:14,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719965529] [2022-11-02 20:56:14,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:14,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:14,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:14,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:14,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:14,664 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 353 [2022-11-02 20:56:14,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 317 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:14,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:14,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 353 [2022-11-02 20:56:14,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:14,984 INFO L130 PetriNetUnfolder]: 72/1224 cut-off events. [2022-11-02 20:56:14,984 INFO L131 PetriNetUnfolder]: For 11/14 co-relation queries the response was YES. [2022-11-02 20:56:14,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 1224 events. 72/1224 cut-off events. For 11/14 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8593 event pairs, 39 based on Foata normal form. 0/1050 useless extension candidates. Maximal degree in co-relation 1290. Up to 90 conditions per place. [2022-11-02 20:56:15,005 INFO L137 encePairwiseOnDemand]: 350/353 looper letters, 15 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2022-11-02 20:56:15,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 316 transitions, 676 flow [2022-11-02 20:56:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 999 transitions. [2022-11-02 20:56:15,009 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.943342776203966 [2022-11-02 20:56:15,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 999 transitions. [2022-11-02 20:56:15,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 999 transitions. [2022-11-02 20:56:15,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:15,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 999 transitions. [2022-11-02 20:56:15,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,017 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,018 INFO L175 Difference]: Start difference. First operand has 313 places, 317 transitions, 644 flow. Second operand 3 states and 999 transitions. [2022-11-02 20:56:15,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 316 transitions, 676 flow [2022-11-02 20:56:15,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 316 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:15,025 INFO L231 Difference]: Finished difference. Result has 312 places, 316 transitions, 642 flow [2022-11-02 20:56:15,026 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=312, PETRI_TRANSITIONS=316} [2022-11-02 20:56:15,027 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -8 predicate places. [2022-11-02 20:56:15,027 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 316 transitions, 642 flow [2022-11-02 20:56:15,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:15,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:15,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:56:15,029 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:15,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1361319163, now seen corresponding path program 1 times [2022-11-02 20:56:15,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:15,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994944487] [2022-11-02 20:56:15,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:15,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:15,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:15,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994944487] [2022-11-02 20:56:15,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994944487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:15,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:15,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174719909] [2022-11-02 20:56:15,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:15,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:15,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:15,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:15,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:15,086 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 353 [2022-11-02 20:56:15,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 316 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:15,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 353 [2022-11-02 20:56:15,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:15,412 INFO L130 PetriNetUnfolder]: 196/1479 cut-off events. [2022-11-02 20:56:15,413 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-02 20:56:15,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 1479 events. 196/1479 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10945 event pairs, 132 based on Foata normal form. 0/1229 useless extension candidates. Maximal degree in co-relation 1686. Up to 250 conditions per place. [2022-11-02 20:56:15,444 INFO L137 encePairwiseOnDemand]: 350/353 looper letters, 21 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2022-11-02 20:56:15,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 315 transitions, 686 flow [2022-11-02 20:56:15,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 987 transitions. [2022-11-02 20:56:15,481 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9320113314447592 [2022-11-02 20:56:15,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 987 transitions. [2022-11-02 20:56:15,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 987 transitions. [2022-11-02 20:56:15,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:15,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 987 transitions. [2022-11-02 20:56:15,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,489 INFO L175 Difference]: Start difference. First operand has 312 places, 316 transitions, 642 flow. Second operand 3 states and 987 transitions. [2022-11-02 20:56:15,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 315 transitions, 686 flow [2022-11-02 20:56:15,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 315 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:15,495 INFO L231 Difference]: Finished difference. Result has 311 places, 315 transitions, 640 flow [2022-11-02 20:56:15,496 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=311, PETRI_TRANSITIONS=315} [2022-11-02 20:56:15,496 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -9 predicate places. [2022-11-02 20:56:15,497 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 315 transitions, 640 flow [2022-11-02 20:56:15,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:15,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:15,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:56:15,498 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1431489938, now seen corresponding path program 1 times [2022-11-02 20:56:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:15,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087104896] [2022-11-02 20:56:15,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:15,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:15,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:15,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087104896] [2022-11-02 20:56:15,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087104896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:15,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:15,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:15,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212033217] [2022-11-02 20:56:15,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:15,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:15,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:15,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:15,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:15,548 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 353 [2022-11-02 20:56:15,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 315 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:15,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 353 [2022-11-02 20:56:15,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:15,751 INFO L130 PetriNetUnfolder]: 57/885 cut-off events. [2022-11-02 20:56:15,751 INFO L131 PetriNetUnfolder]: For 26/29 co-relation queries the response was YES. [2022-11-02 20:56:15,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 885 events. 57/885 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4771 event pairs, 39 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 922. Up to 90 conditions per place. [2022-11-02 20:56:15,769 INFO L137 encePairwiseOnDemand]: 350/353 looper letters, 15 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2022-11-02 20:56:15,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 314 transitions, 672 flow [2022-11-02 20:56:15,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 999 transitions. [2022-11-02 20:56:15,773 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.943342776203966 [2022-11-02 20:56:15,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 999 transitions. [2022-11-02 20:56:15,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 999 transitions. [2022-11-02 20:56:15,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:15,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 999 transitions. [2022-11-02 20:56:15,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,780 INFO L175 Difference]: Start difference. First operand has 311 places, 315 transitions, 640 flow. Second operand 3 states and 999 transitions. [2022-11-02 20:56:15,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 314 transitions, 672 flow [2022-11-02 20:56:15,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 314 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:15,787 INFO L231 Difference]: Finished difference. Result has 310 places, 314 transitions, 638 flow [2022-11-02 20:56:15,788 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=310, PETRI_TRANSITIONS=314} [2022-11-02 20:56:15,789 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -10 predicate places. [2022-11-02 20:56:15,789 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 314 transitions, 638 flow [2022-11-02 20:56:15,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:15,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:15,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:56:15,791 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:15,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1655390410, now seen corresponding path program 1 times [2022-11-02 20:56:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:15,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023793951] [2022-11-02 20:56:15,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:15,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:15,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:15,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023793951] [2022-11-02 20:56:15,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023793951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:15,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:15,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899663834] [2022-11-02 20:56:15,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:15,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:15,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:15,841 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 353 [2022-11-02 20:56:15,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 314 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:15,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:15,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 353 [2022-11-02 20:56:15,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:15,986 INFO L130 PetriNetUnfolder]: 40/696 cut-off events. [2022-11-02 20:56:15,986 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-02 20:56:15,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 696 events. 40/696 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3278 event pairs, 6 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 671. Up to 31 conditions per place. [2022-11-02 20:56:15,998 INFO L137 encePairwiseOnDemand]: 349/353 looper letters, 14 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2022-11-02 20:56:15,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 316 transitions, 676 flow [2022-11-02 20:56:15,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1008 transitions. [2022-11-02 20:56:16,001 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9518413597733711 [2022-11-02 20:56:16,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1008 transitions. [2022-11-02 20:56:16,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1008 transitions. [2022-11-02 20:56:16,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:16,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1008 transitions. [2022-11-02 20:56:16,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,008 INFO L175 Difference]: Start difference. First operand has 310 places, 314 transitions, 638 flow. Second operand 3 states and 1008 transitions. [2022-11-02 20:56:16,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 316 transitions, 676 flow [2022-11-02 20:56:16,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 316 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:16,015 INFO L231 Difference]: Finished difference. Result has 309 places, 314 transitions, 644 flow [2022-11-02 20:56:16,016 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=309, PETRI_TRANSITIONS=314} [2022-11-02 20:56:16,017 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -11 predicate places. [2022-11-02 20:56:16,017 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 314 transitions, 644 flow [2022-11-02 20:56:16,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:16,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:16,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:56:16,019 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:16,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash -920407241, now seen corresponding path program 1 times [2022-11-02 20:56:16,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:16,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709993954] [2022-11-02 20:56:16,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:16,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:16,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:16,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709993954] [2022-11-02 20:56:16,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709993954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:16,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:16,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:16,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596240768] [2022-11-02 20:56:16,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:16,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:16,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:16,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:16,069 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 353 [2022-11-02 20:56:16,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 314 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 328.6666666666667) internal successors, (986), 3 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:16,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 353 [2022-11-02 20:56:16,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:16,304 INFO L130 PetriNetUnfolder]: 86/1140 cut-off events. [2022-11-02 20:56:16,304 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:56:16,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 1140 events. 86/1140 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8079 event pairs, 10 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 1102. Up to 73 conditions per place. [2022-11-02 20:56:16,332 INFO L137 encePairwiseOnDemand]: 347/353 looper letters, 16 selfloop transitions, 3 changer transitions 0/316 dead transitions. [2022-11-02 20:56:16,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 316 transitions, 688 flow [2022-11-02 20:56:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1003 transitions. [2022-11-02 20:56:16,338 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.947119924457035 [2022-11-02 20:56:16,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1003 transitions. [2022-11-02 20:56:16,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1003 transitions. [2022-11-02 20:56:16,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:16,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1003 transitions. [2022-11-02 20:56:16,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,348 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,349 INFO L175 Difference]: Start difference. First operand has 309 places, 314 transitions, 644 flow. Second operand 3 states and 1003 transitions. [2022-11-02 20:56:16,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 316 transitions, 688 flow [2022-11-02 20:56:16,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 316 transitions, 688 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:56:16,355 INFO L231 Difference]: Finished difference. Result has 309 places, 314 transitions, 659 flow [2022-11-02 20:56:16,356 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=309, PETRI_TRANSITIONS=314} [2022-11-02 20:56:16,360 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -11 predicate places. [2022-11-02 20:56:16,361 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 314 transitions, 659 flow [2022-11-02 20:56:16,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.6666666666667) internal successors, (986), 3 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:16,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:16,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:56:16,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:16,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash -750471328, now seen corresponding path program 1 times [2022-11-02 20:56:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:16,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613112483] [2022-11-02 20:56:16,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:16,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:16,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:16,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613112483] [2022-11-02 20:56:16,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613112483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:16,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:16,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:16,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808551656] [2022-11-02 20:56:16,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:16,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:16,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:16,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:16,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:16,454 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 353 [2022-11-02 20:56:16,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 314 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:16,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 353 [2022-11-02 20:56:16,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:16,677 INFO L130 PetriNetUnfolder]: 37/884 cut-off events. [2022-11-02 20:56:16,677 INFO L131 PetriNetUnfolder]: For 13/17 co-relation queries the response was YES. [2022-11-02 20:56:16,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 884 events. 37/884 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4890 event pairs, 2 based on Foata normal form. 1/786 useless extension candidates. Maximal degree in co-relation 796. Up to 38 conditions per place. [2022-11-02 20:56:16,696 INFO L137 encePairwiseOnDemand]: 349/353 looper letters, 17 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2022-11-02 20:56:16,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 319 transitions, 712 flow [2022-11-02 20:56:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2022-11-02 20:56:16,701 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9546742209631728 [2022-11-02 20:56:16,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2022-11-02 20:56:16,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2022-11-02 20:56:16,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:16,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2022-11-02 20:56:16,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,712 INFO L175 Difference]: Start difference. First operand has 309 places, 314 transitions, 659 flow. Second operand 3 states and 1011 transitions. [2022-11-02 20:56:16,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 319 transitions, 712 flow [2022-11-02 20:56:16,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 319 transitions, 712 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:56:16,720 INFO L231 Difference]: Finished difference. Result has 310 places, 314 transitions, 669 flow [2022-11-02 20:56:16,721 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=310, PETRI_TRANSITIONS=314} [2022-11-02 20:56:16,722 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -10 predicate places. [2022-11-02 20:56:16,722 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 314 transitions, 669 flow [2022-11-02 20:56:16,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:16,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:16,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:56:16,724 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:16,725 INFO L85 PathProgramCache]: Analyzing trace with hash 351586115, now seen corresponding path program 1 times [2022-11-02 20:56:16,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:16,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913479105] [2022-11-02 20:56:16,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:16,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:16,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:16,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913479105] [2022-11-02 20:56:16,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913479105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:16,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:16,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478944524] [2022-11-02 20:56:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:16,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:16,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:16,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:16,824 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 353 [2022-11-02 20:56:16,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 314 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:16,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:16,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 353 [2022-11-02 20:56:16,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:17,133 INFO L130 PetriNetUnfolder]: 49/1222 cut-off events. [2022-11-02 20:56:17,135 INFO L131 PetriNetUnfolder]: For 16/20 co-relation queries the response was YES. [2022-11-02 20:56:17,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 1222 events. 49/1222 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8062 event pairs, 6 based on Foata normal form. 2/1090 useless extension candidates. Maximal degree in co-relation 1179. Up to 64 conditions per place. [2022-11-02 20:56:17,160 INFO L137 encePairwiseOnDemand]: 349/353 looper letters, 17 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2022-11-02 20:56:17,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 319 transitions, 722 flow [2022-11-02 20:56:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2022-11-02 20:56:17,164 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9546742209631728 [2022-11-02 20:56:17,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2022-11-02 20:56:17,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2022-11-02 20:56:17,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:17,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2022-11-02 20:56:17,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:17,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:17,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:17,172 INFO L175 Difference]: Start difference. First operand has 310 places, 314 transitions, 669 flow. Second operand 3 states and 1011 transitions. [2022-11-02 20:56:17,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 319 transitions, 722 flow [2022-11-02 20:56:17,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 319 transitions, 722 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:56:17,180 INFO L231 Difference]: Finished difference. Result has 311 places, 314 transitions, 679 flow [2022-11-02 20:56:17,182 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=311, PETRI_TRANSITIONS=314} [2022-11-02 20:56:17,182 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -9 predicate places. [2022-11-02 20:56:17,183 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 314 transitions, 679 flow [2022-11-02 20:56:17,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:17,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:17,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:17,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:56:17,184 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1353624928, now seen corresponding path program 1 times [2022-11-02 20:56:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:17,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190509038] [2022-11-02 20:56:17,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:17,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:17,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190509038] [2022-11-02 20:56:17,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190509038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:17,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:17,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:17,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477188938] [2022-11-02 20:56:17,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:17,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:17,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:17,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:17,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:17,260 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 353 [2022-11-02 20:56:17,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 314 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:17,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:17,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 353 [2022-11-02 20:56:17,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:17,992 INFO L130 PetriNetUnfolder]: 290/4041 cut-off events. [2022-11-02 20:56:17,992 INFO L131 PetriNetUnfolder]: For 69/141 co-relation queries the response was YES. [2022-11-02 20:56:18,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4537 conditions, 4041 events. 290/4041 cut-off events. For 69/141 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 40738 event pairs, 106 based on Foata normal form. 0/3539 useless extension candidates. Maximal degree in co-relation 3896. Up to 331 conditions per place. [2022-11-02 20:56:18,043 INFO L137 encePairwiseOnDemand]: 345/353 looper letters, 18 selfloop transitions, 4 changer transitions 0/316 dead transitions. [2022-11-02 20:56:18,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 316 transitions, 729 flow [2022-11-02 20:56:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 998 transitions. [2022-11-02 20:56:18,046 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9423984891406988 [2022-11-02 20:56:18,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 998 transitions. [2022-11-02 20:56:18,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 998 transitions. [2022-11-02 20:56:18,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:18,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 998 transitions. [2022-11-02 20:56:18,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 332.6666666666667) internal successors, (998), 3 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:18,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:18,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:18,053 INFO L175 Difference]: Start difference. First operand has 311 places, 314 transitions, 679 flow. Second operand 3 states and 998 transitions. [2022-11-02 20:56:18,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 316 transitions, 729 flow [2022-11-02 20:56:18,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 316 transitions, 729 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:56:18,060 INFO L231 Difference]: Finished difference. Result has 310 places, 314 transitions, 699 flow [2022-11-02 20:56:18,061 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=310, PETRI_TRANSITIONS=314} [2022-11-02 20:56:18,061 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -10 predicate places. [2022-11-02 20:56:18,061 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 314 transitions, 699 flow [2022-11-02 20:56:18,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:18,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:18,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:18,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:56:18,063 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:18,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash -449886492, now seen corresponding path program 1 times [2022-11-02 20:56:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:18,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380902177] [2022-11-02 20:56:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:18,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:18,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:18,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380902177] [2022-11-02 20:56:18,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380902177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:18,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:18,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:18,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513333246] [2022-11-02 20:56:18,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:18,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:18,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:18,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:18,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:18,101 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 353 [2022-11-02 20:56:18,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 314 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:18,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:18,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 353 [2022-11-02 20:56:18,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:18,475 INFO L130 PetriNetUnfolder]: 100/1969 cut-off events. [2022-11-02 20:56:18,475 INFO L131 PetriNetUnfolder]: For 10/18 co-relation queries the response was YES. [2022-11-02 20:56:18,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2214 conditions, 1969 events. 100/1969 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 15833 event pairs, 8 based on Foata normal form. 1/1745 useless extension candidates. Maximal degree in co-relation 1898. Up to 66 conditions per place. [2022-11-02 20:56:18,507 INFO L137 encePairwiseOnDemand]: 350/353 looper letters, 13 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2022-11-02 20:56:18,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 315 transitions, 733 flow [2022-11-02 20:56:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1009 transitions. [2022-11-02 20:56:18,510 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9527856468366384 [2022-11-02 20:56:18,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1009 transitions. [2022-11-02 20:56:18,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1009 transitions. [2022-11-02 20:56:18,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:18,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1009 transitions. [2022-11-02 20:56:18,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:18,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:18,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:18,516 INFO L175 Difference]: Start difference. First operand has 310 places, 314 transitions, 699 flow. Second operand 3 states and 1009 transitions. [2022-11-02 20:56:18,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 315 transitions, 733 flow [2022-11-02 20:56:18,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 315 transitions, 733 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:56:18,522 INFO L231 Difference]: Finished difference. Result has 311 places, 313 transitions, 701 flow [2022-11-02 20:56:18,523 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=311, PETRI_TRANSITIONS=313} [2022-11-02 20:56:18,524 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -9 predicate places. [2022-11-02 20:56:18,524 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 313 transitions, 701 flow [2022-11-02 20:56:18,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:18,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:18,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:18,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:56:18,525 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:18,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash 206692731, now seen corresponding path program 1 times [2022-11-02 20:56:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:18,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48270527] [2022-11-02 20:56:18,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:18,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:18,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:18,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48270527] [2022-11-02 20:56:18,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48270527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:18,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:18,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109123966] [2022-11-02 20:56:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:18,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:18,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:18,564 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 353 [2022-11-02 20:56:18,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 313 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:18,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:18,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 353 [2022-11-02 20:56:18,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:19,049 INFO L130 PetriNetUnfolder]: 129/2797 cut-off events. [2022-11-02 20:56:19,049 INFO L131 PetriNetUnfolder]: For 42/46 co-relation queries the response was YES. [2022-11-02 20:56:19,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3105 conditions, 2797 events. 129/2797 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24845 event pairs, 16 based on Foata normal form. 0/2522 useless extension candidates. Maximal degree in co-relation 2653. Up to 168 conditions per place. [2022-11-02 20:56:19,088 INFO L137 encePairwiseOnDemand]: 349/353 looper letters, 16 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2022-11-02 20:56:19,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 317 transitions, 749 flow [2022-11-02 20:56:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2022-11-02 20:56:19,091 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9537299338999056 [2022-11-02 20:56:19,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1010 transitions. [2022-11-02 20:56:19,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1010 transitions. [2022-11-02 20:56:19,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:19,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1010 transitions. [2022-11-02 20:56:19,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:19,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:19,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:19,098 INFO L175 Difference]: Start difference. First operand has 311 places, 313 transitions, 701 flow. Second operand 3 states and 1010 transitions. [2022-11-02 20:56:19,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 317 transitions, 749 flow [2022-11-02 20:56:19,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 317 transitions, 745 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:19,104 INFO L231 Difference]: Finished difference. Result has 310 places, 313 transitions, 707 flow [2022-11-02 20:56:19,105 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=707, PETRI_PLACES=310, PETRI_TRANSITIONS=313} [2022-11-02 20:56:19,105 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -10 predicate places. [2022-11-02 20:56:19,105 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 313 transitions, 707 flow [2022-11-02 20:56:19,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:19,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:19,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:19,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:56:19,107 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:19,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:19,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1125361500, now seen corresponding path program 1 times [2022-11-02 20:56:19,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:19,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955416188] [2022-11-02 20:56:19,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:19,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:19,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955416188] [2022-11-02 20:56:19,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955416188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:19,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:19,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979822455] [2022-11-02 20:56:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:19,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:19,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:19,155 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 353 [2022-11-02 20:56:19,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 313 transitions, 707 flow. Second operand has 3 states, 3 states have (on average 332.6666666666667) internal successors, (998), 3 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:19,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:19,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 353 [2022-11-02 20:56:19,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:19,728 INFO L130 PetriNetUnfolder]: 131/2580 cut-off events. [2022-11-02 20:56:19,728 INFO L131 PetriNetUnfolder]: For 29/46 co-relation queries the response was YES. [2022-11-02 20:56:19,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 2580 events. 131/2580 cut-off events. For 29/46 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 22809 event pairs, 22 based on Foata normal form. 0/2324 useless extension candidates. Maximal degree in co-relation 2462. Up to 90 conditions per place. [2022-11-02 20:56:19,770 INFO L137 encePairwiseOnDemand]: 350/353 looper letters, 13 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2022-11-02 20:56:19,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 314 transitions, 741 flow [2022-11-02 20:56:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1009 transitions. [2022-11-02 20:56:19,773 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9527856468366384 [2022-11-02 20:56:19,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1009 transitions. [2022-11-02 20:56:19,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1009 transitions. [2022-11-02 20:56:19,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:19,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1009 transitions. [2022-11-02 20:56:19,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:19,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:19,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:19,780 INFO L175 Difference]: Start difference. First operand has 310 places, 313 transitions, 707 flow. Second operand 3 states and 1009 transitions. [2022-11-02 20:56:19,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 314 transitions, 741 flow [2022-11-02 20:56:19,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 314 transitions, 741 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:56:19,788 INFO L231 Difference]: Finished difference. Result has 311 places, 312 transitions, 709 flow [2022-11-02 20:56:19,789 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=709, PETRI_PLACES=311, PETRI_TRANSITIONS=312} [2022-11-02 20:56:19,790 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -9 predicate places. [2022-11-02 20:56:19,790 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 312 transitions, 709 flow [2022-11-02 20:56:19,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.6666666666667) internal successors, (998), 3 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:19,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:19,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:19,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:56:19,791 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:19,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash 941321680, now seen corresponding path program 1 times [2022-11-02 20:56:19,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:19,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403837034] [2022-11-02 20:56:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:20,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:20,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403837034] [2022-11-02 20:56:20,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403837034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:20,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:20,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:56:20,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536954452] [2022-11-02 20:56:20,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:20,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:20,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:20,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:20,286 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 353 [2022-11-02 20:56:20,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 312 transitions, 709 flow. Second operand has 6 states, 6 states have (on average 317.0) internal successors, (1902), 6 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:20,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:20,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 353 [2022-11-02 20:56:20,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:20,658 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([980] thread3EXIT-->L77-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem36#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][295], [406#true, Black: 382#true, 403#(= |#race~to_int_5~0| 0), Black: 387#true, 394#(= |#race~length_4~0| 0), Black: 392#true, 65#L77-7true, Black: 401#true, 389#(= |#race~to_int_3~0| 0), Black: 372#true, 384#(= |#race~to_int_1~0| 0), 415#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 374#(= |#race~length_0~0| 0), 379#(= |#race~length_2~0| 0), Black: 377#true]) [2022-11-02 20:56:20,659 INFO L383 tUnfolder$Statistics]: this new event has 216 ancestors and is not cut-off event [2022-11-02 20:56:20,659 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is not cut-off event [2022-11-02 20:56:20,659 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is not cut-off event [2022-11-02 20:56:20,659 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is not cut-off event [2022-11-02 20:56:20,662 INFO L130 PetriNetUnfolder]: 65/1617 cut-off events. [2022-11-02 20:56:20,662 INFO L131 PetriNetUnfolder]: For 2/24 co-relation queries the response was YES. [2022-11-02 20:56:20,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 1617 events. 65/1617 cut-off events. For 2/24 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 12112 event pairs, 0 based on Foata normal form. 8/1465 useless extension candidates. Maximal degree in co-relation 1616. Up to 52 conditions per place. [2022-11-02 20:56:20,692 INFO L137 encePairwiseOnDemand]: 348/353 looper letters, 23 selfloop transitions, 4 changer transitions 0/311 dead transitions. [2022-11-02 20:56:20,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 311 transitions, 761 flow [2022-11-02 20:56:20,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:56:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:56:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1918 transitions. [2022-11-02 20:56:20,698 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9055712936732767 [2022-11-02 20:56:20,698 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1918 transitions. [2022-11-02 20:56:20,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1918 transitions. [2022-11-02 20:56:20,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:20,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1918 transitions. [2022-11-02 20:56:20,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 319.6666666666667) internal successors, (1918), 6 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:20,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:20,709 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:20,709 INFO L175 Difference]: Start difference. First operand has 311 places, 312 transitions, 709 flow. Second operand 6 states and 1918 transitions. [2022-11-02 20:56:20,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 311 transitions, 761 flow [2022-11-02 20:56:20,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 311 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:20,717 INFO L231 Difference]: Finished difference. Result has 313 places, 311 transitions, 711 flow [2022-11-02 20:56:20,719 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=313, PETRI_TRANSITIONS=311} [2022-11-02 20:56:20,719 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -7 predicate places. [2022-11-02 20:56:20,719 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 311 transitions, 711 flow [2022-11-02 20:56:20,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 317.0) internal successors, (1902), 6 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:20,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:20,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:20,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:56:20,721 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:20,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:20,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1918847080, now seen corresponding path program 1 times [2022-11-02 20:56:20,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:20,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669850970] [2022-11-02 20:56:20,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:20,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:20,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:20,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669850970] [2022-11-02 20:56:20,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669850970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:20,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:20,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126367287] [2022-11-02 20:56:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:20,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:20,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:20,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:20,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:20,771 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 353 [2022-11-02 20:56:20,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 311 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:20,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:20,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 353 [2022-11-02 20:56:20,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:21,200 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([932] L55-28-->L55-29: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet15#1=|v_thread3Thread1of1ForFork1_#t~nondet15#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet15#1][205], [Black: 382#true, Black: 387#true, 403#(= |#race~to_int_5~0| 0), 394#(= |#race~length_4~0| 0), Black: 392#true, 94#L76-7true, 417#true, Black: 401#true, 389#(= |#race~to_int_3~0| 0), Black: 372#true, 384#(= |#race~to_int_1~0| 0), 415#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 374#(= |#race~length_0~0| 0), 379#(= |#race~length_2~0| 0), Black: 377#true, 293#L55-29true]) [2022-11-02 20:56:21,200 INFO L383 tUnfolder$Statistics]: this new event has 225 ancestors and is cut-off event [2022-11-02 20:56:21,201 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:56:21,201 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:56:21,201 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:56:21,214 INFO L130 PetriNetUnfolder]: 150/1965 cut-off events. [2022-11-02 20:56:21,214 INFO L131 PetriNetUnfolder]: For 95/105 co-relation queries the response was YES. [2022-11-02 20:56:21,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 1965 events. 150/1965 cut-off events. For 95/105 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 16511 event pairs, 36 based on Foata normal form. 1/1788 useless extension candidates. Maximal degree in co-relation 2325. Up to 165 conditions per place. [2022-11-02 20:56:21,239 INFO L137 encePairwiseOnDemand]: 350/353 looper letters, 12 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2022-11-02 20:56:21,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 312 transitions, 743 flow [2022-11-02 20:56:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1008 transitions. [2022-11-02 20:56:21,243 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9518413597733711 [2022-11-02 20:56:21,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1008 transitions. [2022-11-02 20:56:21,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1008 transitions. [2022-11-02 20:56:21,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:21,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1008 transitions. [2022-11-02 20:56:21,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:21,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:21,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:21,250 INFO L175 Difference]: Start difference. First operand has 313 places, 311 transitions, 711 flow. Second operand 3 states and 1008 transitions. [2022-11-02 20:56:21,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 312 transitions, 743 flow [2022-11-02 20:56:21,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 312 transitions, 736 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:56:21,258 INFO L231 Difference]: Finished difference. Result has 310 places, 310 transitions, 706 flow [2022-11-02 20:56:21,259 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=310, PETRI_TRANSITIONS=310} [2022-11-02 20:56:21,259 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -10 predicate places. [2022-11-02 20:56:21,260 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 310 transitions, 706 flow [2022-11-02 20:56:21,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:21,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:21,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:21,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:56:21,261 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:21,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:21,262 INFO L85 PathProgramCache]: Analyzing trace with hash 300678719, now seen corresponding path program 1 times [2022-11-02 20:56:21,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:21,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60922036] [2022-11-02 20:56:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:21,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:21,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60922036] [2022-11-02 20:56:21,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60922036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:21,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:21,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:56:21,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289319565] [2022-11-02 20:56:21,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:21,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:21,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:21,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:21,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:21,887 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 353 [2022-11-02 20:56:21,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 310 transitions, 706 flow. Second operand has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:21,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:21,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 353 [2022-11-02 20:56:21,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:22,270 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([980] thread3EXIT-->L77-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem36#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][293], [Black: 382#true, 403#(= |#race~to_int_5~0| 0), Black: 387#true, 394#(= |#race~length_4~0| 0), 426#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 392#true, 65#L77-7true, 417#true, Black: 401#true, 389#(= |#race~to_int_3~0| 0), Black: 372#true, 384#(= |#race~to_int_1~0| 0), 415#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 374#(= |#race~length_0~0| 0), 379#(= |#race~length_2~0| 0), Black: 377#true]) [2022-11-02 20:56:22,270 INFO L383 tUnfolder$Statistics]: this new event has 216 ancestors and is not cut-off event [2022-11-02 20:56:22,271 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is not cut-off event [2022-11-02 20:56:22,271 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is not cut-off event [2022-11-02 20:56:22,271 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is not cut-off event [2022-11-02 20:56:22,273 INFO L130 PetriNetUnfolder]: 65/1586 cut-off events. [2022-11-02 20:56:22,273 INFO L131 PetriNetUnfolder]: For 2/23 co-relation queries the response was YES. [2022-11-02 20:56:22,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 1586 events. 65/1586 cut-off events. For 2/23 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 11767 event pairs, 0 based on Foata normal form. 4/1461 useless extension candidates. Maximal degree in co-relation 1758. Up to 42 conditions per place. [2022-11-02 20:56:22,297 INFO L137 encePairwiseOnDemand]: 348/353 looper letters, 22 selfloop transitions, 4 changer transitions 0/309 dead transitions. [2022-11-02 20:56:22,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 309 transitions, 756 flow [2022-11-02 20:56:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:56:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:56:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1917 transitions. [2022-11-02 20:56:22,302 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9050991501416431 [2022-11-02 20:56:22,302 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1917 transitions. [2022-11-02 20:56:22,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1917 transitions. [2022-11-02 20:56:22,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:22,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1917 transitions. [2022-11-02 20:56:22,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 319.5) internal successors, (1917), 6 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:22,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:22,312 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:22,312 INFO L175 Difference]: Start difference. First operand has 310 places, 310 transitions, 706 flow. Second operand 6 states and 1917 transitions. [2022-11-02 20:56:22,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 309 transitions, 756 flow [2022-11-02 20:56:22,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 309 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:22,319 INFO L231 Difference]: Finished difference. Result has 312 places, 309 transitions, 708 flow [2022-11-02 20:56:22,319 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=708, PETRI_PLACES=312, PETRI_TRANSITIONS=309} [2022-11-02 20:56:22,320 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -8 predicate places. [2022-11-02 20:56:22,320 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 309 transitions, 708 flow [2022-11-02 20:56:22,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:22,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:22,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:22,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:56:22,321 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:22,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1657511929, now seen corresponding path program 1 times [2022-11-02 20:56:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:22,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901470073] [2022-11-02 20:56:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:22,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:22,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901470073] [2022-11-02 20:56:22,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901470073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:22,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:22,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:56:22,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029933541] [2022-11-02 20:56:22,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:22,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:22,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:22,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:22,871 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 353 [2022-11-02 20:56:22,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 309 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:22,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:22,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 353 [2022-11-02 20:56:22,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:23,348 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([980] thread3EXIT-->L77-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem36#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][292], [Black: 382#true, 433#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 387#true, 403#(= |#race~to_int_5~0| 0), 394#(= |#race~length_4~0| 0), 426#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 392#true, 65#L77-7true, Black: 401#true, 389#(= |#race~to_int_3~0| 0), Black: 372#true, 384#(= |#race~to_int_1~0| 0), 415#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 374#(= |#race~length_0~0| 0), 379#(= |#race~length_2~0| 0), Black: 377#true]) [2022-11-02 20:56:23,348 INFO L383 tUnfolder$Statistics]: this new event has 216 ancestors and is not cut-off event [2022-11-02 20:56:23,349 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is not cut-off event [2022-11-02 20:56:23,349 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is not cut-off event [2022-11-02 20:56:23,349 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is not cut-off event [2022-11-02 20:56:23,352 INFO L130 PetriNetUnfolder]: 65/1582 cut-off events. [2022-11-02 20:56:23,352 INFO L131 PetriNetUnfolder]: For 4/25 co-relation queries the response was YES. [2022-11-02 20:56:23,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 1582 events. 65/1582 cut-off events. For 4/25 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 11718 event pairs, 0 based on Foata normal form. 0/1457 useless extension candidates. Maximal degree in co-relation 1702. Up to 42 conditions per place. [2022-11-02 20:56:23,381 INFO L137 encePairwiseOnDemand]: 348/353 looper letters, 21 selfloop transitions, 4 changer transitions 0/308 dead transitions. [2022-11-02 20:56:23,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 308 transitions, 756 flow [2022-11-02 20:56:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:56:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:56:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1916 transitions. [2022-11-02 20:56:23,389 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9046270066100094 [2022-11-02 20:56:23,389 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1916 transitions. [2022-11-02 20:56:23,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1916 transitions. [2022-11-02 20:56:23,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:23,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1916 transitions. [2022-11-02 20:56:23,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 319.3333333333333) internal successors, (1916), 6 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:23,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:23,402 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:23,402 INFO L175 Difference]: Start difference. First operand has 312 places, 309 transitions, 708 flow. Second operand 6 states and 1916 transitions. [2022-11-02 20:56:23,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 308 transitions, 756 flow [2022-11-02 20:56:23,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 308 transitions, 749 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:56:23,410 INFO L231 Difference]: Finished difference. Result has 312 places, 308 transitions, 707 flow [2022-11-02 20:56:23,411 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=707, PETRI_PLACES=312, PETRI_TRANSITIONS=308} [2022-11-02 20:56:23,411 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -8 predicate places. [2022-11-02 20:56:23,411 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 308 transitions, 707 flow [2022-11-02 20:56:23,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 319.0) internal successors, (1914), 6 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:23,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:23,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:23,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:56:23,413 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:23,414 INFO L85 PathProgramCache]: Analyzing trace with hash 669199899, now seen corresponding path program 1 times [2022-11-02 20:56:23,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:23,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615456595] [2022-11-02 20:56:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:23,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:23,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615456595] [2022-11-02 20:56:23,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615456595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:23,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:23,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:56:23,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762067098] [2022-11-02 20:56:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:23,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:23,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:23,507 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 353 [2022-11-02 20:56:23,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 308 transitions, 707 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:23,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:23,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 353 [2022-11-02 20:56:23,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:24,348 INFO L130 PetriNetUnfolder]: 190/4457 cut-off events. [2022-11-02 20:56:24,349 INFO L131 PetriNetUnfolder]: For 30/46 co-relation queries the response was YES. [2022-11-02 20:56:24,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5084 conditions, 4457 events. 190/4457 cut-off events. For 30/46 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 46497 event pairs, 18 based on Foata normal form. 1/4155 useless extension candidates. Maximal degree in co-relation 4836. Up to 126 conditions per place. [2022-11-02 20:56:24,406 INFO L137 encePairwiseOnDemand]: 345/353 looper letters, 17 selfloop transitions, 5 changer transitions 0/316 dead transitions. [2022-11-02 20:56:24,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 316 transitions, 772 flow [2022-11-02 20:56:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2022-11-02 20:56:24,410 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9612842304060434 [2022-11-02 20:56:24,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1018 transitions. [2022-11-02 20:56:24,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1018 transitions. [2022-11-02 20:56:24,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:24,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1018 transitions. [2022-11-02 20:56:24,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:24,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:24,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:24,416 INFO L175 Difference]: Start difference. First operand has 312 places, 308 transitions, 707 flow. Second operand 3 states and 1018 transitions. [2022-11-02 20:56:24,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 316 transitions, 772 flow [2022-11-02 20:56:24,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 316 transitions, 765 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:56:24,423 INFO L231 Difference]: Finished difference. Result has 312 places, 311 transitions, 738 flow [2022-11-02 20:56:24,424 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=312, PETRI_TRANSITIONS=311} [2022-11-02 20:56:24,424 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -8 predicate places. [2022-11-02 20:56:24,425 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 311 transitions, 738 flow [2022-11-02 20:56:24,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:24,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:24,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:24,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:56:24,426 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:24,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:24,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1239258195, now seen corresponding path program 2 times [2022-11-02 20:56:24,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:24,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559858863] [2022-11-02 20:56:24,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:24,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:24,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:24,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559858863] [2022-11-02 20:56:24,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559858863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:24,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:24,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:56:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016588887] [2022-11-02 20:56:24,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:24,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:24,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:24,490 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 353 [2022-11-02 20:56:24,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 311 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:24,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:24,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 353 [2022-11-02 20:56:24,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:25,072 INFO L130 PetriNetUnfolder]: 149/3488 cut-off events. [2022-11-02 20:56:25,072 INFO L131 PetriNetUnfolder]: For 113/126 co-relation queries the response was YES. [2022-11-02 20:56:25,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4026 conditions, 3488 events. 149/3488 cut-off events. For 113/126 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 33637 event pairs, 14 based on Foata normal form. 10/3277 useless extension candidates. Maximal degree in co-relation 3581. Up to 100 conditions per place. [2022-11-02 20:56:25,134 INFO L137 encePairwiseOnDemand]: 347/353 looper letters, 22 selfloop transitions, 3 changer transitions 0/319 dead transitions. [2022-11-02 20:56:25,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 319 transitions, 815 flow [2022-11-02 20:56:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2022-11-02 20:56:25,138 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9612842304060434 [2022-11-02 20:56:25,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1018 transitions. [2022-11-02 20:56:25,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1018 transitions. [2022-11-02 20:56:25,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:25,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1018 transitions. [2022-11-02 20:56:25,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:25,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:25,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:25,144 INFO L175 Difference]: Start difference. First operand has 312 places, 311 transitions, 738 flow. Second operand 3 states and 1018 transitions. [2022-11-02 20:56:25,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 319 transitions, 815 flow [2022-11-02 20:56:25,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 319 transitions, 805 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:25,152 INFO L231 Difference]: Finished difference. Result has 314 places, 314 transitions, 764 flow [2022-11-02 20:56:25,152 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=314, PETRI_TRANSITIONS=314} [2022-11-02 20:56:25,153 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -6 predicate places. [2022-11-02 20:56:25,153 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 314 transitions, 764 flow [2022-11-02 20:56:25,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:25,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:25,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:25,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:56:25,155 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:25,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:25,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1386185575, now seen corresponding path program 1 times [2022-11-02 20:56:25,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:25,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179075314] [2022-11-02 20:56:25,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:25,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:25,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:25,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179075314] [2022-11-02 20:56:25,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179075314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:25,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:25,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668073632] [2022-11-02 20:56:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:25,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:25,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:25,227 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 353 [2022-11-02 20:56:25,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 314 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:25,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:25,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 353 [2022-11-02 20:56:25,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:25,763 INFO L130 PetriNetUnfolder]: 119/2831 cut-off events. [2022-11-02 20:56:25,763 INFO L131 PetriNetUnfolder]: For 45/70 co-relation queries the response was YES. [2022-11-02 20:56:25,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 2831 events. 119/2831 cut-off events. For 45/70 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 26049 event pairs, 12 based on Foata normal form. 0/2627 useless extension candidates. Maximal degree in co-relation 2885. Up to 83 conditions per place. [2022-11-02 20:56:25,811 INFO L137 encePairwiseOnDemand]: 351/353 looper letters, 9 selfloop transitions, 1 changer transitions 0/313 dead transitions. [2022-11-02 20:56:25,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 313 transitions, 782 flow [2022-11-02 20:56:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2022-11-02 20:56:25,815 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9537299338999056 [2022-11-02 20:56:25,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1010 transitions. [2022-11-02 20:56:25,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1010 transitions. [2022-11-02 20:56:25,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:25,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1010 transitions. [2022-11-02 20:56:25,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:25,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:25,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:25,821 INFO L175 Difference]: Start difference. First operand has 314 places, 314 transitions, 764 flow. Second operand 3 states and 1010 transitions. [2022-11-02 20:56:25,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 313 transitions, 782 flow [2022-11-02 20:56:25,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 313 transitions, 773 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-02 20:56:25,828 INFO L231 Difference]: Finished difference. Result has 314 places, 313 transitions, 755 flow [2022-11-02 20:56:25,829 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=314, PETRI_TRANSITIONS=313} [2022-11-02 20:56:25,829 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -6 predicate places. [2022-11-02 20:56:25,830 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 313 transitions, 755 flow [2022-11-02 20:56:25,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:25,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:25,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:25,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:56:25,831 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash 497007901, now seen corresponding path program 1 times [2022-11-02 20:56:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:25,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116546551] [2022-11-02 20:56:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:25,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116546551] [2022-11-02 20:56:25,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116546551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:25,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:25,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:56:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228812205] [2022-11-02 20:56:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:25,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:25,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:25,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:25,945 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 353 [2022-11-02 20:56:25,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 313 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:25,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:25,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 353 [2022-11-02 20:56:25,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:26,792 INFO L130 PetriNetUnfolder]: 137/4451 cut-off events. [2022-11-02 20:56:26,793 INFO L131 PetriNetUnfolder]: For 57/78 co-relation queries the response was YES. [2022-11-02 20:56:26,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5085 conditions, 4451 events. 137/4451 cut-off events. For 57/78 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 45977 event pairs, 11 based on Foata normal form. 0/4188 useless extension candidates. Maximal degree in co-relation 4934. Up to 102 conditions per place. [2022-11-02 20:56:26,863 INFO L137 encePairwiseOnDemand]: 349/353 looper letters, 17 selfloop transitions, 2 changer transitions 0/320 dead transitions. [2022-11-02 20:56:26,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 320 transitions, 812 flow [2022-11-02 20:56:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1020 transitions. [2022-11-02 20:56:26,867 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9631728045325779 [2022-11-02 20:56:26,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1020 transitions. [2022-11-02 20:56:26,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1020 transitions. [2022-11-02 20:56:26,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:26,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1020 transitions. [2022-11-02 20:56:26,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:26,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:26,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:26,875 INFO L175 Difference]: Start difference. First operand has 314 places, 313 transitions, 755 flow. Second operand 3 states and 1020 transitions. [2022-11-02 20:56:26,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 320 transitions, 812 flow [2022-11-02 20:56:26,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 320 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:56:26,882 INFO L231 Difference]: Finished difference. Result has 317 places, 315 transitions, 774 flow [2022-11-02 20:56:26,883 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=317, PETRI_TRANSITIONS=315} [2022-11-02 20:56:26,883 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -3 predicate places. [2022-11-02 20:56:26,884 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 315 transitions, 774 flow [2022-11-02 20:56:26,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:26,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:26,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:26,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:56:26,885 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:26,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:26,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1945460356, now seen corresponding path program 1 times [2022-11-02 20:56:26,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:26,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335913652] [2022-11-02 20:56:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:26,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:26,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:26,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335913652] [2022-11-02 20:56:26,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335913652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:26,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:26,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:56:26,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63499190] [2022-11-02 20:56:26,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:26,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:26,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:26,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:26,970 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 353 [2022-11-02 20:56:26,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 315 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:26,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:26,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 353 [2022-11-02 20:56:26,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:27,583 INFO L130 PetriNetUnfolder]: 103/3290 cut-off events. [2022-11-02 20:56:27,583 INFO L131 PetriNetUnfolder]: For 89/113 co-relation queries the response was YES. [2022-11-02 20:56:27,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3782 conditions, 3290 events. 103/3290 cut-off events. For 89/113 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 30746 event pairs, 12 based on Foata normal form. 8/3104 useless extension candidates. Maximal degree in co-relation 3380. Up to 82 conditions per place. [2022-11-02 20:56:27,620 INFO L137 encePairwiseOnDemand]: 347/353 looper letters, 17 selfloop transitions, 4 changer transitions 0/322 dead transitions. [2022-11-02 20:56:27,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 322 transitions, 839 flow [2022-11-02 20:56:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1020 transitions. [2022-11-02 20:56:27,623 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9631728045325779 [2022-11-02 20:56:27,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1020 transitions. [2022-11-02 20:56:27,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1020 transitions. [2022-11-02 20:56:27,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:27,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1020 transitions. [2022-11-02 20:56:27,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:27,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:27,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:27,629 INFO L175 Difference]: Start difference. First operand has 317 places, 315 transitions, 774 flow. Second operand 3 states and 1020 transitions. [2022-11-02 20:56:27,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 322 transitions, 839 flow [2022-11-02 20:56:27,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 322 transitions, 837 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:56:27,637 INFO L231 Difference]: Finished difference. Result has 320 places, 317 transitions, 804 flow [2022-11-02 20:56:27,637 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=320, PETRI_TRANSITIONS=317} [2022-11-02 20:56:27,638 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, 0 predicate places. [2022-11-02 20:56:27,638 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 317 transitions, 804 flow [2022-11-02 20:56:27,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:27,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:27,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:27,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:56:27,640 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:27,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2065504611, now seen corresponding path program 1 times [2022-11-02 20:56:27,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:27,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846796267] [2022-11-02 20:56:27,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:27,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:27,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:27,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846796267] [2022-11-02 20:56:27,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846796267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:27,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:27,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:27,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233671278] [2022-11-02 20:56:27,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:27,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:27,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:27,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:27,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:27,706 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 353 [2022-11-02 20:56:27,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 317 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:27,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:27,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 353 [2022-11-02 20:56:27,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:28,331 INFO L130 PetriNetUnfolder]: 129/3978 cut-off events. [2022-11-02 20:56:28,331 INFO L131 PetriNetUnfolder]: For 83/132 co-relation queries the response was YES. [2022-11-02 20:56:28,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4667 conditions, 3978 events. 129/3978 cut-off events. For 83/132 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 40866 event pairs, 44 based on Foata normal form. 0/3752 useless extension candidates. Maximal degree in co-relation 3974. Up to 142 conditions per place. [2022-11-02 20:56:28,423 INFO L137 encePairwiseOnDemand]: 351/353 looper letters, 9 selfloop transitions, 1 changer transitions 0/316 dead transitions. [2022-11-02 20:56:28,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 316 transitions, 822 flow [2022-11-02 20:56:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2022-11-02 20:56:28,427 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9537299338999056 [2022-11-02 20:56:28,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1010 transitions. [2022-11-02 20:56:28,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1010 transitions. [2022-11-02 20:56:28,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:28,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1010 transitions. [2022-11-02 20:56:28,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:28,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:28,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:28,436 INFO L175 Difference]: Start difference. First operand has 320 places, 317 transitions, 804 flow. Second operand 3 states and 1010 transitions. [2022-11-02 20:56:28,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 316 transitions, 822 flow [2022-11-02 20:56:28,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 810 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-02 20:56:28,443 INFO L231 Difference]: Finished difference. Result has 319 places, 316 transitions, 792 flow [2022-11-02 20:56:28,443 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=319, PETRI_TRANSITIONS=316} [2022-11-02 20:56:28,444 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -1 predicate places. [2022-11-02 20:56:28,444 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 316 transitions, 792 flow [2022-11-02 20:56:28,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:28,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:56:28,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:28,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:56:28,446 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2022-11-02 20:56:28,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1050777468, now seen corresponding path program 1 times [2022-11-02 20:56:28,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:28,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177064745] [2022-11-02 20:56:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:28,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:28,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:28,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177064745] [2022-11-02 20:56:28,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177064745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:28,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:28,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:28,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661054809] [2022-11-02 20:56:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:28,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:28,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:28,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:28,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:28,523 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 353 [2022-11-02 20:56:28,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:28,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:56:28,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 353 [2022-11-02 20:56:28,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:56:29,015 INFO L130 PetriNetUnfolder]: 103/2541 cut-off events. [2022-11-02 20:56:29,016 INFO L131 PetriNetUnfolder]: For 69/86 co-relation queries the response was YES. [2022-11-02 20:56:29,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3060 conditions, 2541 events. 103/2541 cut-off events. For 69/86 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 23071 event pairs, 40 based on Foata normal form. 14/2390 useless extension candidates. Maximal degree in co-relation 2991. Up to 203 conditions per place. [2022-11-02 20:56:29,059 INFO L137 encePairwiseOnDemand]: 351/353 looper letters, 0 selfloop transitions, 0 changer transitions 315/315 dead transitions. [2022-11-02 20:56:29,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 315 transitions, 808 flow [2022-11-02 20:56:29,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:56:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1009 transitions. [2022-11-02 20:56:29,062 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9527856468366384 [2022-11-02 20:56:29,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1009 transitions. [2022-11-02 20:56:29,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1009 transitions. [2022-11-02 20:56:29,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:56:29,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1009 transitions. [2022-11-02 20:56:29,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:29,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:29,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:29,071 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 792 flow. Second operand 3 states and 1009 transitions. [2022-11-02 20:56:29,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 315 transitions, 808 flow [2022-11-02 20:56:29,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 315 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:56:29,076 INFO L231 Difference]: Finished difference. Result has 319 places, 0 transitions, 0 flow [2022-11-02 20:56:29,077 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=319, PETRI_TRANSITIONS=0} [2022-11-02 20:56:29,077 INFO L287 CegarLoopForPetriNet]: 320 programPoint places, -1 predicate places. [2022-11-02 20:56:29,077 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 0 transitions, 0 flow [2022-11-02 20:56:29,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:29,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2022-11-02 20:56:29,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2022-11-02 20:56:29,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2022-11-02 20:56:29,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2022-11-02 20:56:29,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2022-11-02 20:56:29,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2022-11-02 20:56:29,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2022-11-02 20:56:29,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2022-11-02 20:56:29,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2022-11-02 20:56:29,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2022-11-02 20:56:29,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2022-11-02 20:56:29,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2022-11-02 20:56:29,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2022-11-02 20:56:29,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2022-11-02 20:56:29,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2022-11-02 20:56:29,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2022-11-02 20:56:29,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2022-11-02 20:56:29,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2022-11-02 20:56:29,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2022-11-02 20:56:29,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2022-11-02 20:56:29,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2022-11-02 20:56:29,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2022-11-02 20:56:29,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2022-11-02 20:56:29,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2022-11-02 20:56:29,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2022-11-02 20:56:29,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2022-11-02 20:56:29,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2022-11-02 20:56:29,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2022-11-02 20:56:29,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2022-11-02 20:56:29,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2022-11-02 20:56:29,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 51 remaining) [2022-11-02 20:56:29,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining) [2022-11-02 20:56:29,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2022-11-02 20:56:29,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2022-11-02 20:56:29,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2022-11-02 20:56:29,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2022-11-02 20:56:29,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2022-11-02 20:56:29,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2022-11-02 20:56:29,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2022-11-02 20:56:29,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2022-11-02 20:56:29,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2022-11-02 20:56:29,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2022-11-02 20:56:29,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2022-11-02 20:56:29,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2022-11-02 20:56:29,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2022-11-02 20:56:29,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2022-11-02 20:56:29,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2022-11-02 20:56:29,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2022-11-02 20:56:29,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2022-11-02 20:56:29,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2022-11-02 20:56:29,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2022-11-02 20:56:29,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:56:29,093 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:29,100 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:56:29,100 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:56:29,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:56:29 BasicIcfg [2022-11-02 20:56:29,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:56:29,109 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:56:29,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:56:29,109 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:56:29,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:12" (3/4) ... [2022-11-02 20:56:29,113 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:56:29,119 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:56:29,119 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:56:29,119 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:56:29,127 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-02 20:56:29,128 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:56:29,128 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:56:29,128 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:56:29,190 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:56:29,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:56:29,191 INFO L158 Benchmark]: Toolchain (without parser) took 18114.67ms. Allocated memory was 132.1MB in the beginning and 589.3MB in the end (delta: 457.2MB). Free memory was 94.3MB in the beginning and 306.8MB in the end (delta: -212.5MB). Peak memory consumption was 245.1MB. Max. memory is 16.1GB. [2022-11-02 20:56:29,192 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 132.1MB. Free memory was 102.3MB in the beginning and 102.3MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:56:29,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.06ms. Allocated memory is still 132.1MB. Free memory was 94.1MB in the beginning and 103.8MB in the end (delta: -9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:56:29,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.86ms. Allocated memory is still 132.1MB. Free memory was 103.8MB in the beginning and 101.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:56:29,193 INFO L158 Benchmark]: Boogie Preprocessor took 32.92ms. Allocated memory is still 132.1MB. Free memory was 101.1MB in the beginning and 99.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:56:29,194 INFO L158 Benchmark]: RCFGBuilder took 876.37ms. Allocated memory is still 132.1MB. Free memory was 99.6MB in the beginning and 74.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-02 20:56:29,194 INFO L158 Benchmark]: TraceAbstraction took 16716.27ms. Allocated memory was 132.1MB in the beginning and 589.3MB in the end (delta: 457.2MB). Free memory was 73.8MB in the beginning and 311.0MB in the end (delta: -237.2MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2022-11-02 20:56:29,194 INFO L158 Benchmark]: Witness Printer took 81.55ms. Allocated memory is still 589.3MB. Free memory was 311.0MB in the beginning and 306.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:56:29,201 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 132.1MB. Free memory was 102.3MB in the beginning and 102.3MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.06ms. Allocated memory is still 132.1MB. Free memory was 94.1MB in the beginning and 103.8MB in the end (delta: -9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.86ms. Allocated memory is still 132.1MB. Free memory was 103.8MB in the beginning and 101.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.92ms. Allocated memory is still 132.1MB. Free memory was 101.1MB in the beginning and 99.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 876.37ms. Allocated memory is still 132.1MB. Free memory was 99.6MB in the beginning and 74.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16716.27ms. Allocated memory was 132.1MB in the beginning and 589.3MB in the end (delta: 457.2MB). Free memory was 73.8MB in the beginning and 311.0MB in the end (delta: -237.2MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. * Witness Printer took 81.55ms. Allocated memory is still 589.3MB. Free memory was 311.0MB in the beginning and 306.8MB 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: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: 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: 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: 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: 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: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 522 locations, 51 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: 16.5s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 195 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 616 IncrementalHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 195 mSDtfsCounter, 616 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804occurred in iteration=23, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2553 NumberOfCodeBlocks, 2553 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2528 ConstructedInterpolants, 0 QuantifiedInterpolants, 3204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:56:29,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba79b873-9d39-43ef-a82e-dc4115cde485/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE