./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:18:38,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:18:38,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:18:38,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:18:38,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:18:38,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:18:38,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:18:38,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:18:38,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:18:38,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:18:38,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:18:38,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:18:38,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:18:38,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:18:38,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:18:38,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:18:38,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:18:38,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:18:38,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:18:38,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:18:38,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:18:38,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:18:38,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:18:38,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:18:38,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:18:38,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:18:38,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:18:38,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:18:38,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:18:38,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:18:38,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:18:38,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:18:38,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:18:38,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:18:38,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:18:38,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:18:38,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:18:38,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:18:38,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:18:38,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:18:38,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:18:38,800 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 12:18:38,824 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:18:38,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:18:38,824 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:18:38,825 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:18:38,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:18:38,826 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:18:38,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:18:38,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:18:38,827 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:18:38,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:18:38,828 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:18:38,828 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:18:38,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:18:38,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:18:38,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:18:38,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:18:38,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:18:38,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:18:38,829 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 12:18:38,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:18:38,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:18:38,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:18:38,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:18:38,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:18:38,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:18:38,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:18:38,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:18:38,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:18:38,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:18:38,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:18:38,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:18:38,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:18:38,833 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:18:38,833 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:18:38,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:18:38,833 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_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 [2022-11-16 12:18:39,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:18:39,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:18:39,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:18:39,139 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:18:39,140 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:18:39,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2022-11-16 12:18:39,247 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/data/57cddaa62/4691abd48052440a818ee10c64bb3a39/FLAG2d0e13eb8 [2022-11-16 12:18:39,725 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:18:39,726 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2022-11-16 12:18:39,737 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/data/57cddaa62/4691abd48052440a818ee10c64bb3a39/FLAG2d0e13eb8 [2022-11-16 12:18:40,098 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/data/57cddaa62/4691abd48052440a818ee10c64bb3a39 [2022-11-16 12:18:40,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:18:40,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:18:40,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:18:40,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:18:40,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:18:40,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0a02be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40, skipping insertion in model container [2022-11-16 12:18:40,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:18:40,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:18:40,435 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2022-11-16 12:18:40,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:18:40,464 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:18:40,527 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2022-11-16 12:18:40,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:18:40,545 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:18:40,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40 WrapperNode [2022-11-16 12:18:40,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:18:40,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:18:40,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:18:40,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:18:40,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,637 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 271 [2022-11-16 12:18:40,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:18:40,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:18:40,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:18:40,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:18:40,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,710 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:18:40,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:18:40,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:18:40,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:18:40,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (1/1) ... [2022-11-16 12:18:40,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:18:40,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:40,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:18:40,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:18:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:18:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:18:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:18:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:18:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 12:18:40,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 12:18:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 12:18:40,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 12:18:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 12:18:40,811 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 12:18:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-16 12:18:40,811 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-16 12:18:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:18:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-11-16 12:18:40,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-11-16 12:18:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-11-16 12:18:40,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-11-16 12:18:40,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:18:40,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:18:40,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:18:40,815 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:18:40,986 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:18:40,997 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:18:41,977 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:18:41,991 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:18:41,991 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-16 12:18:41,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:18:41 BoogieIcfgContainer [2022-11-16 12:18:41,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:18:41,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:18:41,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:18:42,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:18:42,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:18:40" (1/3) ... [2022-11-16 12:18:42,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b03a7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:42, skipping insertion in model container [2022-11-16 12:18:42,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:40" (2/3) ... [2022-11-16 12:18:42,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b03a7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:42, skipping insertion in model container [2022-11-16 12:18:42,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:18:41" (3/3) ... [2022-11-16 12:18:42,008 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2022-11-16 12:18:42,026 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:18:42,038 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:18:42,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-11-16 12:18:42,038 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:18:42,236 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-11-16 12:18:42,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 458 places, 463 transitions, 974 flow [2022-11-16 12:18:42,568 INFO L130 PetriNetUnfolder]: 24/457 cut-off events. [2022-11-16 12:18:42,568 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 12:18:42,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 24/457 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 806 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 285. Up to 2 conditions per place. [2022-11-16 12:18:42,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 458 places, 463 transitions, 974 flow [2022-11-16 12:18:42,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 418 places, 421 transitions, 878 flow [2022-11-16 12:18:42,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:18:42,629 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;@58afff7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:18:42,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2022-11-16 12:18:42,636 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-11-16 12:18:42,637 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:18:42,637 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:18:42,638 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:42,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:18:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1336015694, now seen corresponding path program 1 times [2022-11-16 12:18:42,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:42,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500388183] [2022-11-16 12:18:42,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:18:43,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:43,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500388183] [2022-11-16 12:18:43,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500388183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:43,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:43,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:18:43,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679600566] [2022-11-16 12:18:43,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:43,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:18:43,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:43,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:18:43,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:18:43,132 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-16 12:18:43,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 421 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:43,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:18:43,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-16 12:18:43,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:18:43,453 INFO L130 PetriNetUnfolder]: 80/583 cut-off events. [2022-11-16 12:18:43,453 INFO L131 PetriNetUnfolder]: For 84/91 co-relation queries the response was YES. [2022-11-16 12:18:43,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 583 events. 80/583 cut-off events. For 84/91 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2246 event pairs, 60 based on Foata normal form. 211/668 useless extension candidates. Maximal degree in co-relation 614. Up to 157 conditions per place. [2022-11-16 12:18:43,469 INFO L137 encePairwiseOnDemand]: 453/463 looper letters, 36 selfloop transitions, 2 changer transitions 1/413 dead transitions. [2022-11-16 12:18:43,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 413 transitions, 938 flow [2022-11-16 12:18:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:18:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:18:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2022-11-16 12:18:43,498 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9294456443484521 [2022-11-16 12:18:43,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1291 transitions. [2022-11-16 12:18:43,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1291 transitions. [2022-11-16 12:18:43,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:18:43,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1291 transitions. [2022-11-16 12:18:43,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:43,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:43,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:43,569 INFO L175 Difference]: Start difference. First operand has 418 places, 421 transitions, 878 flow. Second operand 3 states and 1291 transitions. [2022-11-16 12:18:43,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 413 transitions, 938 flow [2022-11-16 12:18:43,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 413 transitions, 914 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-11-16 12:18:43,596 INFO L231 Difference]: Finished difference. Result has 407 places, 412 transitions, 840 flow [2022-11-16 12:18:43,599 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=407, PETRI_TRANSITIONS=412} [2022-11-16 12:18:43,604 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -11 predicate places. [2022-11-16 12:18:43,605 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 412 transitions, 840 flow [2022-11-16 12:18:43,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:43,606 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:18:43,607 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:43,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:18:43,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:18:43,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1730917584, now seen corresponding path program 1 times [2022-11-16 12:18:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:43,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357928648] [2022-11-16 12:18:43,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:18:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:43,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357928648] [2022-11-16 12:18:43,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357928648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:43,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:43,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:18:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612460341] [2022-11-16 12:18:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:43,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:18:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:43,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:18:43,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:18:43,795 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-16 12:18:43,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 412 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:43,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:18:43,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-16 12:18:43,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:18:44,114 INFO L130 PetriNetUnfolder]: 80/581 cut-off events. [2022-11-16 12:18:44,114 INFO L131 PetriNetUnfolder]: For 18/24 co-relation queries the response was YES. [2022-11-16 12:18:44,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 581 events. 80/581 cut-off events. For 18/24 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2230 event pairs, 60 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 761. Up to 157 conditions per place. [2022-11-16 12:18:44,128 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2022-11-16 12:18:44,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 914 flow [2022-11-16 12:18:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:18:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:18:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-16 12:18:44,133 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-16 12:18:44,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-16 12:18:44,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-16 12:18:44,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:18:44,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-16 12:18:44,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:44,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:44,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:44,144 INFO L175 Difference]: Start difference. First operand has 407 places, 412 transitions, 840 flow. Second operand 3 states and 1284 transitions. [2022-11-16 12:18:44,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 914 flow [2022-11-16 12:18:44,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 411 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:18:44,156 INFO L231 Difference]: Finished difference. Result has 405 places, 411 transitions, 838 flow [2022-11-16 12:18:44,157 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=405, PETRI_TRANSITIONS=411} [2022-11-16 12:18:44,159 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -13 predicate places. [2022-11-16 12:18:44,159 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 411 transitions, 838 flow [2022-11-16 12:18:44,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:44,161 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:18:44,161 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:44,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:18:44,161 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:18:44,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:44,162 INFO L85 PathProgramCache]: Analyzing trace with hash 740256022, now seen corresponding path program 1 times [2022-11-16 12:18:44,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:44,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884965037] [2022-11-16 12:18:44,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:18:44,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:44,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884965037] [2022-11-16 12:18:44,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884965037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:44,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:44,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:18:44,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023132353] [2022-11-16 12:18:44,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:44,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:18:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:18:44,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:18:44,312 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-16 12:18:44,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 411 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:44,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:18:44,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-16 12:18:44,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:18:44,556 INFO L130 PetriNetUnfolder]: 80/580 cut-off events. [2022-11-16 12:18:44,557 INFO L131 PetriNetUnfolder]: For 30/36 co-relation queries the response was YES. [2022-11-16 12:18:44,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 580 events. 80/580 cut-off events. For 30/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2205 event pairs, 60 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 742. Up to 157 conditions per place. [2022-11-16 12:18:44,574 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2022-11-16 12:18:44,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 410 transitions, 912 flow [2022-11-16 12:18:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:18:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:18:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-16 12:18:44,579 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-16 12:18:44,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-16 12:18:44,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-16 12:18:44,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:18:44,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-16 12:18:44,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:44,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:44,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:44,591 INFO L175 Difference]: Start difference. First operand has 405 places, 411 transitions, 838 flow. Second operand 3 states and 1284 transitions. [2022-11-16 12:18:44,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 410 transitions, 912 flow [2022-11-16 12:18:44,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 410 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:18:44,601 INFO L231 Difference]: Finished difference. Result has 404 places, 410 transitions, 836 flow [2022-11-16 12:18:44,602 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=404, PETRI_TRANSITIONS=410} [2022-11-16 12:18:44,606 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -14 predicate places. [2022-11-16 12:18:44,606 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 410 transitions, 836 flow [2022-11-16 12:18:44,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:44,608 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:18:44,608 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:44,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:18:44,609 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:18:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:44,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1949606868, now seen corresponding path program 1 times [2022-11-16 12:18:44,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:44,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618559144] [2022-11-16 12:18:44,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:44,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:18:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:44,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618559144] [2022-11-16 12:18:44,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618559144] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:44,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:44,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:18:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066143613] [2022-11-16 12:18:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:44,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:18:44,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:18:44,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:18:44,728 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-16 12:18:44,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 410 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:44,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:18:44,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-16 12:18:44,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:18:44,983 INFO L130 PetriNetUnfolder]: 80/579 cut-off events. [2022-11-16 12:18:44,984 INFO L131 PetriNetUnfolder]: For 42/48 co-relation queries the response was YES. [2022-11-16 12:18:44,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 579 events. 80/579 cut-off events. For 42/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2169 event pairs, 60 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 723. Up to 157 conditions per place. [2022-11-16 12:18:44,997 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2022-11-16 12:18:44,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 409 transitions, 910 flow [2022-11-16 12:18:45,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:18:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:18:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-16 12:18:45,006 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-16 12:18:45,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-16 12:18:45,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-16 12:18:45,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:18:45,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-16 12:18:45,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,023 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,023 INFO L175 Difference]: Start difference. First operand has 404 places, 410 transitions, 836 flow. Second operand 3 states and 1284 transitions. [2022-11-16 12:18:45,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 409 transitions, 910 flow [2022-11-16 12:18:45,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 409 transitions, 906 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:18:45,035 INFO L231 Difference]: Finished difference. Result has 403 places, 409 transitions, 834 flow [2022-11-16 12:18:45,036 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=403, PETRI_TRANSITIONS=409} [2022-11-16 12:18:45,037 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -15 predicate places. [2022-11-16 12:18:45,038 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 409 transitions, 834 flow [2022-11-16 12:18:45,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,039 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:18:45,039 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:45,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:18:45,040 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:18:45,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1482091646, now seen corresponding path program 1 times [2022-11-16 12:18:45,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:45,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233064905] [2022-11-16 12:18:45,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:45,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:18:45,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:45,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233064905] [2022-11-16 12:18:45,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233064905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:45,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:45,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:18:45,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721415890] [2022-11-16 12:18:45,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:45,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:18:45,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:45,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:18:45,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:18:45,133 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-16 12:18:45,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 409 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:18:45,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-16 12:18:45,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:18:45,400 INFO L130 PetriNetUnfolder]: 80/578 cut-off events. [2022-11-16 12:18:45,400 INFO L131 PetriNetUnfolder]: For 54/60 co-relation queries the response was YES. [2022-11-16 12:18:45,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 578 events. 80/578 cut-off events. For 54/60 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2126 event pairs, 60 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 704. Up to 157 conditions per place. [2022-11-16 12:18:45,413 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2022-11-16 12:18:45,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 408 transitions, 908 flow [2022-11-16 12:18:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:18:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:18:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-16 12:18:45,417 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-16 12:18:45,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-16 12:18:45,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-16 12:18:45,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:18:45,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-16 12:18:45,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,428 INFO L175 Difference]: Start difference. First operand has 403 places, 409 transitions, 834 flow. Second operand 3 states and 1284 transitions. [2022-11-16 12:18:45,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 408 transitions, 908 flow [2022-11-16 12:18:45,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 408 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:18:45,475 INFO L231 Difference]: Finished difference. Result has 402 places, 408 transitions, 832 flow [2022-11-16 12:18:45,476 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=402, PETRI_TRANSITIONS=408} [2022-11-16 12:18:45,479 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -16 predicate places. [2022-11-16 12:18:45,479 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 408 transitions, 832 flow [2022-11-16 12:18:45,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,481 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:18:45,481 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:45,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:18:45,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:18:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1485355233, now seen corresponding path program 1 times [2022-11-16 12:18:45,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:45,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570976353] [2022-11-16 12:18:45,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:45,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:45,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-16 12:18:45,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:45,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570976353] [2022-11-16 12:18:45,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570976353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:45,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:45,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:18:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822827887] [2022-11-16 12:18:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:45,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:18:45,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:45,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:18:45,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:18:45,592 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-16 12:18:45,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 408 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:18:45,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-16 12:18:45,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:18:45,828 INFO L130 PetriNetUnfolder]: 80/577 cut-off events. [2022-11-16 12:18:45,828 INFO L131 PetriNetUnfolder]: For 66/72 co-relation queries the response was YES. [2022-11-16 12:18:45,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 577 events. 80/577 cut-off events. For 66/72 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2128 event pairs, 60 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 684. Up to 156 conditions per place. [2022-11-16 12:18:45,846 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 35 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2022-11-16 12:18:45,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 407 transitions, 904 flow [2022-11-16 12:18:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:18:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:18:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2022-11-16 12:18:45,850 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9236861051115911 [2022-11-16 12:18:45,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2022-11-16 12:18:45,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2022-11-16 12:18:45,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:18:45,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2022-11-16 12:18:45,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,861 INFO L175 Difference]: Start difference. First operand has 402 places, 408 transitions, 832 flow. Second operand 3 states and 1283 transitions. [2022-11-16 12:18:45,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 407 transitions, 904 flow [2022-11-16 12:18:45,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 407 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:18:45,871 INFO L231 Difference]: Finished difference. Result has 401 places, 407 transitions, 830 flow [2022-11-16 12:18:45,872 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=401, PETRI_TRANSITIONS=407} [2022-11-16 12:18:45,875 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -17 predicate places. [2022-11-16 12:18:45,875 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 407 transitions, 830 flow [2022-11-16 12:18:45,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,877 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:18:45,878 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:45,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:18:45,878 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:18:45,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1143953655, now seen corresponding path program 1 times [2022-11-16 12:18:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:45,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472167163] [2022-11-16 12:18:45,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:18:45,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:45,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472167163] [2022-11-16 12:18:45,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472167163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:45,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:45,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:18:45,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567402775] [2022-11-16 12:18:45,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:45,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:18:45,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:45,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:18:45,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:18:45,965 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-16 12:18:45,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 407 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:18:45,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:18:45,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-16 12:18:45,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:01,008 INFO L130 PetriNetUnfolder]: 26740/76416 cut-off events. [2022-11-16 12:19:01,008 INFO L131 PetriNetUnfolder]: For 1365/1736 co-relation queries the response was YES. [2022-11-16 12:19:01,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108529 conditions, 76416 events. 26740/76416 cut-off events. For 1365/1736 co-relation queries the response was YES. Maximal size of possible extension queue 3869. Compared 1069678 event pairs, 23895 based on Foata normal form. 0/55614 useless extension candidates. Maximal degree in co-relation 108462. Up to 30742 conditions per place. [2022-11-16 12:19:02,545 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 51 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2022-11-16 12:19:02,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 406 transitions, 934 flow [2022-11-16 12:19:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2022-11-16 12:19:02,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9028077753779697 [2022-11-16 12:19:02,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1254 transitions. [2022-11-16 12:19:02,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1254 transitions. [2022-11-16 12:19:02,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:02,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1254 transitions. [2022-11-16 12:19:02,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:02,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:02,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:02,562 INFO L175 Difference]: Start difference. First operand has 401 places, 407 transitions, 830 flow. Second operand 3 states and 1254 transitions. [2022-11-16 12:19:02,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 406 transitions, 934 flow [2022-11-16 12:19:02,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 406 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:19:02,573 INFO L231 Difference]: Finished difference. Result has 400 places, 406 transitions, 828 flow [2022-11-16 12:19:02,574 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=400, PETRI_TRANSITIONS=406} [2022-11-16 12:19:02,574 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -18 predicate places. [2022-11-16 12:19:02,575 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 406 transitions, 828 flow [2022-11-16 12:19:02,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:02,576 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:02,576 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:02,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:19:02,577 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2022394243, now seen corresponding path program 1 times [2022-11-16 12:19:02,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:02,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723336927] [2022-11-16 12:19:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:02,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:02,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723336927] [2022-11-16 12:19:02,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723336927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:02,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:02,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:02,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077708208] [2022-11-16 12:19:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:02,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:02,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:02,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:02,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:02,659 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-16 12:19:02,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 406 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:02,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:02,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-16 12:19:02,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:02,810 INFO L130 PetriNetUnfolder]: 65/546 cut-off events. [2022-11-16 12:19:02,810 INFO L131 PetriNetUnfolder]: For 6/11 co-relation queries the response was YES. [2022-11-16 12:19:02,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 546 events. 65/546 cut-off events. For 6/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1931 event pairs, 30 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 653. Up to 90 conditions per place. [2022-11-16 12:19:02,819 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 32 selfloop transitions, 3 changer transitions 0/406 dead transitions. [2022-11-16 12:19:02,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 406 transitions, 903 flow [2022-11-16 12:19:02,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2022-11-16 12:19:02,823 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9323254139668826 [2022-11-16 12:19:02,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2022-11-16 12:19:02,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2022-11-16 12:19:02,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:02,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2022-11-16 12:19:02,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:02,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:02,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:02,833 INFO L175 Difference]: Start difference. First operand has 400 places, 406 transitions, 828 flow. Second operand 3 states and 1295 transitions. [2022-11-16 12:19:02,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 406 transitions, 903 flow [2022-11-16 12:19:02,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 406 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:19:02,843 INFO L231 Difference]: Finished difference. Result has 395 places, 401 transitions, 825 flow [2022-11-16 12:19:02,844 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=825, PETRI_PLACES=395, PETRI_TRANSITIONS=401} [2022-11-16 12:19:02,845 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -23 predicate places. [2022-11-16 12:19:02,845 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 401 transitions, 825 flow [2022-11-16 12:19:02,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:02,846 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:02,846 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:02,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:19:02,847 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2099345529, now seen corresponding path program 1 times [2022-11-16 12:19:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:02,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691556536] [2022-11-16 12:19:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:02,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691556536] [2022-11-16 12:19:02,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691556536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:02,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:02,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954200729] [2022-11-16 12:19:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:02,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:02,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:02,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:02,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:02,907 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-16 12:19:02,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 401 transitions, 825 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:02,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:02,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-16 12:19:02,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:03,065 INFO L130 PetriNetUnfolder]: 65/541 cut-off events. [2022-11-16 12:19:03,066 INFO L131 PetriNetUnfolder]: For 16/20 co-relation queries the response was YES. [2022-11-16 12:19:03,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 541 events. 65/541 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1945 event pairs, 30 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 634. Up to 90 conditions per place. [2022-11-16 12:19:03,075 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 32 selfloop transitions, 3 changer transitions 0/401 dead transitions. [2022-11-16 12:19:03,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 401 transitions, 900 flow [2022-11-16 12:19:03,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2022-11-16 12:19:03,079 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9323254139668826 [2022-11-16 12:19:03,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2022-11-16 12:19:03,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2022-11-16 12:19:03,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:03,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2022-11-16 12:19:03,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:03,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:03,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:03,108 INFO L175 Difference]: Start difference. First operand has 395 places, 401 transitions, 825 flow. Second operand 3 states and 1295 transitions. [2022-11-16 12:19:03,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 401 transitions, 900 flow [2022-11-16 12:19:03,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 401 transitions, 897 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:19:03,117 INFO L231 Difference]: Finished difference. Result has 391 places, 396 transitions, 823 flow [2022-11-16 12:19:03,118 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=391, PETRI_TRANSITIONS=396} [2022-11-16 12:19:03,119 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -27 predicate places. [2022-11-16 12:19:03,120 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 396 transitions, 823 flow [2022-11-16 12:19:03,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:03,121 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:03,121 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:03,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:19:03,121 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:03,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1479418596, now seen corresponding path program 1 times [2022-11-16 12:19:03,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:03,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603236552] [2022-11-16 12:19:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:03,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603236552] [2022-11-16 12:19:03,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603236552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:03,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:03,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:03,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407061083] [2022-11-16 12:19:03,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:03,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:03,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:03,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:03,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:03,224 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-16 12:19:03,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 396 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:03,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:03,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-16 12:19:03,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:03,719 INFO L130 PetriNetUnfolder]: 81/896 cut-off events. [2022-11-16 12:19:03,719 INFO L131 PetriNetUnfolder]: For 28/32 co-relation queries the response was YES. [2022-11-16 12:19:03,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 896 events. 81/896 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4418 event pairs, 33 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 994. Up to 90 conditions per place. [2022-11-16 12:19:03,733 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 35 selfloop transitions, 3 changer transitions 0/399 dead transitions. [2022-11-16 12:19:03,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 399 transitions, 913 flow [2022-11-16 12:19:03,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2022-11-16 12:19:03,737 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9344852411807055 [2022-11-16 12:19:03,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1298 transitions. [2022-11-16 12:19:03,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1298 transitions. [2022-11-16 12:19:03,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:03,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1298 transitions. [2022-11-16 12:19:03,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:03,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:03,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:03,746 INFO L175 Difference]: Start difference. First operand has 391 places, 396 transitions, 823 flow. Second operand 3 states and 1298 transitions. [2022-11-16 12:19:03,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 399 transitions, 913 flow [2022-11-16 12:19:03,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 399 transitions, 910 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:19:03,756 INFO L231 Difference]: Finished difference. Result has 387 places, 391 transitions, 821 flow [2022-11-16 12:19:03,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=387, PETRI_TRANSITIONS=391} [2022-11-16 12:19:03,758 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -31 predicate places. [2022-11-16 12:19:03,759 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 391 transitions, 821 flow [2022-11-16 12:19:03,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:03,760 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:03,760 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:03,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:19:03,760 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash -87068456, now seen corresponding path program 1 times [2022-11-16 12:19:03,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:03,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299627895] [2022-11-16 12:19:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:03,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:03,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:03,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299627895] [2022-11-16 12:19:03,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299627895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:03,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:03,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948106045] [2022-11-16 12:19:03,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:03,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:03,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:03,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:03,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:03,839 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-16 12:19:03,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 391 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:03,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:03,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-16 12:19:03,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:04,114 INFO L130 PetriNetUnfolder]: 123/936 cut-off events. [2022-11-16 12:19:04,114 INFO L131 PetriNetUnfolder]: For 65/69 co-relation queries the response was YES. [2022-11-16 12:19:04,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 936 events. 123/936 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4836 event pairs, 47 based on Foata normal form. 1/777 useless extension candidates. Maximal degree in co-relation 801. Up to 150 conditions per place. [2022-11-16 12:19:04,132 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 36 selfloop transitions, 3 changer transitions 0/395 dead transitions. [2022-11-16 12:19:04,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 395 transitions, 916 flow [2022-11-16 12:19:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2022-11-16 12:19:04,137 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9352051835853131 [2022-11-16 12:19:04,137 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1299 transitions. [2022-11-16 12:19:04,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1299 transitions. [2022-11-16 12:19:04,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:04,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1299 transitions. [2022-11-16 12:19:04,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:04,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:04,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:04,145 INFO L175 Difference]: Start difference. First operand has 387 places, 391 transitions, 821 flow. Second operand 3 states and 1299 transitions. [2022-11-16 12:19:04,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 395 transitions, 916 flow [2022-11-16 12:19:04,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 395 transitions, 913 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:19:04,155 INFO L231 Difference]: Finished difference. Result has 383 places, 386 transitions, 819 flow [2022-11-16 12:19:04,156 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=819, PETRI_PLACES=383, PETRI_TRANSITIONS=386} [2022-11-16 12:19:04,156 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -35 predicate places. [2022-11-16 12:19:04,156 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 386 transitions, 819 flow [2022-11-16 12:19:04,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:04,157 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:04,157 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:04,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:19:04,158 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:04,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:04,158 INFO L85 PathProgramCache]: Analyzing trace with hash -91411477, now seen corresponding path program 1 times [2022-11-16 12:19:04,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:04,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653342828] [2022-11-16 12:19:04,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:04,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:04,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:04,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653342828] [2022-11-16 12:19:04,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653342828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:04,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:04,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:04,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121251528] [2022-11-16 12:19:04,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:04,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:04,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:04,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:04,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:04,231 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-16 12:19:04,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 386 transitions, 819 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:04,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:04,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-16 12:19:04,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:04,608 INFO L130 PetriNetUnfolder]: 136/1506 cut-off events. [2022-11-16 12:19:04,608 INFO L131 PetriNetUnfolder]: For 94/98 co-relation queries the response was YES. [2022-11-16 12:19:04,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 1506 events. 136/1506 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9289 event pairs, 59 based on Foata normal form. 0/1285 useless extension candidates. Maximal degree in co-relation 1080. Up to 167 conditions per place. [2022-11-16 12:19:04,635 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 37 selfloop transitions, 3 changer transitions 0/391 dead transitions. [2022-11-16 12:19:04,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 391 transitions, 919 flow [2022-11-16 12:19:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2022-11-16 12:19:04,639 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9359251259899208 [2022-11-16 12:19:04,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1300 transitions. [2022-11-16 12:19:04,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1300 transitions. [2022-11-16 12:19:04,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:04,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1300 transitions. [2022-11-16 12:19:04,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:04,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:04,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:04,648 INFO L175 Difference]: Start difference. First operand has 383 places, 386 transitions, 819 flow. Second operand 3 states and 1300 transitions. [2022-11-16 12:19:04,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 391 transitions, 919 flow [2022-11-16 12:19:04,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 391 transitions, 916 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:19:04,657 INFO L231 Difference]: Finished difference. Result has 379 places, 381 transitions, 817 flow [2022-11-16 12:19:04,657 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=379, PETRI_TRANSITIONS=381} [2022-11-16 12:19:04,658 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -39 predicate places. [2022-11-16 12:19:04,658 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 381 transitions, 817 flow [2022-11-16 12:19:04,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:04,659 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:04,659 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:04,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:19:04,660 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:04,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1947059132, now seen corresponding path program 1 times [2022-11-16 12:19:04,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:04,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254096773] [2022-11-16 12:19:04,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:04,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:04,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:04,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254096773] [2022-11-16 12:19:04,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254096773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:04,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:04,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:04,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790032983] [2022-11-16 12:19:04,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:04,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:04,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:04,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:04,707 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-16 12:19:04,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 381 transitions, 817 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:04,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:04,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-16 12:19:04,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:05,137 INFO L130 PetriNetUnfolder]: 205/1762 cut-off events. [2022-11-16 12:19:05,137 INFO L131 PetriNetUnfolder]: For 185/189 co-relation queries the response was YES. [2022-11-16 12:19:05,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2254 conditions, 1762 events. 205/1762 cut-off events. For 185/189 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11644 event pairs, 104 based on Foata normal form. 1/1499 useless extension candidates. Maximal degree in co-relation 1036. Up to 261 conditions per place. [2022-11-16 12:19:05,166 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 36 selfloop transitions, 3 changer transitions 8/387 dead transitions. [2022-11-16 12:19:05,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 387 transitions, 920 flow [2022-11-16 12:19:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2022-11-16 12:19:05,170 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9359251259899208 [2022-11-16 12:19:05,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1300 transitions. [2022-11-16 12:19:05,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1300 transitions. [2022-11-16 12:19:05,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:05,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1300 transitions. [2022-11-16 12:19:05,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:05,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:05,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:05,184 INFO L175 Difference]: Start difference. First operand has 379 places, 381 transitions, 817 flow. Second operand 3 states and 1300 transitions. [2022-11-16 12:19:05,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 387 transitions, 920 flow [2022-11-16 12:19:05,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 387 transitions, 917 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:19:05,192 INFO L231 Difference]: Finished difference. Result has 375 places, 368 transitions, 799 flow [2022-11-16 12:19:05,193 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=375, PETRI_TRANSITIONS=368} [2022-11-16 12:19:05,193 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -43 predicate places. [2022-11-16 12:19:05,194 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 368 transitions, 799 flow [2022-11-16 12:19:05,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:05,194 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:05,195 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:05,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:19:05,195 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:05,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 427726989, now seen corresponding path program 1 times [2022-11-16 12:19:05,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:05,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700087078] [2022-11-16 12:19:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:05,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:05,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700087078] [2022-11-16 12:19:05,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700087078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:05,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:05,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041026636] [2022-11-16 12:19:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:05,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:05,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:05,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:05,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:05,253 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 463 [2022-11-16 12:19:05,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 368 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:05,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:05,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 463 [2022-11-16 12:19:05,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:14,790 INFO L130 PetriNetUnfolder]: 16691/55209 cut-off events. [2022-11-16 12:19:14,791 INFO L131 PetriNetUnfolder]: For 1608/2188 co-relation queries the response was YES. [2022-11-16 12:19:15,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78893 conditions, 55209 events. 16691/55209 cut-off events. For 1608/2188 co-relation queries the response was YES. Maximal size of possible extension queue 2245. Compared 761311 event pairs, 7678 based on Foata normal form. 5/48007 useless extension candidates. Maximal degree in co-relation 27795. Up to 18943 conditions per place. [2022-11-16 12:19:15,534 INFO L137 encePairwiseOnDemand]: 445/463 looper letters, 30 selfloop transitions, 6 changer transitions 59/367 dead transitions. [2022-11-16 12:19:15,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 367 transitions, 898 flow [2022-11-16 12:19:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2022-11-16 12:19:15,540 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9136069114470843 [2022-11-16 12:19:15,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1269 transitions. [2022-11-16 12:19:15,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1269 transitions. [2022-11-16 12:19:15,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:15,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1269 transitions. [2022-11-16 12:19:15,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:15,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:15,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:15,933 INFO L175 Difference]: Start difference. First operand has 375 places, 368 transitions, 799 flow. Second operand 3 states and 1269 transitions. [2022-11-16 12:19:15,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 367 transitions, 898 flow [2022-11-16 12:19:16,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 367 transitions, 895 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:19:16,193 INFO L231 Difference]: Finished difference. Result has 358 places, 303 transitions, 695 flow [2022-11-16 12:19:16,193 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=358, PETRI_TRANSITIONS=303} [2022-11-16 12:19:16,194 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -60 predicate places. [2022-11-16 12:19:16,194 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 303 transitions, 695 flow [2022-11-16 12:19:16,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:16,195 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:16,195 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:16,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:19:16,196 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1253586922, now seen corresponding path program 1 times [2022-11-16 12:19:16,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:16,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077261656] [2022-11-16 12:19:16,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:16,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:16,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077261656] [2022-11-16 12:19:16,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077261656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:16,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:16,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:16,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895121744] [2022-11-16 12:19:16,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:16,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:16,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:16,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:16,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:16,256 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-16 12:19:16,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 303 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:16,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:16,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-16 12:19:16,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:17,496 INFO L130 PetriNetUnfolder]: 1592/7175 cut-off events. [2022-11-16 12:19:17,496 INFO L131 PetriNetUnfolder]: For 37/57 co-relation queries the response was YES. [2022-11-16 12:19:17,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10116 conditions, 7175 events. 1592/7175 cut-off events. For 37/57 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 77355 event pairs, 442 based on Foata normal form. 0/6037 useless extension candidates. Maximal degree in co-relation 5406. Up to 1524 conditions per place. [2022-11-16 12:19:17,620 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2022-11-16 12:19:17,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 307 transitions, 770 flow [2022-11-16 12:19:17,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-16 12:19:17,625 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-16 12:19:17,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-16 12:19:17,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-16 12:19:17,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:17,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-16 12:19:17,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:17,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:17,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:17,634 INFO L175 Difference]: Start difference. First operand has 358 places, 303 transitions, 695 flow. Second operand 3 states and 1279 transitions. [2022-11-16 12:19:17,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 307 transitions, 770 flow [2022-11-16 12:19:17,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 307 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:19:17,645 INFO L231 Difference]: Finished difference. Result has 306 places, 302 transitions, 697 flow [2022-11-16 12:19:17,646 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=304, 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=697, PETRI_PLACES=306, PETRI_TRANSITIONS=302} [2022-11-16 12:19:17,646 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -112 predicate places. [2022-11-16 12:19:17,646 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 302 transitions, 697 flow [2022-11-16 12:19:17,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:17,647 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:17,648 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:17,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:19:17,648 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:17,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:17,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1568621509, now seen corresponding path program 1 times [2022-11-16 12:19:17,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:17,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448947428] [2022-11-16 12:19:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:17,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:17,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:17,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448947428] [2022-11-16 12:19:17,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448947428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:17,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:17,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592101135] [2022-11-16 12:19:17,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:17,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:17,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:17,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:17,711 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-16 12:19:17,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 302 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:17,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:17,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-16 12:19:17,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:19,283 INFO L130 PetriNetUnfolder]: 2189/8489 cut-off events. [2022-11-16 12:19:19,283 INFO L131 PetriNetUnfolder]: For 89/117 co-relation queries the response was YES. [2022-11-16 12:19:19,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13097 conditions, 8489 events. 2189/8489 cut-off events. For 89/117 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 92735 event pairs, 838 based on Foata normal form. 0/7379 useless extension candidates. Maximal degree in co-relation 12747. Up to 1755 conditions per place. [2022-11-16 12:19:19,430 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2022-11-16 12:19:19,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 306 transitions, 772 flow [2022-11-16 12:19:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-16 12:19:19,436 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-16 12:19:19,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-16 12:19:19,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-16 12:19:19,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:19,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-16 12:19:19,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:19,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:19,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:19,446 INFO L175 Difference]: Start difference. First operand has 306 places, 302 transitions, 697 flow. Second operand 3 states and 1279 transitions. [2022-11-16 12:19:19,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 306 transitions, 772 flow [2022-11-16 12:19:19,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 306 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:19:19,458 INFO L231 Difference]: Finished difference. Result has 305 places, 301 transitions, 695 flow [2022-11-16 12:19:19,458 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=303, 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=695, PETRI_PLACES=305, PETRI_TRANSITIONS=301} [2022-11-16 12:19:19,459 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -113 predicate places. [2022-11-16 12:19:19,459 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 301 transitions, 695 flow [2022-11-16 12:19:19,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:19,460 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:19,460 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:19,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:19:19,461 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:19,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:19,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1789669962, now seen corresponding path program 1 times [2022-11-16 12:19:19,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:19,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477681897] [2022-11-16 12:19:19,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:19,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:19,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:19,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477681897] [2022-11-16 12:19:19,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477681897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:19,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:19,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:19,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877579840] [2022-11-16 12:19:19,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:19,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:19,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:19,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:19,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:19,536 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-16 12:19:19,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 301 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:19,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:19,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-16 12:19:19,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:20,349 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [42#L41-5true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 509#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true, 228#L73-5true]) [2022-11-16 12:19:20,349 INFO L383 tUnfolder$Statistics]: this new event has 134 ancestors and is cut-off event [2022-11-16 12:19:20,349 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-16 12:19:20,350 INFO L386 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-11-16 12:19:20,350 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 12:19:20,412 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, 514#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:20,413 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-16 12:19:20,413 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-16 12:19:20,413 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-16 12:19:20,413 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-16 12:19:20,640 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 228#L73-5true, 330#L57-2true]) [2022-11-16 12:19:20,640 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-16 12:19:20,640 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-16 12:19:20,640 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-16 12:19:20,640 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-16 12:19:20,698 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:20,698 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-16 12:19:20,698 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 12:19:20,699 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 12:19:20,699 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-16 12:19:20,722 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:20,722 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-16 12:19:20,722 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 12:19:20,723 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 12:19:20,723 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 12:19:20,723 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [42#L41-5true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 509#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 228#L73-5true, 330#L57-2true]) [2022-11-16 12:19:20,723 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-16 12:19:20,723 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-16 12:19:20,723 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-16 12:19:20,723 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-16 12:19:20,723 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:20,724 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-16 12:19:20,724 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 12:19:20,724 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-16 12:19:20,724 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-16 12:19:20,725 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:20,725 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-16 12:19:20,725 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 12:19:20,725 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 12:19:20,725 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 12:19:20,725 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 12:19:20,787 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 514#true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 509#true, 528#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true, 228#L73-5true]) [2022-11-16 12:19:20,787 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-16 12:19:20,787 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-16 12:19:20,787 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 12:19:20,788 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-16 12:19:20,948 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:20,948 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-11-16 12:19:20,948 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-16 12:19:20,949 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-16 12:19:20,949 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 12:19:21,004 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:21,004 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-16 12:19:21,005 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 12:19:21,005 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-16 12:19:21,005 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 12:19:21,005 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 228#L73-5true, 330#L57-2true]) [2022-11-16 12:19:21,005 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-16 12:19:21,005 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-16 12:19:21,005 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 12:19:21,006 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 12:19:21,006 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:21,006 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-16 12:19:21,006 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-16 12:19:21,006 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 12:19:21,006 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-16 12:19:21,008 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:21,008 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-16 12:19:21,008 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-16 12:19:21,008 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-16 12:19:21,008 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 12:19:21,008 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-16 12:19:21,050 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 380#L81-2true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 228#L73-5true, 330#L57-2true]) [2022-11-16 12:19:21,050 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-16 12:19:21,050 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 12:19:21,051 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 12:19:21,051 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-16 12:19:21,450 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 380#L81-2true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:21,450 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-16 12:19:21,450 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-16 12:19:21,451 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 12:19:21,451 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-16 12:19:21,513 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 380#L81-2true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:21,514 INFO L383 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-11-16 12:19:21,514 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-16 12:19:21,514 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 12:19:21,514 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-16 12:19:21,514 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 12:19:21,914 INFO L130 PetriNetUnfolder]: 2457/11284 cut-off events. [2022-11-16 12:19:21,914 INFO L131 PetriNetUnfolder]: For 414/514 co-relation queries the response was YES. [2022-11-16 12:19:22,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16462 conditions, 11284 events. 2457/11284 cut-off events. For 414/514 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 131015 event pairs, 819 based on Foata normal form. 0/9794 useless extension candidates. Maximal degree in co-relation 15282. Up to 2051 conditions per place. [2022-11-16 12:19:22,095 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2022-11-16 12:19:22,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 305 transitions, 770 flow [2022-11-16 12:19:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-16 12:19:22,101 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-16 12:19:22,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-16 12:19:22,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-16 12:19:22,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:22,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-16 12:19:22,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:22,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:22,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:22,112 INFO L175 Difference]: Start difference. First operand has 305 places, 301 transitions, 695 flow. Second operand 3 states and 1279 transitions. [2022-11-16 12:19:22,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 305 transitions, 770 flow [2022-11-16 12:19:22,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 305 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:19:22,127 INFO L231 Difference]: Finished difference. Result has 304 places, 300 transitions, 693 flow [2022-11-16 12:19:22,128 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=302, 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=693, PETRI_PLACES=304, PETRI_TRANSITIONS=300} [2022-11-16 12:19:22,129 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -114 predicate places. [2022-11-16 12:19:22,129 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 300 transitions, 693 flow [2022-11-16 12:19:22,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:22,130 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:22,130 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:22,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:19:22,131 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:22,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:22,132 INFO L85 PathProgramCache]: Analyzing trace with hash -187429401, now seen corresponding path program 1 times [2022-11-16 12:19:22,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:22,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904205471] [2022-11-16 12:19:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:22,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:22,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:22,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904205471] [2022-11-16 12:19:22,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904205471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:22,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:22,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:22,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25770539] [2022-11-16 12:19:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:22,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:22,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:22,218 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-16 12:19:22,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 300 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:22,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:22,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-16 12:19:22,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:23,609 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, 536#true, 69#L49-5true, Black: 494#true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:23,610 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-16 12:19:23,610 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-16 12:19:23,610 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-16 12:19:23,610 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-16 12:19:23,667 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, 536#true, 69#L49-5true, Black: 494#true, 291#L108-4true, Black: 499#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:23,667 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-16 12:19:23,667 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-16 12:19:23,667 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-16 12:19:23,667 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 12:19:23,773 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, 536#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:23,773 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-16 12:19:23,773 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 12:19:23,773 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 12:19:23,774 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 12:19:23,821 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, 536#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:23,822 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-11-16 12:19:23,822 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-16 12:19:23,822 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-16 12:19:23,822 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 12:19:23,866 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 536#true, 69#L49-5true, Black: 494#true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:23,866 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-16 12:19:23,866 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 12:19:23,866 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 12:19:23,867 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-16 12:19:23,981 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 536#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-16 12:19:23,981 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-16 12:19:23,981 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-16 12:19:23,981 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 12:19:23,981 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-16 12:19:24,534 INFO L130 PetriNetUnfolder]: 2207/9806 cut-off events. [2022-11-16 12:19:24,534 INFO L131 PetriNetUnfolder]: For 453/537 co-relation queries the response was YES. [2022-11-16 12:19:24,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14379 conditions, 9806 events. 2207/9806 cut-off events. For 453/537 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 109691 event pairs, 740 based on Foata normal form. 0/8494 useless extension candidates. Maximal degree in co-relation 13765. Up to 1834 conditions per place. [2022-11-16 12:19:24,710 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2022-11-16 12:19:24,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 304 transitions, 768 flow [2022-11-16 12:19:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-16 12:19:24,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-16 12:19:24,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-16 12:19:24,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-16 12:19:24,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:24,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-16 12:19:24,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:24,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:24,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:24,726 INFO L175 Difference]: Start difference. First operand has 304 places, 300 transitions, 693 flow. Second operand 3 states and 1279 transitions. [2022-11-16 12:19:24,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 304 transitions, 768 flow [2022-11-16 12:19:24,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 304 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:19:24,742 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 691 flow [2022-11-16 12:19:24,743 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=301, 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=691, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2022-11-16 12:19:24,744 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-16 12:19:24,744 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 691 flow [2022-11-16 12:19:24,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:24,745 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:24,745 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:24,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:19:24,746 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash -260389847, now seen corresponding path program 1 times [2022-11-16 12:19:24,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:24,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246993454] [2022-11-16 12:19:24,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:24,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:24,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246993454] [2022-11-16 12:19:24,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246993454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:24,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:24,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:24,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644356542] [2022-11-16 12:19:24,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:24,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:24,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:24,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:24,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:24,849 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-16 12:19:24,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:24,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:24,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-16 12:19:24,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:26,493 INFO L130 PetriNetUnfolder]: 1821/7649 cut-off events. [2022-11-16 12:19:26,493 INFO L131 PetriNetUnfolder]: For 457/521 co-relation queries the response was YES. [2022-11-16 12:19:26,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11072 conditions, 7649 events. 1821/7649 cut-off events. For 457/521 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 78553 event pairs, 612 based on Foata normal form. 0/6569 useless extension candidates. Maximal degree in co-relation 10251. Up to 1594 conditions per place. [2022-11-16 12:19:26,622 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2022-11-16 12:19:26,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 303 transitions, 766 flow [2022-11-16 12:19:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-16 12:19:26,627 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-16 12:19:26,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-16 12:19:26,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-16 12:19:26,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:26,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-16 12:19:26,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:26,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:26,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:26,636 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 691 flow. Second operand 3 states and 1279 transitions. [2022-11-16 12:19:26,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 303 transitions, 766 flow [2022-11-16 12:19:26,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 303 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:19:26,653 INFO L231 Difference]: Finished difference. Result has 302 places, 298 transitions, 689 flow [2022-11-16 12:19:26,653 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=302, PETRI_TRANSITIONS=298} [2022-11-16 12:19:26,654 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -116 predicate places. [2022-11-16 12:19:26,654 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 298 transitions, 689 flow [2022-11-16 12:19:26,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:26,655 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:26,655 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:26,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:19:26,656 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:26,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1626420513, now seen corresponding path program 1 times [2022-11-16 12:19:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:26,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033619180] [2022-11-16 12:19:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:27,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:27,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033619180] [2022-11-16 12:19:27,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033619180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:27,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:27,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:19:27,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448230855] [2022-11-16 12:19:27,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:27,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:19:27,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:27,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:19:27,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:19:27,389 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-16 12:19:27,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 298 transitions, 689 flow. Second operand has 6 states, 6 states have (on average 402.5) internal successors, (2415), 6 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:27,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:27,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-16 12:19:27,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:28,567 INFO L130 PetriNetUnfolder]: 952/4738 cut-off events. [2022-11-16 12:19:28,567 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-16 12:19:28,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6643 conditions, 4738 events. 952/4738 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 44102 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 6281. Up to 1060 conditions per place. [2022-11-16 12:19:28,640 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 46 selfloop transitions, 4 changer transitions 0/297 dead transitions. [2022-11-16 12:19:28,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 297 transitions, 787 flow [2022-11-16 12:19:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:19:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:19:28,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2451 transitions. [2022-11-16 12:19:28,646 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8822894168466523 [2022-11-16 12:19:28,646 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2451 transitions. [2022-11-16 12:19:28,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2451 transitions. [2022-11-16 12:19:28,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:28,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2451 transitions. [2022-11-16 12:19:28,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.5) internal successors, (2451), 6 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:28,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:28,662 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:28,662 INFO L175 Difference]: Start difference. First operand has 302 places, 298 transitions, 689 flow. Second operand 6 states and 2451 transitions. [2022-11-16 12:19:28,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 297 transitions, 787 flow [2022-11-16 12:19:28,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 297 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:19:28,672 INFO L231 Difference]: Finished difference. Result has 304 places, 297 transitions, 691 flow [2022-11-16 12:19:28,672 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=691, PETRI_PLACES=304, PETRI_TRANSITIONS=297} [2022-11-16 12:19:28,673 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -114 predicate places. [2022-11-16 12:19:28,673 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 297 transitions, 691 flow [2022-11-16 12:19:28,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 402.5) internal successors, (2415), 6 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:28,675 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:28,675 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:28,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 12:19:28,675 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread6Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1800624235, now seen corresponding path program 1 times [2022-11-16 12:19:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:28,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490737095] [2022-11-16 12:19:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:28,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:28,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490737095] [2022-11-16 12:19:28,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490737095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:28,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:28,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:19:28,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926882090] [2022-11-16 12:19:28,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:28,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:19:28,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:28,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:19:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:19:28,755 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-16 12:19:28,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 297 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:28,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:28,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-16 12:19:28,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:30,297 INFO L130 PetriNetUnfolder]: 1513/6421 cut-off events. [2022-11-16 12:19:30,297 INFO L131 PetriNetUnfolder]: For 377/425 co-relation queries the response was YES. [2022-11-16 12:19:30,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9078 conditions, 6421 events. 1513/6421 cut-off events. For 377/425 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 62242 event pairs, 504 based on Foata normal form. 0/5521 useless extension candidates. Maximal degree in co-relation 5845. Up to 1327 conditions per place. [2022-11-16 12:19:30,367 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-11-16 12:19:30,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 301 transitions, 766 flow [2022-11-16 12:19:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:19:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:19:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-16 12:19:30,371 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-16 12:19:30,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-16 12:19:30,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-16 12:19:30,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:30,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-16 12:19:30,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:30,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:30,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:30,380 INFO L175 Difference]: Start difference. First operand has 304 places, 297 transitions, 691 flow. Second operand 3 states and 1279 transitions. [2022-11-16 12:19:30,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 301 transitions, 766 flow [2022-11-16 12:19:30,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 301 transitions, 759 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:19:30,390 INFO L231 Difference]: Finished difference. Result has 301 places, 296 transitions, 686 flow [2022-11-16 12:19:30,390 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=301, PETRI_TRANSITIONS=296} [2022-11-16 12:19:30,391 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -117 predicate places. [2022-11-16 12:19:30,391 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 296 transitions, 686 flow [2022-11-16 12:19:30,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:30,392 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:30,392 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:30,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 12:19:30,393 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1746432846, now seen corresponding path program 1 times [2022-11-16 12:19:30,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:30,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083693632] [2022-11-16 12:19:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:31,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:31,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083693632] [2022-11-16 12:19:31,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083693632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:31,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:31,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:19:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401195529] [2022-11-16 12:19:31,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:31,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:19:31,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:31,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:19:31,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:19:31,110 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-16 12:19:31,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 296 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 403.5) internal successors, (2421), 6 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:31,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:31,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-16 12:19:31,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:32,229 INFO L130 PetriNetUnfolder]: 952/4726 cut-off events. [2022-11-16 12:19:32,230 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-16 12:19:32,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6575 conditions, 4726 events. 952/4726 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 43931 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 6325. Up to 1060 conditions per place. [2022-11-16 12:19:32,277 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 45 selfloop transitions, 4 changer transitions 0/295 dead transitions. [2022-11-16 12:19:32,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 295 transitions, 782 flow [2022-11-16 12:19:32,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:19:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:19:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2450 transitions. [2022-11-16 12:19:32,282 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8819294456443485 [2022-11-16 12:19:32,282 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2450 transitions. [2022-11-16 12:19:32,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2450 transitions. [2022-11-16 12:19:32,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:32,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2450 transitions. [2022-11-16 12:19:32,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.3333333333333) internal successors, (2450), 6 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:32,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:32,297 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:32,298 INFO L175 Difference]: Start difference. First operand has 301 places, 296 transitions, 686 flow. Second operand 6 states and 2450 transitions. [2022-11-16 12:19:32,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 295 transitions, 782 flow [2022-11-16 12:19:32,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 295 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:19:32,306 INFO L231 Difference]: Finished difference. Result has 303 places, 295 transitions, 688 flow [2022-11-16 12:19:32,307 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=688, PETRI_PLACES=303, PETRI_TRANSITIONS=295} [2022-11-16 12:19:32,308 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-16 12:19:32,308 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 295 transitions, 688 flow [2022-11-16 12:19:32,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 403.5) internal successors, (2421), 6 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:32,309 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:32,310 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:32,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 12:19:32,310 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:32,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1365575655, now seen corresponding path program 1 times [2022-11-16 12:19:32,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:32,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321303069] [2022-11-16 12:19:32,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:32,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:33,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:33,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321303069] [2022-11-16 12:19:33,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321303069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:33,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:33,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:19:33,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497134964] [2022-11-16 12:19:33,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:33,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:19:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:33,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:19:33,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:19:33,009 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-16 12:19:33,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 295 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 404.5) internal successors, (2427), 6 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:33,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:33,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-16 12:19:33,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:33,975 INFO L130 PetriNetUnfolder]: 952/4706 cut-off events. [2022-11-16 12:19:33,975 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 12:19:34,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6551 conditions, 4706 events. 952/4706 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 43707 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 5817. Up to 1060 conditions per place. [2022-11-16 12:19:34,045 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 44 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2022-11-16 12:19:34,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 294 transitions, 782 flow [2022-11-16 12:19:34,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:19:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:19:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2449 transitions. [2022-11-16 12:19:34,052 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8815694744420446 [2022-11-16 12:19:34,052 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2449 transitions. [2022-11-16 12:19:34,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2449 transitions. [2022-11-16 12:19:34,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:34,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2449 transitions. [2022-11-16 12:19:34,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.1666666666667) internal successors, (2449), 6 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:34,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:34,066 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:34,067 INFO L175 Difference]: Start difference. First operand has 303 places, 295 transitions, 688 flow. Second operand 6 states and 2449 transitions. [2022-11-16 12:19:34,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 294 transitions, 782 flow [2022-11-16 12:19:34,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 294 transitions, 775 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:19:34,076 INFO L231 Difference]: Finished difference. Result has 303 places, 294 transitions, 687 flow [2022-11-16 12:19:34,077 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=687, PETRI_PLACES=303, PETRI_TRANSITIONS=294} [2022-11-16 12:19:34,077 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-16 12:19:34,078 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 294 transitions, 687 flow [2022-11-16 12:19:34,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.5) internal successors, (2427), 6 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:34,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:34,079 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:34,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 12:19:34,080 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 583830433, now seen corresponding path program 1 times [2022-11-16 12:19:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:34,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582162608] [2022-11-16 12:19:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:34,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:34,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582162608] [2022-11-16 12:19:34,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582162608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:34,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:34,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:19:34,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647832669] [2022-11-16 12:19:34,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:34,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:19:34,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:34,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:19:34,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:19:34,825 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-16 12:19:34,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 294 transitions, 687 flow. Second operand has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:34,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:34,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-16 12:19:34,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:36,015 INFO L130 PetriNetUnfolder]: 952/4692 cut-off events. [2022-11-16 12:19:36,016 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-16 12:19:36,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6585 conditions, 4692 events. 952/4692 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 43588 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 5941. Up to 1060 conditions per place. [2022-11-16 12:19:36,099 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 43 selfloop transitions, 4 changer transitions 0/293 dead transitions. [2022-11-16 12:19:36,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 293 transitions, 779 flow [2022-11-16 12:19:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:19:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:19:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2448 transitions. [2022-11-16 12:19:36,105 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8812095032397408 [2022-11-16 12:19:36,105 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2448 transitions. [2022-11-16 12:19:36,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2448 transitions. [2022-11-16 12:19:36,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:36,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2448 transitions. [2022-11-16 12:19:36,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.0) internal successors, (2448), 6 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:36,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:36,116 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:36,116 INFO L175 Difference]: Start difference. First operand has 303 places, 294 transitions, 687 flow. Second operand 6 states and 2448 transitions. [2022-11-16 12:19:36,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 293 transitions, 779 flow [2022-11-16 12:19:36,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 293 transitions, 772 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:19:36,125 INFO L231 Difference]: Finished difference. Result has 303 places, 293 transitions, 686 flow [2022-11-16 12:19:36,126 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=686, PETRI_PLACES=303, PETRI_TRANSITIONS=293} [2022-11-16 12:19:36,127 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-16 12:19:36,127 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 293 transitions, 686 flow [2022-11-16 12:19:36,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:36,128 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:36,128 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:36,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 12:19:36,128 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:36,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:36,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1508730747, now seen corresponding path program 1 times [2022-11-16 12:19:36,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:36,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025020171] [2022-11-16 12:19:36,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:36,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:36,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025020171] [2022-11-16 12:19:36,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025020171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:36,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:36,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:19:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441993985] [2022-11-16 12:19:36,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:36,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:19:36,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:36,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:19:36,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:19:36,901 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-16 12:19:36,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 293 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:36,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:36,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-16 12:19:36,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:37,973 INFO L130 PetriNetUnfolder]: 952/4686 cut-off events. [2022-11-16 12:19:37,974 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-16 12:19:38,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 4686 events. 952/4686 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 43596 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 6217. Up to 1060 conditions per place. [2022-11-16 12:19:38,053 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 42 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2022-11-16 12:19:38,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 292 transitions, 776 flow [2022-11-16 12:19:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:19:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:19:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2022-11-16 12:19:38,060 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.880849532037437 [2022-11-16 12:19:38,060 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2447 transitions. [2022-11-16 12:19:38,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2447 transitions. [2022-11-16 12:19:38,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:38,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2447 transitions. [2022-11-16 12:19:38,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 407.8333333333333) internal successors, (2447), 6 states have internal predecessors, (2447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:38,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:38,068 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:38,069 INFO L175 Difference]: Start difference. First operand has 303 places, 293 transitions, 686 flow. Second operand 6 states and 2447 transitions. [2022-11-16 12:19:38,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 292 transitions, 776 flow [2022-11-16 12:19:38,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 292 transitions, 769 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:19:38,078 INFO L231 Difference]: Finished difference. Result has 303 places, 292 transitions, 685 flow [2022-11-16 12:19:38,079 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=685, PETRI_PLACES=303, PETRI_TRANSITIONS=292} [2022-11-16 12:19:38,079 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-16 12:19:38,080 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 292 transitions, 685 flow [2022-11-16 12:19:38,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:38,080 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:19:38,081 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:38,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 12:19:38,081 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-16 12:19:38,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2091707096, now seen corresponding path program 1 times [2022-11-16 12:19:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:38,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988323122] [2022-11-16 12:19:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:38,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:19:38,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:38,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988323122] [2022-11-16 12:19:38,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988323122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:38,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:38,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:19:38,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971735301] [2022-11-16 12:19:38,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:38,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:19:38,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:38,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:19:38,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:19:38,910 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-16 12:19:38,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 292 transitions, 685 flow. Second operand has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:38,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:19:38,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-16 12:19:38,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:19:39,992 INFO L130 PetriNetUnfolder]: 952/4683 cut-off events. [2022-11-16 12:19:39,992 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 12:19:40,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6534 conditions, 4683 events. 952/4683 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 43568 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 6395. Up to 1060 conditions per place. [2022-11-16 12:19:40,042 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 0 selfloop transitions, 0 changer transitions 291/291 dead transitions. [2022-11-16 12:19:40,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 291 transitions, 773 flow [2022-11-16 12:19:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:19:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:19:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2446 transitions. [2022-11-16 12:19:40,050 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8804895608351332 [2022-11-16 12:19:40,050 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2446 transitions. [2022-11-16 12:19:40,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2446 transitions. [2022-11-16 12:19:40,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:19:40,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2446 transitions. [2022-11-16 12:19:40,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 407.6666666666667) internal successors, (2446), 6 states have internal predecessors, (2446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:40,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:40,062 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:40,062 INFO L175 Difference]: Start difference. First operand has 303 places, 292 transitions, 685 flow. Second operand 6 states and 2446 transitions. [2022-11-16 12:19:40,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 291 transitions, 773 flow [2022-11-16 12:19:40,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 291 transitions, 766 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:19:40,071 INFO L231 Difference]: Finished difference. Result has 303 places, 0 transitions, 0 flow [2022-11-16 12:19:40,071 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=303, PETRI_TRANSITIONS=0} [2022-11-16 12:19:40,072 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-16 12:19:40,072 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 0 transitions, 0 flow [2022-11-16 12:19:40,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:19:40,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (102 of 103 remaining) [2022-11-16 12:19:40,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (101 of 103 remaining) [2022-11-16 12:19:40,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (100 of 103 remaining) [2022-11-16 12:19:40,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (99 of 103 remaining) [2022-11-16 12:19:40,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (98 of 103 remaining) [2022-11-16 12:19:40,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (97 of 103 remaining) [2022-11-16 12:19:40,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (96 of 103 remaining) [2022-11-16 12:19:40,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (95 of 103 remaining) [2022-11-16 12:19:40,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (94 of 103 remaining) [2022-11-16 12:19:40,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (93 of 103 remaining) [2022-11-16 12:19:40,082 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 103 remaining) [2022-11-16 12:19:40,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 103 remaining) [2022-11-16 12:19:40,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 103 remaining) [2022-11-16 12:19:40,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 103 remaining) [2022-11-16 12:19:40,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 103 remaining) [2022-11-16 12:19:40,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (87 of 103 remaining) [2022-11-16 12:19:40,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (86 of 103 remaining) [2022-11-16 12:19:40,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (85 of 103 remaining) [2022-11-16 12:19:40,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (84 of 103 remaining) [2022-11-16 12:19:40,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (83 of 103 remaining) [2022-11-16 12:19:40,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (82 of 103 remaining) [2022-11-16 12:19:40,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (81 of 103 remaining) [2022-11-16 12:19:40,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 103 remaining) [2022-11-16 12:19:40,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (79 of 103 remaining) [2022-11-16 12:19:40,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 103 remaining) [2022-11-16 12:19:40,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (77 of 103 remaining) [2022-11-16 12:19:40,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (76 of 103 remaining) [2022-11-16 12:19:40,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (75 of 103 remaining) [2022-11-16 12:19:40,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (74 of 103 remaining) [2022-11-16 12:19:40,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (73 of 103 remaining) [2022-11-16 12:19:40,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (72 of 103 remaining) [2022-11-16 12:19:40,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (71 of 103 remaining) [2022-11-16 12:19:40,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (70 of 103 remaining) [2022-11-16 12:19:40,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (69 of 103 remaining) [2022-11-16 12:19:40,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (68 of 103 remaining) [2022-11-16 12:19:40,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (67 of 103 remaining) [2022-11-16 12:19:40,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (66 of 103 remaining) [2022-11-16 12:19:40,094 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (65 of 103 remaining) [2022-11-16 12:19:40,094 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (64 of 103 remaining) [2022-11-16 12:19:40,094 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (63 of 103 remaining) [2022-11-16 12:19:40,094 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (62 of 103 remaining) [2022-11-16 12:19:40,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (61 of 103 remaining) [2022-11-16 12:19:40,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (60 of 103 remaining) [2022-11-16 12:19:40,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (59 of 103 remaining) [2022-11-16 12:19:40,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (58 of 103 remaining) [2022-11-16 12:19:40,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (57 of 103 remaining) [2022-11-16 12:19:40,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (56 of 103 remaining) [2022-11-16 12:19:40,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (55 of 103 remaining) [2022-11-16 12:19:40,097 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (54 of 103 remaining) [2022-11-16 12:19:40,097 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (53 of 103 remaining) [2022-11-16 12:19:40,097 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (52 of 103 remaining) [2022-11-16 12:19:40,097 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (51 of 103 remaining) [2022-11-16 12:19:40,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 103 remaining) [2022-11-16 12:19:40,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 103 remaining) [2022-11-16 12:19:40,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 103 remaining) [2022-11-16 12:19:40,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 103 remaining) [2022-11-16 12:19:40,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 103 remaining) [2022-11-16 12:19:40,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 103 remaining) [2022-11-16 12:19:40,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (44 of 103 remaining) [2022-11-16 12:19:40,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (43 of 103 remaining) [2022-11-16 12:19:40,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 103 remaining) [2022-11-16 12:19:40,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (41 of 103 remaining) [2022-11-16 12:19:40,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (40 of 103 remaining) [2022-11-16 12:19:40,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (39 of 103 remaining) [2022-11-16 12:19:40,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (38 of 103 remaining) [2022-11-16 12:19:40,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 103 remaining) [2022-11-16 12:19:40,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (36 of 103 remaining) [2022-11-16 12:19:40,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (35 of 103 remaining) [2022-11-16 12:19:40,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (34 of 103 remaining) [2022-11-16 12:19:40,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (33 of 103 remaining) [2022-11-16 12:19:40,103 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 103 remaining) [2022-11-16 12:19:40,103 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (31 of 103 remaining) [2022-11-16 12:19:40,103 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (30 of 103 remaining) [2022-11-16 12:19:40,103 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 103 remaining) [2022-11-16 12:19:40,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 103 remaining) [2022-11-16 12:19:40,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 103 remaining) [2022-11-16 12:19:40,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 103 remaining) [2022-11-16 12:19:40,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 103 remaining) [2022-11-16 12:19:40,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 103 remaining) [2022-11-16 12:19:40,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 103 remaining) [2022-11-16 12:19:40,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 103 remaining) [2022-11-16 12:19:40,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 103 remaining) [2022-11-16 12:19:40,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 103 remaining) [2022-11-16 12:19:40,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 103 remaining) [2022-11-16 12:19:40,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 103 remaining) [2022-11-16 12:19:40,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 103 remaining) [2022-11-16 12:19:40,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 103 remaining) [2022-11-16 12:19:40,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (15 of 103 remaining) [2022-11-16 12:19:40,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 103 remaining) [2022-11-16 12:19:40,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 103 remaining) [2022-11-16 12:19:40,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 103 remaining) [2022-11-16 12:19:40,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (11 of 103 remaining) [2022-11-16 12:19:40,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (10 of 103 remaining) [2022-11-16 12:19:40,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (9 of 103 remaining) [2022-11-16 12:19:40,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (8 of 103 remaining) [2022-11-16 12:19:40,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 103 remaining) [2022-11-16 12:19:40,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (6 of 103 remaining) [2022-11-16 12:19:40,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (5 of 103 remaining) [2022-11-16 12:19:40,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (4 of 103 remaining) [2022-11-16 12:19:40,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (3 of 103 remaining) [2022-11-16 12:19:40,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 103 remaining) [2022-11-16 12:19:40,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 103 remaining) [2022-11-16 12:19:40,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (0 of 103 remaining) [2022-11-16 12:19:40,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 12:19:40,111 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, 1, 1, 1] [2022-11-16 12:19:40,121 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:19:40,121 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:19:40,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:19:40 BasicIcfg [2022-11-16 12:19:40,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:19:40,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:19:40,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:19:40,132 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:19:40,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:18:41" (3/4) ... [2022-11-16 12:19:40,136 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 12:19:40,143 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-16 12:19:40,144 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-16 12:19:40,144 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-16 12:19:40,144 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-16 12:19:40,145 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2022-11-16 12:19:40,145 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2022-11-16 12:19:40,163 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-11-16 12:19:40,164 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-16 12:19:40,165 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 12:19:40,165 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 12:19:40,259 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:19:40,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:19:40,260 INFO L158 Benchmark]: Toolchain (without parser) took 60157.17ms. Allocated memory was 127.9MB in the beginning and 13.4GB in the end (delta: 13.3GB). Free memory was 88.9MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2022-11-16 12:19:40,261 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 127.9MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:19:40,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.19ms. Allocated memory is still 127.9MB. Free memory was 88.7MB in the beginning and 100.3MB in the end (delta: -11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:19:40,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.55ms. Allocated memory is still 127.9MB. Free memory was 100.3MB in the beginning and 97.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:19:40,262 INFO L158 Benchmark]: Boogie Preprocessor took 77.09ms. Allocated memory is still 127.9MB. Free memory was 97.7MB in the beginning and 95.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:19:40,262 INFO L158 Benchmark]: RCFGBuilder took 1277.97ms. Allocated memory is still 127.9MB. Free memory was 95.1MB in the beginning and 63.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-16 12:19:40,263 INFO L158 Benchmark]: TraceAbstraction took 58134.57ms. Allocated memory was 127.9MB in the beginning and 13.4GB in the end (delta: 13.3GB). Free memory was 62.6MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2022-11-16 12:19:40,263 INFO L158 Benchmark]: Witness Printer took 127.97ms. Allocated memory is still 13.4GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:19:40,271 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 127.9MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.19ms. Allocated memory is still 127.9MB. Free memory was 88.7MB in the beginning and 100.3MB in the end (delta: -11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.55ms. Allocated memory is still 127.9MB. Free memory was 100.3MB in the beginning and 97.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.09ms. Allocated memory is still 127.9MB. Free memory was 97.7MB in the beginning and 95.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1277.97ms. Allocated memory is still 127.9MB. Free memory was 95.1MB in the beginning and 63.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 58134.57ms. Allocated memory was 127.9MB in the beginning and 13.4GB in the end (delta: 13.3GB). Free memory was 62.6MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 127.97ms. Allocated memory is still 13.4GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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 13 procedures, 578 locations, 103 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: 57.8s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 50.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 462 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1363 IncrementalHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 462 mSDtfsCounter, 1363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=878occurred in iteration=0, InterpolantAutomatonStates: 96, 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, 5.4s InterpolantComputationTime, 2533 NumberOfCodeBlocks, 2533 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2507 ConstructedInterpolants, 0 QuantifiedInterpolants, 3033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-16 12:19:40,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bc4b99c-4be6-4a2f-9928-14e007491533/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE