./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/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_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/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_31e00198-22ad-4296-b2d4-79cb7a0ec147/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 f3514ef3a93910f9ac9453b24d3813c22e07d2a41de38e0bc0d58abd31257770 --- 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:29:23,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:29:23,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:29:23,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:29:23,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:29:23,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:29:23,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:29:23,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:29:23,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:29:23,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:29:23,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:29:23,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:29:23,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:29:23,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:29:23,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:29:23,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:29:23,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:29:23,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:29:23,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:29:23,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:29:23,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:29:23,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:29:23,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:29:23,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:29:23,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:29:23,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:29:23,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:29:23,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:29:23,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:29:23,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:29:23,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:29:23,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:29:23,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:29:23,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:29:23,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:29:23,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:29:23,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:29:23,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:29:23,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:29:23,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:29:23,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:29:23,665 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:29:23,703 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:29:23,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:29:23,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:29:23,704 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:29:23,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:29:23,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:29:23,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:29:23,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:29:23,707 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:29:23,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:29:23,708 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:29:23,708 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:29:23,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:29:23,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:29:23,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:29:23,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:29:23,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:29:23,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:29:23,710 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:29:23,710 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:29:23,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:29:23,711 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:29:23,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:29:23,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:29:23,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:29:23,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:29:23,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:29:23,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:29:23,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:29:23,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:29:23,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:29:23,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:29:23,714 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:29:23,714 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:29:23,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:29:23,715 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_31e00198-22ad-4296-b2d4-79cb7a0ec147/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_31e00198-22ad-4296-b2d4-79cb7a0ec147/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 -> f3514ef3a93910f9ac9453b24d3813c22e07d2a41de38e0bc0d58abd31257770 [2022-11-02 20:29:24,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:29:24,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:29:24,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:29:24,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:29:24,083 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:29:24,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2022-11-02 20:29:24,199 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/data/c4c327f3f/d98d98b8e7ce4b9eb0154bf232f24fa6/FLAGb64e17a64 [2022-11-02 20:29:24,830 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:29:24,836 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2022-11-02 20:29:24,846 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/data/c4c327f3f/d98d98b8e7ce4b9eb0154bf232f24fa6/FLAGb64e17a64 [2022-11-02 20:29:25,128 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/data/c4c327f3f/d98d98b8e7ce4b9eb0154bf232f24fa6 [2022-11-02 20:29:25,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:29:25,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:29:25,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:29:25,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:29:25,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:29:25,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:29:25" (1/1) ... [2022-11-02 20:29:25,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ac4ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25, skipping insertion in model container [2022-11-02 20:29:25,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:29:25" (1/1) ... [2022-11-02 20:29:25,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:29:25,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:29:25,467 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_31e00198-22ad-4296-b2d4-79cb7a0ec147/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c[2309,2322] [2022-11-02 20:29:25,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:29:25,479 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:29:25,517 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_31e00198-22ad-4296-b2d4-79cb7a0ec147/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c[2309,2322] [2022-11-02 20:29:25,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:29:25,536 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:29:25,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25 WrapperNode [2022-11-02 20:29:25,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:29:25,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:29:25,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:29:25,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:29:25,549 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:29:25" (1/1) ... [2022-11-02 20:29:25,566 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:29:25" (1/1) ... [2022-11-02 20:29:25,617 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-11-02 20:29:25,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:29:25,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:29:25,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:29:25,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:29:25,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25" (1/1) ... [2022-11-02 20:29:25,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25" (1/1) ... [2022-11-02 20:29:25,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25" (1/1) ... [2022-11-02 20:29:25,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25" (1/1) ... [2022-11-02 20:29:25,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25" (1/1) ... [2022-11-02 20:29:25,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25" (1/1) ... [2022-11-02 20:29:25,656 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25" (1/1) ... [2022-11-02 20:29:25,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25" (1/1) ... [2022-11-02 20:29:25,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:29:25,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:29:25,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:29:25,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:29:25,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25" (1/1) ... [2022-11-02 20:29:25,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:29:25,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:29:25,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:29:25,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:29:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:29:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:29:25,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:29:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:29:25,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:29:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:29:25,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:29:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:29:25,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:29:25,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:29:25,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:29:25,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:29:25,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:29:25,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:29:25,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:29:25,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:29:25,800 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:29:25,954 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:29:25,957 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:29:26,906 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:29:26,940 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:29:26,940 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:29:26,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:29:26 BoogieIcfgContainer [2022-11-02 20:29:26,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:29:26,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:29:26,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:29:26,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:29:26,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:29:25" (1/3) ... [2022-11-02 20:29:26,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263cd27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:29:26, skipping insertion in model container [2022-11-02 20:29:26,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:25" (2/3) ... [2022-11-02 20:29:26,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263cd27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:29:26, skipping insertion in model container [2022-11-02 20:29:26,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:29:26" (3/3) ... [2022-11-02 20:29:26,963 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2022-11-02 20:29:26,977 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:29:26,991 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:29:26,991 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2022-11-02 20:29:26,992 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:29:27,137 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:29:27,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 338 places, 339 transitions, 710 flow [2022-11-02 20:29:27,479 INFO L130 PetriNetUnfolder]: 14/335 cut-off events. [2022-11-02 20:29:27,479 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:29:27,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 335 events. 14/335 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 665 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 229. Up to 2 conditions per place. [2022-11-02 20:29:27,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 338 places, 339 transitions, 710 flow [2022-11-02 20:29:27,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 310 transitions, 644 flow [2022-11-02 20:29:27,525 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:29:27,535 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;@4fda5671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:29:27,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2022-11-02 20:29:27,543 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-02 20:29:27,544 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:29:27,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:27,545 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] [2022-11-02 20:29:27,546 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:27,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1646573743, now seen corresponding path program 1 times [2022-11-02 20:29:27,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:27,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16743008] [2022-11-02 20:29:27,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:27,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:27,923 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:29:27,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:27,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16743008] [2022-11-02 20:29:27,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16743008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:27,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:27,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:27,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648265618] [2022-11-02 20:29:27,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:27,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:27,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:28,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:28,015 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 339 [2022-11-02 20:29:28,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 310 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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:29:28,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:28,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 339 [2022-11-02 20:29:28,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:28,392 INFO L130 PetriNetUnfolder]: 73/469 cut-off events. [2022-11-02 20:29:28,393 INFO L131 PetriNetUnfolder]: For 86/93 co-relation queries the response was YES. [2022-11-02 20:29:28,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 469 events. 73/469 cut-off events. For 86/93 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2176 event pairs, 63 based on Foata normal form. 139/515 useless extension candidates. Maximal degree in co-relation 610. Up to 168 conditions per place. [2022-11-02 20:29:28,414 INFO L137 encePairwiseOnDemand]: 331/339 looper letters, 41 selfloop transitions, 2 changer transitions 1/304 dead transitions. [2022-11-02 20:29:28,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 304 transitions, 718 flow [2022-11-02 20:29:28,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:28,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2022-11-02 20:29:28,447 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8977384464110127 [2022-11-02 20:29:28,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 913 transitions. [2022-11-02 20:29:28,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 913 transitions. [2022-11-02 20:29:28,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:28,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 913 transitions. [2022-11-02 20:29:28,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states 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:29:28,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:28,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:28,516 INFO L175 Difference]: Start difference. First operand has 311 places, 310 transitions, 644 flow. Second operand 3 states and 913 transitions. [2022-11-02 20:29:28,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 304 transitions, 718 flow [2022-11-02 20:29:28,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 304 transitions, 702 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:29:28,539 INFO L231 Difference]: Finished difference. Result has 304 places, 303 transitions, 618 flow [2022-11-02 20:29:28,542 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=304, PETRI_TRANSITIONS=303} [2022-11-02 20:29:28,548 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -7 predicate places. [2022-11-02 20:29:28,549 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 303 transitions, 618 flow [2022-11-02 20:29:28,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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:29:28,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:28,552 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] [2022-11-02 20:29:28,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:29:28,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:28,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1799915451, now seen corresponding path program 1 times [2022-11-02 20:29:28,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:28,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752425764] [2022-11-02 20:29:28,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:28,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:28,704 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:29:28,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:28,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752425764] [2022-11-02 20:29:28,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752425764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:28,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:28,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:28,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87651897] [2022-11-02 20:29:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:28,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:28,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:28,712 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 339 [2022-11-02 20:29:28,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 303 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:29:28,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:28,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 339 [2022-11-02 20:29:28,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:28,942 INFO L130 PetriNetUnfolder]: 73/467 cut-off events. [2022-11-02 20:29:28,942 INFO L131 PetriNetUnfolder]: For 25/31 co-relation queries the response was YES. [2022-11-02 20:29:28,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 467 events. 73/467 cut-off events. For 25/31 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2216 event pairs, 63 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 651. Up to 165 conditions per place. [2022-11-02 20:29:28,958 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 38 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-11-02 20:29:28,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 302 transitions, 696 flow [2022-11-02 20:29:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 914 transitions. [2022-11-02 20:29:28,963 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8987217305801377 [2022-11-02 20:29:28,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 914 transitions. [2022-11-02 20:29:28,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 914 transitions. [2022-11-02 20:29:28,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:28,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 914 transitions. [2022-11-02 20:29:28,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states 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:29:28,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:28,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:28,974 INFO L175 Difference]: Start difference. First operand has 304 places, 303 transitions, 618 flow. Second operand 3 states and 914 transitions. [2022-11-02 20:29:28,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 302 transitions, 696 flow [2022-11-02 20:29:28,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 692 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:28,985 INFO L231 Difference]: Finished difference. Result has 302 places, 302 transitions, 616 flow [2022-11-02 20:29:28,986 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=302, PETRI_TRANSITIONS=302} [2022-11-02 20:29:28,987 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -9 predicate places. [2022-11-02 20:29:28,987 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 302 transitions, 616 flow [2022-11-02 20:29:28,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:29:28,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:28,989 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] [2022-11-02 20:29:28,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:29:28,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:28,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:28,991 INFO L85 PathProgramCache]: Analyzing trace with hash 828088460, now seen corresponding path program 1 times [2022-11-02 20:29:28,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:28,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342808240] [2022-11-02 20:29:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:29,075 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:29:29,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:29,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342808240] [2022-11-02 20:29:29,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342808240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:29,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:29,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931832475] [2022-11-02 20:29:29,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:29,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:29,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:29,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:29,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:29,083 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 339 [2022-11-02 20:29:29,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 302 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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:29:29,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:29,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 339 [2022-11-02 20:29:29,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:29,378 INFO L130 PetriNetUnfolder]: 73/466 cut-off events. [2022-11-02 20:29:29,378 INFO L131 PetriNetUnfolder]: For 46/52 co-relation queries the response was YES. [2022-11-02 20:29:29,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 466 events. 73/466 cut-off events. For 46/52 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2229 event pairs, 63 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 626. Up to 168 conditions per place. [2022-11-02 20:29:29,395 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 41 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-11-02 20:29:29,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 301 transitions, 700 flow [2022-11-02 20:29:29,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2022-11-02 20:29:29,402 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8928220255653884 [2022-11-02 20:29:29,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 908 transitions. [2022-11-02 20:29:29,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 908 transitions. [2022-11-02 20:29:29,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:29,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 908 transitions. [2022-11-02 20:29:29,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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:29:29,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:29,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:29,413 INFO L175 Difference]: Start difference. First operand has 302 places, 302 transitions, 616 flow. Second operand 3 states and 908 transitions. [2022-11-02 20:29:29,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 301 transitions, 700 flow [2022-11-02 20:29:29,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 301 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:29,423 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 614 flow [2022-11-02 20:29:29,423 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2022-11-02 20:29:29,427 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -10 predicate places. [2022-11-02 20:29:29,427 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 614 flow [2022-11-02 20:29:29,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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:29:29,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:29,429 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:29:29,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:29:29,429 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:29,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:29,431 INFO L85 PathProgramCache]: Analyzing trace with hash -791116469, now seen corresponding path program 1 times [2022-11-02 20:29:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:29,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202396030] [2022-11-02 20:29:29,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:29,546 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:29:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:29,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202396030] [2022-11-02 20:29:29,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202396030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:29,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:29,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:29,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653162707] [2022-11-02 20:29:29,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:29,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:29,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:29,556 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 339 [2022-11-02 20:29:29,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:29:29,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:29,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 339 [2022-11-02 20:29:29,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:29,844 INFO L130 PetriNetUnfolder]: 73/465 cut-off events. [2022-11-02 20:29:29,845 INFO L131 PetriNetUnfolder]: For 67/73 co-relation queries the response was YES. [2022-11-02 20:29:29,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 465 events. 73/465 cut-off events. For 67/73 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2258 event pairs, 63 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 594. Up to 164 conditions per place. [2022-11-02 20:29:29,857 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 37 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2022-11-02 20:29:29,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 300 transitions, 690 flow [2022-11-02 20:29:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2022-11-02 20:29:29,862 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8977384464110127 [2022-11-02 20:29:29,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 913 transitions. [2022-11-02 20:29:29,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 913 transitions. [2022-11-02 20:29:29,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:29,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 913 transitions. [2022-11-02 20:29:29,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states 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:29:29,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:29,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:29,878 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 614 flow. Second operand 3 states and 913 transitions. [2022-11-02 20:29:29,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 300 transitions, 690 flow [2022-11-02 20:29:29,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 300 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:29,893 INFO L231 Difference]: Finished difference. Result has 300 places, 300 transitions, 612 flow [2022-11-02 20:29:29,894 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=300, PETRI_TRANSITIONS=300} [2022-11-02 20:29:29,896 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -11 predicate places. [2022-11-02 20:29:29,896 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 300 transitions, 612 flow [2022-11-02 20:29:29,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:29:29,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:29,898 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] [2022-11-02 20:29:29,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:29:29,898 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:29,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:29,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1672959698, now seen corresponding path program 1 times [2022-11-02 20:29:29,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:29,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549096887] [2022-11-02 20:29:29,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:29,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:29,973 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:29:29,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:29,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549096887] [2022-11-02 20:29:29,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549096887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:29,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:29,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274683656] [2022-11-02 20:29:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:29,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:29,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:29,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:29,979 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 339 [2022-11-02 20:29:29,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 300 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states 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:29:29,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:29,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 339 [2022-11-02 20:29:29,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:31,604 INFO L130 PetriNetUnfolder]: 1030/6287 cut-off events. [2022-11-02 20:29:31,604 INFO L131 PetriNetUnfolder]: For 85/193 co-relation queries the response was YES. [2022-11-02 20:29:31,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7662 conditions, 6287 events. 1030/6287 cut-off events. For 85/193 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 71366 event pairs, 855 based on Foata normal form. 0/4658 useless extension candidates. Maximal degree in co-relation 7611. Up to 1284 conditions per place. [2022-11-02 20:29:31,743 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 23 selfloop transitions, 2 changer transitions 0/299 dead transitions. [2022-11-02 20:29:31,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 299 transitions, 660 flow [2022-11-02 20:29:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 944 transitions. [2022-11-02 20:29:31,748 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.928220255653884 [2022-11-02 20:29:31,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 944 transitions. [2022-11-02 20:29:31,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 944 transitions. [2022-11-02 20:29:31,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:31,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 944 transitions. [2022-11-02 20:29:31,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 states 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:29:31,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:31,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:31,758 INFO L175 Difference]: Start difference. First operand has 300 places, 300 transitions, 612 flow. Second operand 3 states and 944 transitions. [2022-11-02 20:29:31,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 299 transitions, 660 flow [2022-11-02 20:29:31,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 299 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:31,767 INFO L231 Difference]: Finished difference. Result has 299 places, 299 transitions, 610 flow [2022-11-02 20:29:31,768 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=299, PETRI_TRANSITIONS=299} [2022-11-02 20:29:31,771 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -12 predicate places. [2022-11-02 20:29:31,772 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 299 transitions, 610 flow [2022-11-02 20:29:31,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states 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:29:31,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:31,773 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] [2022-11-02 20:29:31,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:29:31,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:31,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2029348638, now seen corresponding path program 1 times [2022-11-02 20:29:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:31,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845090237] [2022-11-02 20:29:31,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:31,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:31,954 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:29:31,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:31,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845090237] [2022-11-02 20:29:31,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845090237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:31,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:31,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:31,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113290498] [2022-11-02 20:29:31,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:31,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:31,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:31,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:31,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:31,961 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 339 [2022-11-02 20:29:31,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 299 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:29:31,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:31,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 339 [2022-11-02 20:29:31,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:32,147 INFO L130 PetriNetUnfolder]: 58/430 cut-off events. [2022-11-02 20:29:32,148 INFO L131 PetriNetUnfolder]: For 4/9 co-relation queries the response was YES. [2022-11-02 20:29:32,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 430 events. 58/430 cut-off events. For 4/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1866 event pairs, 30 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 561. Up to 88 conditions per place. [2022-11-02 20:29:32,158 INFO L137 encePairwiseOnDemand]: 326/339 looper letters, 31 selfloop transitions, 5 changer transitions 0/295 dead transitions. [2022-11-02 20:29:32,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 295 transitions, 677 flow [2022-11-02 20:29:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2022-11-02 20:29:32,162 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9016715830875123 [2022-11-02 20:29:32,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 917 transitions. [2022-11-02 20:29:32,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 917 transitions. [2022-11-02 20:29:32,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:32,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 917 transitions. [2022-11-02 20:29:32,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 305.6666666666667) internal successors, (917), 3 states have internal predecessors, (917), 0 states have call successors, (0), 0 states 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:29:32,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:32,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:32,173 INFO L175 Difference]: Start difference. First operand has 299 places, 299 transitions, 610 flow. Second operand 3 states and 917 transitions. [2022-11-02 20:29:32,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 295 transitions, 677 flow [2022-11-02 20:29:32,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 295 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:32,182 INFO L231 Difference]: Finished difference. Result has 292 places, 292 transitions, 609 flow [2022-11-02 20:29:32,183 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=292, PETRI_TRANSITIONS=292} [2022-11-02 20:29:32,186 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -19 predicate places. [2022-11-02 20:29:32,187 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 292 transitions, 609 flow [2022-11-02 20:29:32,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:29:32,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:32,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:32,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:29:32,189 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash 288903256, now seen corresponding path program 1 times [2022-11-02 20:29:32,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:32,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981986136] [2022-11-02 20:29:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:32,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:29:32,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:32,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981986136] [2022-11-02 20:29:32,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981986136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:32,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:32,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:32,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132229006] [2022-11-02 20:29:32,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:32,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:32,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:32,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:32,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:32,291 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 339 [2022-11-02 20:29:32,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 292 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states 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:29:32,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:32,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 339 [2022-11-02 20:29:32,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:32,482 INFO L130 PetriNetUnfolder]: 58/424 cut-off events. [2022-11-02 20:29:32,483 INFO L131 PetriNetUnfolder]: For 22/26 co-relation queries the response was YES. [2022-11-02 20:29:32,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 424 events. 58/424 cut-off events. For 22/26 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1889 event pairs, 30 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 522. Up to 86 conditions per place. [2022-11-02 20:29:32,493 INFO L137 encePairwiseOnDemand]: 327/339 looper letters, 29 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2022-11-02 20:29:32,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 289 transitions, 674 flow [2022-11-02 20:29:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2022-11-02 20:29:32,498 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9075712881022615 [2022-11-02 20:29:32,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 923 transitions. [2022-11-02 20:29:32,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 923 transitions. [2022-11-02 20:29:32,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:32,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 923 transitions. [2022-11-02 20:29:32,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 0 states have call successors, (0), 0 states 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:29:32,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:32,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:32,506 INFO L175 Difference]: Start difference. First operand has 292 places, 292 transitions, 609 flow. Second operand 3 states and 923 transitions. [2022-11-02 20:29:32,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 289 transitions, 674 flow [2022-11-02 20:29:32,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 669 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:29:32,515 INFO L231 Difference]: Finished difference. Result has 287 places, 286 transitions, 609 flow [2022-11-02 20:29:32,516 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=287, PETRI_TRANSITIONS=286} [2022-11-02 20:29:32,517 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -24 predicate places. [2022-11-02 20:29:32,517 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 286 transitions, 609 flow [2022-11-02 20:29:32,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states 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:29:32,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:32,518 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] [2022-11-02 20:29:32,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:29:32,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:32,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:32,519 INFO L85 PathProgramCache]: Analyzing trace with hash -56840848, now seen corresponding path program 1 times [2022-11-02 20:29:32,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:32,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891950524] [2022-11-02 20:29:32,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:32,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:32,596 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:29:32,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:32,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891950524] [2022-11-02 20:29:32,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891950524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:32,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:32,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430107132] [2022-11-02 20:29:32,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:32,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:32,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:32,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:32,601 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 339 [2022-11-02 20:29:32,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 286 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:29:32,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:32,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 339 [2022-11-02 20:29:32,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:32,908 INFO L130 PetriNetUnfolder]: 66/694 cut-off events. [2022-11-02 20:29:32,908 INFO L131 PetriNetUnfolder]: For 42/46 co-relation queries the response was YES. [2022-11-02 20:29:32,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 694 events. 66/694 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3661 event pairs, 29 based on Foata normal form. 0/597 useless extension candidates. Maximal degree in co-relation 783. Up to 89 conditions per place. [2022-11-02 20:29:32,925 INFO L137 encePairwiseOnDemand]: 325/339 looper letters, 34 selfloop transitions, 6 changer transitions 0/286 dead transitions. [2022-11-02 20:29:32,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 286 transitions, 695 flow [2022-11-02 20:29:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2022-11-02 20:29:32,929 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9056047197640118 [2022-11-02 20:29:32,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 921 transitions. [2022-11-02 20:29:32,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 921 transitions. [2022-11-02 20:29:32,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:32,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 921 transitions. [2022-11-02 20:29:32,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states 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:29:32,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:32,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:32,938 INFO L175 Difference]: Start difference. First operand has 287 places, 286 transitions, 609 flow. Second operand 3 states and 921 transitions. [2022-11-02 20:29:32,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 286 transitions, 695 flow [2022-11-02 20:29:32,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 286 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:29:32,946 INFO L231 Difference]: Finished difference. Result has 281 places, 280 transitions, 614 flow [2022-11-02 20:29:32,947 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=281, PETRI_TRANSITIONS=280} [2022-11-02 20:29:32,948 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -30 predicate places. [2022-11-02 20:29:32,948 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 280 transitions, 614 flow [2022-11-02 20:29:32,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:29:32,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:32,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:32,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:29:32,950 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:32,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1210543465, now seen corresponding path program 1 times [2022-11-02 20:29:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:32,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531313570] [2022-11-02 20:29:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:32,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:33,026 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:29:33,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:33,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531313570] [2022-11-02 20:29:33,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531313570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:33,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:33,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:29:33,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334344656] [2022-11-02 20:29:33,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:33,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:29:33,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:33,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:29:33,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:29:33,031 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 339 [2022-11-02 20:29:33,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 280 transitions, 614 flow. Second operand has 4 states, 4 states have (on average 313.25) internal successors, (1253), 4 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states 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:29:33,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:33,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 339 [2022-11-02 20:29:33,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:33,191 INFO L130 PetriNetUnfolder]: 12/467 cut-off events. [2022-11-02 20:29:33,192 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-02 20:29:33,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 467 events. 12/467 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1669 event pairs, 0 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 377. Up to 27 conditions per place. [2022-11-02 20:29:33,200 INFO L137 encePairwiseOnDemand]: 333/339 looper letters, 22 selfloop transitions, 5 changer transitions 0/287 dead transitions. [2022-11-02 20:29:33,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 287 transitions, 682 flow [2022-11-02 20:29:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:29:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:29:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1588 transitions. [2022-11-02 20:29:33,206 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9368731563421829 [2022-11-02 20:29:33,206 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1588 transitions. [2022-11-02 20:29:33,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1588 transitions. [2022-11-02 20:29:33,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:33,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1588 transitions. [2022-11-02 20:29:33,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 317.6) internal successors, (1588), 5 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states 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:29:33,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 339.0) internal successors, (2034), 6 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states 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:29:33,219 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 339.0) internal successors, (2034), 6 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states 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:29:33,219 INFO L175 Difference]: Start difference. First operand has 281 places, 280 transitions, 614 flow. Second operand 5 states and 1588 transitions. [2022-11-02 20:29:33,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 287 transitions, 682 flow [2022-11-02 20:29:33,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 287 transitions, 676 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:29:33,228 INFO L231 Difference]: Finished difference. Result has 288 places, 284 transitions, 646 flow [2022-11-02 20:29:33,229 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=646, PETRI_PLACES=288, PETRI_TRANSITIONS=284} [2022-11-02 20:29:33,230 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -23 predicate places. [2022-11-02 20:29:33,230 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 284 transitions, 646 flow [2022-11-02 20:29:33,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.25) internal successors, (1253), 4 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states 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:29:33,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:33,241 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] [2022-11-02 20:29:33,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:29:33,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash 230395390, now seen corresponding path program 1 times [2022-11-02 20:29:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:33,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986880389] [2022-11-02 20:29:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:33,289 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:29:33,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:33,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986880389] [2022-11-02 20:29:33,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986880389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:33,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:33,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:33,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577826912] [2022-11-02 20:29:33,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:33,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:33,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:33,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:33,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:33,294 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 339 [2022-11-02 20:29:33,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 284 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states 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:29:33,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:33,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 339 [2022-11-02 20:29:33,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:33,600 INFO L130 PetriNetUnfolder]: 100/1011 cut-off events. [2022-11-02 20:29:33,601 INFO L131 PetriNetUnfolder]: For 93/97 co-relation queries the response was YES. [2022-11-02 20:29:33,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 1011 events. 100/1011 cut-off events. For 93/97 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6331 event pairs, 48 based on Foata normal form. 1/894 useless extension candidates. Maximal degree in co-relation 1004. Up to 135 conditions per place. [2022-11-02 20:29:33,618 INFO L137 encePairwiseOnDemand]: 327/339 looper letters, 30 selfloop transitions, 5 changer transitions 11/285 dead transitions. [2022-11-02 20:29:33,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 285 transitions, 729 flow [2022-11-02 20:29:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2022-11-02 20:29:33,622 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9105211406096362 [2022-11-02 20:29:33,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 926 transitions. [2022-11-02 20:29:33,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 926 transitions. [2022-11-02 20:29:33,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:33,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 926 transitions. [2022-11-02 20:29:33,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states 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:29:33,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:33,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:33,631 INFO L175 Difference]: Start difference. First operand has 288 places, 284 transitions, 646 flow. Second operand 3 states and 926 transitions. [2022-11-02 20:29:33,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 285 transitions, 729 flow [2022-11-02 20:29:33,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 285 transitions, 729 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:29:33,639 INFO L231 Difference]: Finished difference. Result has 284 places, 267 transitions, 628 flow [2022-11-02 20:29:33,640 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=284, PETRI_TRANSITIONS=267} [2022-11-02 20:29:33,641 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -27 predicate places. [2022-11-02 20:29:33,641 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 267 transitions, 628 flow [2022-11-02 20:29:33,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states 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:29:33,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:33,642 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:29:33,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:29:33,643 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:33,644 INFO L85 PathProgramCache]: Analyzing trace with hash -920496575, now seen corresponding path program 1 times [2022-11-02 20:29:33,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:33,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923725607] [2022-11-02 20:29:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:33,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:33,722 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:29:33,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:33,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923725607] [2022-11-02 20:29:33,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923725607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:33,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:33,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:33,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457857939] [2022-11-02 20:29:33,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:33,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:33,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:33,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:33,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:33,727 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2022-11-02 20:29:33,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 267 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:29:33,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:33,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2022-11-02 20:29:33,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:35,100 INFO L130 PetriNetUnfolder]: 738/5742 cut-off events. [2022-11-02 20:29:35,100 INFO L131 PetriNetUnfolder]: For 174/300 co-relation queries the response was YES. [2022-11-02 20:29:35,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7518 conditions, 5742 events. 738/5742 cut-off events. For 174/300 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 63767 event pairs, 349 based on Foata normal form. 0/4987 useless extension candidates. Maximal degree in co-relation 5488. Up to 924 conditions per place. [2022-11-02 20:29:35,188 INFO L137 encePairwiseOnDemand]: 331/339 looper letters, 20 selfloop transitions, 4 changer transitions 0/270 dead transitions. [2022-11-02 20:29:35,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 270 transitions, 685 flow [2022-11-02 20:29:35,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2022-11-02 20:29:35,192 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9390363815142576 [2022-11-02 20:29:35,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 955 transitions. [2022-11-02 20:29:35,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 955 transitions. [2022-11-02 20:29:35,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:35,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 955 transitions. [2022-11-02 20:29:35,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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:29:35,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:35,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:35,202 INFO L175 Difference]: Start difference. First operand has 284 places, 267 transitions, 628 flow. Second operand 3 states and 955 transitions. [2022-11-02 20:29:35,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 270 transitions, 685 flow [2022-11-02 20:29:35,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 270 transitions, 680 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:29:35,214 INFO L231 Difference]: Finished difference. Result has 271 places, 267 transitions, 643 flow [2022-11-02 20:29:35,215 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=271, PETRI_TRANSITIONS=267} [2022-11-02 20:29:35,216 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -40 predicate places. [2022-11-02 20:29:35,216 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 267 transitions, 643 flow [2022-11-02 20:29:35,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:29:35,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:35,217 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] [2022-11-02 20:29:35,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:29:35,218 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:35,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1958624826, now seen corresponding path program 1 times [2022-11-02 20:29:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:35,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971508094] [2022-11-02 20:29:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:35,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:35,317 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:29:35,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:35,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971508094] [2022-11-02 20:29:35,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971508094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:35,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:35,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:35,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142569795] [2022-11-02 20:29:35,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:35,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:35,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:35,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:35,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:35,321 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 339 [2022-11-02 20:29:35,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 267 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states 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:29:35,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:35,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 339 [2022-11-02 20:29:35,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:35,909 INFO L130 PetriNetUnfolder]: 300/1926 cut-off events. [2022-11-02 20:29:35,910 INFO L131 PetriNetUnfolder]: For 46/61 co-relation queries the response was YES. [2022-11-02 20:29:35,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 1926 events. 300/1926 cut-off events. For 46/61 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16723 event pairs, 163 based on Foata normal form. 0/1719 useless extension candidates. Maximal degree in co-relation 1945. Up to 384 conditions per place. [2022-11-02 20:29:35,945 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 32 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2022-11-02 20:29:35,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 269 transitions, 718 flow [2022-11-02 20:29:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2022-11-02 20:29:35,949 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8859390363815143 [2022-11-02 20:29:35,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 901 transitions. [2022-11-02 20:29:35,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 901 transitions. [2022-11-02 20:29:35,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:35,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 901 transitions. [2022-11-02 20:29:35,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states 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:29:35,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:35,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:35,958 INFO L175 Difference]: Start difference. First operand has 271 places, 267 transitions, 643 flow. Second operand 3 states and 901 transitions. [2022-11-02 20:29:35,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 269 transitions, 718 flow [2022-11-02 20:29:35,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 269 transitions, 718 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:29:35,966 INFO L231 Difference]: Finished difference. Result has 272 places, 266 transitions, 645 flow [2022-11-02 20:29:35,966 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=272, PETRI_TRANSITIONS=266} [2022-11-02 20:29:35,967 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -39 predicate places. [2022-11-02 20:29:35,968 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 266 transitions, 645 flow [2022-11-02 20:29:35,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states 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:29:35,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:35,969 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] [2022-11-02 20:29:35,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:29:35,969 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:35,970 INFO L85 PathProgramCache]: Analyzing trace with hash -189686167, now seen corresponding path program 1 times [2022-11-02 20:29:35,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:35,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947347239] [2022-11-02 20:29:35,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:35,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:36,023 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:29:36,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:36,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947347239] [2022-11-02 20:29:36,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947347239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:36,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:36,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:36,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958207614] [2022-11-02 20:29:36,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:36,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:36,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:36,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:36,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:36,028 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 339 [2022-11-02 20:29:36,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 266 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states 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:29:36,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:36,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 339 [2022-11-02 20:29:36,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:36,606 INFO L130 PetriNetUnfolder]: 413/2149 cut-off events. [2022-11-02 20:29:36,606 INFO L131 PetriNetUnfolder]: For 124/145 co-relation queries the response was YES. [2022-11-02 20:29:36,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3500 conditions, 2149 events. 413/2149 cut-off events. For 124/145 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 18960 event pairs, 253 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 3377. Up to 604 conditions per place. [2022-11-02 20:29:36,646 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 30 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2022-11-02 20:29:36,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 268 transitions, 716 flow [2022-11-02 20:29:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2022-11-02 20:29:36,650 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8928220255653884 [2022-11-02 20:29:36,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 908 transitions. [2022-11-02 20:29:36,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 908 transitions. [2022-11-02 20:29:36,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:36,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 908 transitions. [2022-11-02 20:29:36,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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:29:36,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:36,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:36,659 INFO L175 Difference]: Start difference. First operand has 272 places, 266 transitions, 645 flow. Second operand 3 states and 908 transitions. [2022-11-02 20:29:36,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 268 transitions, 716 flow [2022-11-02 20:29:36,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 268 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:36,667 INFO L231 Difference]: Finished difference. Result has 271 places, 265 transitions, 643 flow [2022-11-02 20:29:36,668 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=271, PETRI_TRANSITIONS=265} [2022-11-02 20:29:36,670 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -40 predicate places. [2022-11-02 20:29:36,670 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 265 transitions, 643 flow [2022-11-02 20:29:36,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states 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:29:36,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:36,672 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] [2022-11-02 20:29:36,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:29:36,673 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:36,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:36,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1171687955, now seen corresponding path program 1 times [2022-11-02 20:29:36,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:36,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780804707] [2022-11-02 20:29:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:36,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:36,744 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:29:36,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:36,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780804707] [2022-11-02 20:29:36,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780804707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:36,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:36,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:36,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387595914] [2022-11-02 20:29:36,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:36,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:36,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:36,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:36,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:36,749 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 339 [2022-11-02 20:29:36,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 265 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 states 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:29:36,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:36,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 339 [2022-11-02 20:29:36,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:37,214 INFO L130 PetriNetUnfolder]: 291/1893 cut-off events. [2022-11-02 20:29:37,214 INFO L131 PetriNetUnfolder]: For 58/73 co-relation queries the response was YES. [2022-11-02 20:29:37,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2915 conditions, 1893 events. 291/1893 cut-off events. For 58/73 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 16284 event pairs, 154 based on Foata normal form. 0/1710 useless extension candidates. Maximal degree in co-relation 2603. Up to 363 conditions per place. [2022-11-02 20:29:37,303 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 31 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2022-11-02 20:29:37,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 267 transitions, 716 flow [2022-11-02 20:29:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 900 transitions. [2022-11-02 20:29:37,307 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8849557522123894 [2022-11-02 20:29:37,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 900 transitions. [2022-11-02 20:29:37,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 900 transitions. [2022-11-02 20:29:37,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:37,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 900 transitions. [2022-11-02 20:29:37,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states 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:29:37,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:37,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:37,317 INFO L175 Difference]: Start difference. First operand has 271 places, 265 transitions, 643 flow. Second operand 3 states and 900 transitions. [2022-11-02 20:29:37,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 267 transitions, 716 flow [2022-11-02 20:29:37,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 267 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:37,327 INFO L231 Difference]: Finished difference. Result has 270 places, 264 transitions, 641 flow [2022-11-02 20:29:37,328 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=270, PETRI_TRANSITIONS=264} [2022-11-02 20:29:37,329 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -41 predicate places. [2022-11-02 20:29:37,330 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 264 transitions, 641 flow [2022-11-02 20:29:37,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 states 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:29:37,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:37,331 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] [2022-11-02 20:29:37,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:29:37,332 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2089280090, now seen corresponding path program 1 times [2022-11-02 20:29:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:37,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809899322] [2022-11-02 20:29:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:37,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:37,414 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:29:37,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:37,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809899322] [2022-11-02 20:29:37,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809899322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:37,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:37,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:37,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238215091] [2022-11-02 20:29:37,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:37,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:37,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:37,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:37,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:37,420 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 339 [2022-11-02 20:29:37,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 264 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states 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:29:37,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:37,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 339 [2022-11-02 20:29:37,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:38,057 INFO L130 PetriNetUnfolder]: 311/1880 cut-off events. [2022-11-02 20:29:38,057 INFO L131 PetriNetUnfolder]: For 141/165 co-relation queries the response was YES. [2022-11-02 20:29:38,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2937 conditions, 1880 events. 311/1880 cut-off events. For 141/165 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 15772 event pairs, 173 based on Foata normal form. 0/1695 useless extension candidates. Maximal degree in co-relation 2858. Up to 479 conditions per place. [2022-11-02 20:29:38,110 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 33 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2022-11-02 20:29:38,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 266 transitions, 718 flow [2022-11-02 20:29:38,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2022-11-02 20:29:38,115 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8859390363815143 [2022-11-02 20:29:38,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 901 transitions. [2022-11-02 20:29:38,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 901 transitions. [2022-11-02 20:29:38,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:38,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 901 transitions. [2022-11-02 20:29:38,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states 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:29:38,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:38,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:38,125 INFO L175 Difference]: Start difference. First operand has 270 places, 264 transitions, 641 flow. Second operand 3 states and 901 transitions. [2022-11-02 20:29:38,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 266 transitions, 718 flow [2022-11-02 20:29:38,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 266 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:38,135 INFO L231 Difference]: Finished difference. Result has 269 places, 263 transitions, 639 flow [2022-11-02 20:29:38,136 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=269, PETRI_TRANSITIONS=263} [2022-11-02 20:29:38,137 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -42 predicate places. [2022-11-02 20:29:38,137 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 263 transitions, 639 flow [2022-11-02 20:29:38,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states 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:29:38,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:38,139 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] [2022-11-02 20:29:38,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:29:38,139 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:38,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:38,140 INFO L85 PathProgramCache]: Analyzing trace with hash -330878859, now seen corresponding path program 1 times [2022-11-02 20:29:38,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:38,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202187254] [2022-11-02 20:29:38,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:38,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:38,966 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:29:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:38,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202187254] [2022-11-02 20:29:38,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202187254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:38,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:38,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:29:38,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554364116] [2022-11-02 20:29:38,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:38,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:29:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:38,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:29:38,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:29:38,977 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 339 [2022-11-02 20:29:38,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 263 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 296.1666666666667) internal successors, (1777), 6 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states 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:29:38,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:38,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 339 [2022-11-02 20:29:38,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:39,434 INFO L130 PetriNetUnfolder]: 88/1216 cut-off events. [2022-11-02 20:29:39,434 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-02 20:29:39,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 1216 events. 88/1216 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 8171 event pairs, 8 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1430. Up to 108 conditions per place. [2022-11-02 20:29:39,458 INFO L137 encePairwiseOnDemand]: 334/339 looper letters, 30 selfloop transitions, 4 changer transitions 0/262 dead transitions. [2022-11-02 20:29:39,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 262 transitions, 705 flow [2022-11-02 20:29:39,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:29:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:29:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1799 transitions. [2022-11-02 20:29:39,464 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.884464110127827 [2022-11-02 20:29:39,465 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1799 transitions. [2022-11-02 20:29:39,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1799 transitions. [2022-11-02 20:29:39,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:39,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1799 transitions. [2022-11-02 20:29:39,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 299.8333333333333) internal successors, (1799), 6 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states 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:29:39,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states 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:29:39,477 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states 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:29:39,479 INFO L175 Difference]: Start difference. First operand has 269 places, 263 transitions, 639 flow. Second operand 6 states and 1799 transitions. [2022-11-02 20:29:39,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 262 transitions, 705 flow [2022-11-02 20:29:39,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 262 transitions, 701 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:39,487 INFO L231 Difference]: Finished difference. Result has 271 places, 262 transitions, 641 flow [2022-11-02 20:29:39,487 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=641, PETRI_PLACES=271, PETRI_TRANSITIONS=262} [2022-11-02 20:29:39,488 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -40 predicate places. [2022-11-02 20:29:39,488 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 262 transitions, 641 flow [2022-11-02 20:29:39,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.1666666666667) internal successors, (1777), 6 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states 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:29:39,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:39,490 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] [2022-11-02 20:29:39,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:29:39,490 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:39,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash 401198925, now seen corresponding path program 1 times [2022-11-02 20:29:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:39,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42669971] [2022-11-02 20:29:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:39,551 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:29:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:39,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42669971] [2022-11-02 20:29:39,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42669971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:39,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:39,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165416503] [2022-11-02 20:29:39,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:39,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:39,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:39,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:39,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:39,557 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 339 [2022-11-02 20:29:39,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 262 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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:29:39,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:39,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 339 [2022-11-02 20:29:39,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:40,065 INFO L130 PetriNetUnfolder]: 398/2091 cut-off events. [2022-11-02 20:29:40,065 INFO L131 PetriNetUnfolder]: For 118/139 co-relation queries the response was YES. [2022-11-02 20:29:40,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3400 conditions, 2091 events. 398/2091 cut-off events. For 118/139 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 18297 event pairs, 238 based on Foata normal form. 0/1925 useless extension candidates. Maximal degree in co-relation 2858. Up to 568 conditions per place. [2022-11-02 20:29:40,112 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 29 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2022-11-02 20:29:40,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 264 transitions, 710 flow [2022-11-02 20:29:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 907 transitions. [2022-11-02 20:29:40,116 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8918387413962635 [2022-11-02 20:29:40,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 907 transitions. [2022-11-02 20:29:40,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 907 transitions. [2022-11-02 20:29:40,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:40,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 907 transitions. [2022-11-02 20:29:40,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states 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:29:40,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:40,124 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:40,124 INFO L175 Difference]: Start difference. First operand has 271 places, 262 transitions, 641 flow. Second operand 3 states and 907 transitions. [2022-11-02 20:29:40,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 264 transitions, 710 flow [2022-11-02 20:29:40,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 264 transitions, 703 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:29:40,132 INFO L231 Difference]: Finished difference. Result has 268 places, 261 transitions, 636 flow [2022-11-02 20:29:40,132 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=268, PETRI_TRANSITIONS=261} [2022-11-02 20:29:40,133 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -43 predicate places. [2022-11-02 20:29:40,133 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 261 transitions, 636 flow [2022-11-02 20:29:40,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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:29:40,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:40,134 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] [2022-11-02 20:29:40,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:29:40,135 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1399815823, now seen corresponding path program 1 times [2022-11-02 20:29:40,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:40,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690815228] [2022-11-02 20:29:40,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:40,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:40,198 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:29:40,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:40,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690815228] [2022-11-02 20:29:40,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690815228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:40,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:40,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638696390] [2022-11-02 20:29:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:40,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:40,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:40,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:40,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:40,203 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 339 [2022-11-02 20:29:40,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 261 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states 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:29:40,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:40,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 339 [2022-11-02 20:29:40,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:40,608 INFO L130 PetriNetUnfolder]: 218/1568 cut-off events. [2022-11-02 20:29:40,609 INFO L131 PetriNetUnfolder]: For 164/174 co-relation queries the response was YES. [2022-11-02 20:29:40,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 1568 events. 218/1568 cut-off events. For 164/174 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 12050 event pairs, 108 based on Foata normal form. 0/1425 useless extension candidates. Maximal degree in co-relation 2140. Up to 313 conditions per place. [2022-11-02 20:29:40,639 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 30 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2022-11-02 20:29:40,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 263 transitions, 707 flow [2022-11-02 20:29:40,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2022-11-02 20:29:40,643 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8928220255653884 [2022-11-02 20:29:40,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 908 transitions. [2022-11-02 20:29:40,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 908 transitions. [2022-11-02 20:29:40,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:40,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 908 transitions. [2022-11-02 20:29:40,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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:29:40,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:40,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:40,651 INFO L175 Difference]: Start difference. First operand has 268 places, 261 transitions, 636 flow. Second operand 3 states and 908 transitions. [2022-11-02 20:29:40,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 263 transitions, 707 flow [2022-11-02 20:29:40,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 263 transitions, 703 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:40,663 INFO L231 Difference]: Finished difference. Result has 267 places, 260 transitions, 634 flow [2022-11-02 20:29:40,664 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=267, PETRI_TRANSITIONS=260} [2022-11-02 20:29:40,665 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -44 predicate places. [2022-11-02 20:29:40,665 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 260 transitions, 634 flow [2022-11-02 20:29:40,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states 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:29:40,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:40,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:40,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:29:40,667 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1591202643, now seen corresponding path program 1 times [2022-11-02 20:29:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:40,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357532478] [2022-11-02 20:29:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:40,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:40,732 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:29:40,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:40,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357532478] [2022-11-02 20:29:40,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357532478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:40,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:40,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:40,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846984726] [2022-11-02 20:29:40,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:40,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:40,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:40,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:40,738 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 339 [2022-11-02 20:29:40,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 260 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 states 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:29:40,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:40,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 339 [2022-11-02 20:29:40,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:41,208 INFO L130 PetriNetUnfolder]: 300/1823 cut-off events. [2022-11-02 20:29:41,208 INFO L131 PetriNetUnfolder]: For 148/172 co-relation queries the response was YES. [2022-11-02 20:29:41,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2864 conditions, 1823 events. 300/1823 cut-off events. For 148/172 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 14980 event pairs, 161 based on Foata normal form. 0/1684 useless extension candidates. Maximal degree in co-relation 2637. Up to 450 conditions per place. [2022-11-02 20:29:41,248 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 32 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2022-11-02 20:29:41,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 262 transitions, 709 flow [2022-11-02 20:29:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 900 transitions. [2022-11-02 20:29:41,252 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8849557522123894 [2022-11-02 20:29:41,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 900 transitions. [2022-11-02 20:29:41,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 900 transitions. [2022-11-02 20:29:41,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:41,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 900 transitions. [2022-11-02 20:29:41,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states 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:29:41,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:41,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:41,260 INFO L175 Difference]: Start difference. First operand has 267 places, 260 transitions, 634 flow. Second operand 3 states and 900 transitions. [2022-11-02 20:29:41,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 262 transitions, 709 flow [2022-11-02 20:29:41,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 262 transitions, 705 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:41,268 INFO L231 Difference]: Finished difference. Result has 266 places, 259 transitions, 632 flow [2022-11-02 20:29:41,269 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=266, PETRI_TRANSITIONS=259} [2022-11-02 20:29:41,269 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -45 predicate places. [2022-11-02 20:29:41,270 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 259 transitions, 632 flow [2022-11-02 20:29:41,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 states 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:29:41,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:41,271 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] [2022-11-02 20:29:41,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:29:41,271 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread4Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:41,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1750734637, now seen corresponding path program 1 times [2022-11-02 20:29:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:41,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019757866] [2022-11-02 20:29:41,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:41,338 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:29:41,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:41,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019757866] [2022-11-02 20:29:41,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019757866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:41,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:41,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:29:41,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432790330] [2022-11-02 20:29:41,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:41,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:41,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:41,343 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 339 [2022-11-02 20:29:41,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 259 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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:29:41,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:41,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 339 [2022-11-02 20:29:41,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:41,726 INFO L130 PetriNetUnfolder]: 208/1534 cut-off events. [2022-11-02 20:29:41,727 INFO L131 PetriNetUnfolder]: For 160/170 co-relation queries the response was YES. [2022-11-02 20:29:41,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2242 conditions, 1534 events. 208/1534 cut-off events. For 160/170 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 11625 event pairs, 96 based on Foata normal form. 0/1415 useless extension candidates. Maximal degree in co-relation 2122. Up to 291 conditions per place. [2022-11-02 20:29:41,756 INFO L137 encePairwiseOnDemand]: 336/339 looper letters, 29 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2022-11-02 20:29:41,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 261 transitions, 701 flow [2022-11-02 20:29:41,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:29:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 907 transitions. [2022-11-02 20:29:41,760 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8918387413962635 [2022-11-02 20:29:41,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 907 transitions. [2022-11-02 20:29:41,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 907 transitions. [2022-11-02 20:29:41,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:41,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 907 transitions. [2022-11-02 20:29:41,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states 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:29:41,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:41,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states 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:29:41,767 INFO L175 Difference]: Start difference. First operand has 266 places, 259 transitions, 632 flow. Second operand 3 states and 907 transitions. [2022-11-02 20:29:41,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 261 transitions, 701 flow [2022-11-02 20:29:41,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 261 transitions, 697 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:41,775 INFO L231 Difference]: Finished difference. Result has 265 places, 258 transitions, 630 flow [2022-11-02 20:29:41,776 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=265, PETRI_TRANSITIONS=258} [2022-11-02 20:29:41,776 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -46 predicate places. [2022-11-02 20:29:41,777 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 258 transitions, 630 flow [2022-11-02 20:29:41,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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:29:41,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:41,778 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] [2022-11-02 20:29:41,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:29:41,778 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:41,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash -804760379, now seen corresponding path program 1 times [2022-11-02 20:29:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:41,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570912030] [2022-11-02 20:29:41,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:42,583 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:29:42,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:42,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570912030] [2022-11-02 20:29:42,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570912030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:42,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:42,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:29:42,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186425615] [2022-11-02 20:29:42,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:42,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:29:42,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:42,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:29:42,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:29:42,589 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 339 [2022-11-02 20:29:42,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 258 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 297.1666666666667) internal successors, (1783), 6 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states 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:29:42,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:42,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 339 [2022-11-02 20:29:42,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:42,956 INFO L130 PetriNetUnfolder]: 88/1181 cut-off events. [2022-11-02 20:29:42,957 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-02 20:29:42,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 1181 events. 88/1181 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7826 event pairs, 8 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1523. Up to 108 conditions per place. [2022-11-02 20:29:42,978 INFO L137 encePairwiseOnDemand]: 334/339 looper letters, 29 selfloop transitions, 4 changer transitions 0/257 dead transitions. [2022-11-02 20:29:42,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 257 transitions, 694 flow [2022-11-02 20:29:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:29:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:29:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1798 transitions. [2022-11-02 20:29:42,984 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8839724680432645 [2022-11-02 20:29:42,984 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1798 transitions. [2022-11-02 20:29:42,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1798 transitions. [2022-11-02 20:29:42,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:42,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1798 transitions. [2022-11-02 20:29:42,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 299.6666666666667) internal successors, (1798), 6 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states 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:29:42,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states 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:29:42,997 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states 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:29:42,997 INFO L175 Difference]: Start difference. First operand has 265 places, 258 transitions, 630 flow. Second operand 6 states and 1798 transitions. [2022-11-02 20:29:42,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 257 transitions, 694 flow [2022-11-02 20:29:43,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 257 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:29:43,005 INFO L231 Difference]: Finished difference. Result has 267 places, 257 transitions, 632 flow [2022-11-02 20:29:43,006 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=267, PETRI_TRANSITIONS=257} [2022-11-02 20:29:43,006 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -44 predicate places. [2022-11-02 20:29:43,007 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 257 transitions, 632 flow [2022-11-02 20:29:43,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.1666666666667) internal successors, (1783), 6 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states 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:29:43,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:43,008 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] [2022-11-02 20:29:43,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:29:43,008 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:43,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:43,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1709850920, now seen corresponding path program 1 times [2022-11-02 20:29:43,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:43,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278482207] [2022-11-02 20:29:43,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:43,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:43,711 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:29:43,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:43,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278482207] [2022-11-02 20:29:43,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278482207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:43,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:43,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:29:43,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784880819] [2022-11-02 20:29:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:43,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:29:43,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:43,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:29:43,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:29:43,716 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 339 [2022-11-02 20:29:43,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 257 transitions, 632 flow. Second operand has 6 states, 6 states have (on average 298.1666666666667) internal successors, (1789), 6 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states 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:29:43,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:43,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 339 [2022-11-02 20:29:43,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:44,042 INFO L130 PetriNetUnfolder]: 88/1174 cut-off events. [2022-11-02 20:29:44,043 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-02 20:29:44,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 1174 events. 88/1174 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7784 event pairs, 8 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1396. Up to 108 conditions per place. [2022-11-02 20:29:44,066 INFO L137 encePairwiseOnDemand]: 334/339 looper letters, 28 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2022-11-02 20:29:44,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 256 transitions, 694 flow [2022-11-02 20:29:44,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:29:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:29:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1797 transitions. [2022-11-02 20:29:44,072 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.883480825958702 [2022-11-02 20:29:44,072 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1797 transitions. [2022-11-02 20:29:44,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1797 transitions. [2022-11-02 20:29:44,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:44,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1797 transitions. [2022-11-02 20:29:44,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states 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:29:44,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states 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:29:44,085 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states 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:29:44,086 INFO L175 Difference]: Start difference. First operand has 267 places, 257 transitions, 632 flow. Second operand 6 states and 1797 transitions. [2022-11-02 20:29:44,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 256 transitions, 694 flow [2022-11-02 20:29:44,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 256 transitions, 687 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:29:44,093 INFO L231 Difference]: Finished difference. Result has 267 places, 256 transitions, 631 flow [2022-11-02 20:29:44,094 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=631, PETRI_PLACES=267, PETRI_TRANSITIONS=256} [2022-11-02 20:29:44,094 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -44 predicate places. [2022-11-02 20:29:44,095 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 256 transitions, 631 flow [2022-11-02 20:29:44,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.1666666666667) internal successors, (1789), 6 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states 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:29:44,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:29:44,096 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] [2022-11-02 20:29:44,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:29:44,097 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2022-11-02 20:29:44,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:44,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1441486893, now seen corresponding path program 1 times [2022-11-02 20:29:44,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:44,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654883085] [2022-11-02 20:29:44,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:44,820 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:29:44,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:44,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654883085] [2022-11-02 20:29:44,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654883085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:44,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:44,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:29:44,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161600329] [2022-11-02 20:29:44,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:44,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:29:44,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:44,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:29:44,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:29:44,825 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 339 [2022-11-02 20:29:44,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 256 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 299.1666666666667) internal successors, (1795), 6 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:29:44,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:29:44,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 339 [2022-11-02 20:29:44,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:29:45,161 INFO L130 PetriNetUnfolder]: 88/1171 cut-off events. [2022-11-02 20:29:45,161 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-02 20:29:45,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 1171 events. 88/1171 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7753 event pairs, 8 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1457. Up to 108 conditions per place. [2022-11-02 20:29:45,181 INFO L137 encePairwiseOnDemand]: 334/339 looper letters, 0 selfloop transitions, 0 changer transitions 255/255 dead transitions. [2022-11-02 20:29:45,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 255 transitions, 691 flow [2022-11-02 20:29:45,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:29:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:29:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2022-11-02 20:29:45,187 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8829891838741396 [2022-11-02 20:29:45,187 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1796 transitions. [2022-11-02 20:29:45,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1796 transitions. [2022-11-02 20:29:45,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:29:45,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1796 transitions. [2022-11-02 20:29:45,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 299.3333333333333) internal successors, (1796), 6 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states 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:29:45,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states 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:29:45,200 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states 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:29:45,200 INFO L175 Difference]: Start difference. First operand has 267 places, 256 transitions, 631 flow. Second operand 6 states and 1796 transitions. [2022-11-02 20:29:45,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 255 transitions, 691 flow [2022-11-02 20:29:45,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 255 transitions, 684 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:29:45,206 INFO L231 Difference]: Finished difference. Result has 267 places, 0 transitions, 0 flow [2022-11-02 20:29:45,207 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=267, PETRI_TRANSITIONS=0} [2022-11-02 20:29:45,207 INFO L287 CegarLoopForPetriNet]: 311 programPoint places, -44 predicate places. [2022-11-02 20:29:45,208 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 0 transitions, 0 flow [2022-11-02 20:29:45,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.1666666666667) internal successors, (1795), 6 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:29:45,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (86 of 87 remaining) [2022-11-02 20:29:45,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (85 of 87 remaining) [2022-11-02 20:29:45,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (84 of 87 remaining) [2022-11-02 20:29:45,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (83 of 87 remaining) [2022-11-02 20:29:45,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (82 of 87 remaining) [2022-11-02 20:29:45,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (81 of 87 remaining) [2022-11-02 20:29:45,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (80 of 87 remaining) [2022-11-02 20:29:45,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 87 remaining) [2022-11-02 20:29:45,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (78 of 87 remaining) [2022-11-02 20:29:45,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (77 of 87 remaining) [2022-11-02 20:29:45,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (76 of 87 remaining) [2022-11-02 20:29:45,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (75 of 87 remaining) [2022-11-02 20:29:45,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (74 of 87 remaining) [2022-11-02 20:29:45,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (73 of 87 remaining) [2022-11-02 20:29:45,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (72 of 87 remaining) [2022-11-02 20:29:45,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (71 of 87 remaining) [2022-11-02 20:29:45,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (70 of 87 remaining) [2022-11-02 20:29:45,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (69 of 87 remaining) [2022-11-02 20:29:45,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (68 of 87 remaining) [2022-11-02 20:29:45,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (67 of 87 remaining) [2022-11-02 20:29:45,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (66 of 87 remaining) [2022-11-02 20:29:45,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (65 of 87 remaining) [2022-11-02 20:29:45,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (64 of 87 remaining) [2022-11-02 20:29:45,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (63 of 87 remaining) [2022-11-02 20:29:45,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (62 of 87 remaining) [2022-11-02 20:29:45,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (61 of 87 remaining) [2022-11-02 20:29:45,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (60 of 87 remaining) [2022-11-02 20:29:45,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (59 of 87 remaining) [2022-11-02 20:29:45,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (58 of 87 remaining) [2022-11-02 20:29:45,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (57 of 87 remaining) [2022-11-02 20:29:45,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (56 of 87 remaining) [2022-11-02 20:29:45,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (55 of 87 remaining) [2022-11-02 20:29:45,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (54 of 87 remaining) [2022-11-02 20:29:45,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (53 of 87 remaining) [2022-11-02 20:29:45,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (52 of 87 remaining) [2022-11-02 20:29:45,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (51 of 87 remaining) [2022-11-02 20:29:45,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (50 of 87 remaining) [2022-11-02 20:29:45,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (49 of 87 remaining) [2022-11-02 20:29:45,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (48 of 87 remaining) [2022-11-02 20:29:45,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (47 of 87 remaining) [2022-11-02 20:29:45,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (46 of 87 remaining) [2022-11-02 20:29:45,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (45 of 87 remaining) [2022-11-02 20:29:45,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (44 of 87 remaining) [2022-11-02 20:29:45,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 87 remaining) [2022-11-02 20:29:45,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 87 remaining) [2022-11-02 20:29:45,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 87 remaining) [2022-11-02 20:29:45,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 87 remaining) [2022-11-02 20:29:45,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (39 of 87 remaining) [2022-11-02 20:29:45,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (38 of 87 remaining) [2022-11-02 20:29:45,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (37 of 87 remaining) [2022-11-02 20:29:45,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (36 of 87 remaining) [2022-11-02 20:29:45,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (35 of 87 remaining) [2022-11-02 20:29:45,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (34 of 87 remaining) [2022-11-02 20:29:45,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (33 of 87 remaining) [2022-11-02 20:29:45,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (32 of 87 remaining) [2022-11-02 20:29:45,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 87 remaining) [2022-11-02 20:29:45,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 87 remaining) [2022-11-02 20:29:45,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (29 of 87 remaining) [2022-11-02 20:29:45,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 87 remaining) [2022-11-02 20:29:45,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 87 remaining) [2022-11-02 20:29:45,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (26 of 87 remaining) [2022-11-02 20:29:45,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (25 of 87 remaining) [2022-11-02 20:29:45,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 87 remaining) [2022-11-02 20:29:45,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 87 remaining) [2022-11-02 20:29:45,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 87 remaining) [2022-11-02 20:29:45,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 87 remaining) [2022-11-02 20:29:45,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 87 remaining) [2022-11-02 20:29:45,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 87 remaining) [2022-11-02 20:29:45,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 87 remaining) [2022-11-02 20:29:45,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 87 remaining) [2022-11-02 20:29:45,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 87 remaining) [2022-11-02 20:29:45,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (15 of 87 remaining) [2022-11-02 20:29:45,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (14 of 87 remaining) [2022-11-02 20:29:45,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (13 of 87 remaining) [2022-11-02 20:29:45,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 87 remaining) [2022-11-02 20:29:45,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (11 of 87 remaining) [2022-11-02 20:29:45,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (10 of 87 remaining) [2022-11-02 20:29:45,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (9 of 87 remaining) [2022-11-02 20:29:45,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (8 of 87 remaining) [2022-11-02 20:29:45,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (7 of 87 remaining) [2022-11-02 20:29:45,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (6 of 87 remaining) [2022-11-02 20:29:45,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (5 of 87 remaining) [2022-11-02 20:29:45,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (4 of 87 remaining) [2022-11-02 20:29:45,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (3 of 87 remaining) [2022-11-02 20:29:45,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (2 of 87 remaining) [2022-11-02 20:29:45,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (1 of 87 remaining) [2022-11-02 20:29:45,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (0 of 87 remaining) [2022-11-02 20:29:45,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:29:45,233 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:45,241 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:29:45,241 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:29:45,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:29:45 BasicIcfg [2022-11-02 20:29:45,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:29:45,249 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:29:45,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:29:45,249 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:29:45,250 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:29:26" (3/4) ... [2022-11-02 20:29:45,254 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:29:45,262 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:29:45,263 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:29:45,263 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:29:45,264 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-02 20:29:45,275 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-02 20:29:45,275 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:29:45,276 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:29:45,276 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:29:45,361 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:29:45,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:29:45,362 INFO L158 Benchmark]: Toolchain (without parser) took 20229.18ms. Allocated memory was 138.4MB in the beginning and 748.7MB in the end (delta: 610.3MB). Free memory was 102.7MB in the beginning and 211.9MB in the end (delta: -109.3MB). Peak memory consumption was 501.5MB. Max. memory is 16.1GB. [2022-11-02 20:29:45,363 INFO L158 Benchmark]: CDTParser took 14.39ms. Allocated memory was 88.1MB in the beginning and 138.4MB in the end (delta: 50.3MB). Free memory was 58.1MB in the beginning and 118.7MB in the end (delta: -60.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:29:45,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.06ms. Allocated memory is still 138.4MB. Free memory was 102.3MB in the beginning and 112.2MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:29:45,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.72ms. Allocated memory is still 138.4MB. Free memory was 112.2MB in the beginning and 109.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:29:45,367 INFO L158 Benchmark]: Boogie Preprocessor took 41.93ms. Allocated memory is still 138.4MB. Free memory was 109.9MB in the beginning and 108.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:29:45,368 INFO L158 Benchmark]: RCFGBuilder took 1281.06ms. Allocated memory is still 138.4MB. Free memory was 108.0MB in the beginning and 82.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-02 20:29:45,368 INFO L158 Benchmark]: TraceAbstraction took 18301.83ms. Allocated memory was 138.4MB in the beginning and 748.7MB in the end (delta: 610.3MB). Free memory was 82.2MB in the beginning and 216.1MB in the end (delta: -133.9MB). Peak memory consumption was 479.2MB. Max. memory is 16.1GB. [2022-11-02 20:29:45,369 INFO L158 Benchmark]: Witness Printer took 112.11ms. Allocated memory is still 748.7MB. Free memory was 216.1MB in the beginning and 211.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:29:45,373 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 14.39ms. Allocated memory was 88.1MB in the beginning and 138.4MB in the end (delta: 50.3MB). Free memory was 58.1MB in the beginning and 118.7MB in the end (delta: -60.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.06ms. Allocated memory is still 138.4MB. Free memory was 102.3MB in the beginning and 112.2MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.72ms. Allocated memory is still 138.4MB. Free memory was 112.2MB in the beginning and 109.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.93ms. Allocated memory is still 138.4MB. Free memory was 109.9MB in the beginning and 108.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1281.06ms. Allocated memory is still 138.4MB. Free memory was 108.0MB in the beginning and 82.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18301.83ms. Allocated memory was 138.4MB in the beginning and 748.7MB in the end (delta: 610.3MB). Free memory was 82.2MB in the beginning and 216.1MB in the end (delta: -133.9MB). Peak memory consumption was 479.2MB. Max. memory is 16.1GB. * Witness Printer took 112.11ms. Allocated memory is still 748.7MB. Free memory was 216.1MB in the beginning and 211.9MB 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: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 466 locations, 87 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: 18.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 452 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 927 IncrementalHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 443 mSDtfsCounter, 927 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=646occurred in iteration=9, InterpolantAutomatonStates: 83, 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.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1855 NumberOfCodeBlocks, 1855 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1832 ConstructedInterpolants, 0 QuantifiedInterpolants, 2194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 51 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:29:45,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31e00198-22ad-4296-b2d4-79cb7a0ec147/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE