./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/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_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/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_e5881ae6-a56b-4453-824c-3d80a0a703f7/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 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- 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 10:55:11,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:55:11,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:55:11,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:55:11,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:55:11,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:55:11,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:55:11,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:55:11,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:55:11,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:55:11,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:55:11,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:55:11,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:55:11,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:55:11,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:55:11,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:55:11,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:55:11,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:55:11,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:55:11,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:55:11,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:55:11,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:55:11,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:55:11,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:55:11,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:55:11,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:55:11,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:55:11,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:55:11,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:55:11,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:55:11,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:55:11,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:55:11,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:55:11,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:55:11,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:55:11,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:55:11,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:55:11,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:55:11,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:55:11,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:55:11,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:55:11,852 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 10:55:11,880 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:55:11,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:55:11,888 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:55:11,889 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:55:11,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:55:11,890 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:55:11,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:55:11,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:55:11,891 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:55:11,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:55:11,892 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:55:11,893 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 10:55:11,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:55:11,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:55:11,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:55:11,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 10:55:11,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:55:11,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 10:55:11,894 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 10:55:11,894 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:55:11,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 10:55:11,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:55:11,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 10:55:11,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:55:11,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:55:11,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:55:11,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:55:11,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:55:11,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:55:11,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 10:55:11,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:55:11,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:55:11,899 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 10:55:11,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 10:55:11,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 10:55:11,900 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_e5881ae6-a56b-4453-824c-3d80a0a703f7/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_e5881ae6-a56b-4453-824c-3d80a0a703f7/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 -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2022-11-16 10:55:12,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:55:12,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:55:12,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:55:12,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:55:12,234 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:55:12,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2022-11-16 10:55:12,305 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/data/19ab830c6/e2b92160b9504476be42f239e3b260cf/FLAGd1c5af6ae [2022-11-16 10:55:12,834 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:55:12,835 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2022-11-16 10:55:12,844 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/data/19ab830c6/e2b92160b9504476be42f239e3b260cf/FLAGd1c5af6ae [2022-11-16 10:55:13,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/data/19ab830c6/e2b92160b9504476be42f239e3b260cf [2022-11-16 10:55:13,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:55:13,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:55:13,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:55:13,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:55:13,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:55:13,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4496b1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13, skipping insertion in model container [2022-11-16 10:55:13,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:55:13,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:55:13,545 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_e5881ae6-a56b-4453-824c-3d80a0a703f7/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2022-11-16 10:55:13,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:55:13,576 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:55:13,651 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_e5881ae6-a56b-4453-824c-3d80a0a703f7/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2022-11-16 10:55:13,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:55:13,679 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:55:13,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13 WrapperNode [2022-11-16 10:55:13,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:55:13,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:55:13,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:55:13,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:55:13,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,779 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 758 [2022-11-16 10:55:13,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:55:13,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:55:13,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:55:13,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:55:13,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,857 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:55:13,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:55:13,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:55:13,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:55:13,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (1/1) ... [2022-11-16 10:55:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:55:13,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:13,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:55:13,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:55:13,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:55:13,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 10:55:13,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 10:55:13,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 10:55:13,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 10:55:13,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 10:55:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 10:55:13,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 10:55:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 10:55:13,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 10:55:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 10:55:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 10:55:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 10:55:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 10:55:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:55:13,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:55:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:55:13,965 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 10:55:14,187 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:55:14,189 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:55:15,141 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:55:15,901 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:55:15,901 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-16 10:55:15,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:55:15 BoogieIcfgContainer [2022-11-16 10:55:15,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:55:15,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:55:15,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:55:15,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:55:15,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:55:13" (1/3) ... [2022-11-16 10:55:15,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37db3268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:55:15, skipping insertion in model container [2022-11-16 10:55:15,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:55:13" (2/3) ... [2022-11-16 10:55:15,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37db3268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:55:15, skipping insertion in model container [2022-11-16 10:55:15,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:55:15" (3/3) ... [2022-11-16 10:55:15,916 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2022-11-16 10:55:15,925 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 10:55:15,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:55:15,935 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 128 error locations. [2022-11-16 10:55:15,935 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 10:55:16,144 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 10:55:16,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 509 places, 526 transitions, 1076 flow [2022-11-16 10:55:16,389 INFO L130 PetriNetUnfolder]: 27/523 cut-off events. [2022-11-16 10:55:16,390 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 10:55:16,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 523 events. 27/523 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1019 event pairs, 0 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 433. Up to 6 conditions per place. [2022-11-16 10:55:16,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 509 places, 526 transitions, 1076 flow [2022-11-16 10:55:16,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 487 places, 503 transitions, 1024 flow [2022-11-16 10:55:16,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:55:16,443 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;@d1d0897, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:55:16,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 231 error locations. [2022-11-16 10:55:16,458 INFO L130 PetriNetUnfolder]: 0/36 cut-off events. [2022-11-16 10:55:16,458 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:55:16,458 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:16,459 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:16,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:16,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:16,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1058057909, now seen corresponding path program 1 times [2022-11-16 10:55:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:16,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583872788] [2022-11-16 10:55:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:16,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:16,739 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 10:55:16,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:16,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583872788] [2022-11-16 10:55:16,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583872788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:16,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:16,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:16,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832269030] [2022-11-16 10:55:16,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:16,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:16,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:16,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:16,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:16,803 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526 [2022-11-16 10:55:16,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 503 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:16,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:16,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526 [2022-11-16 10:55:16,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:17,118 INFO L130 PetriNetUnfolder]: 30/414 cut-off events. [2022-11-16 10:55:17,118 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-16 10:55:17,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 414 events. 30/414 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 357 event pairs, 0 based on Foata normal form. 18/373 useless extension candidates. Maximal degree in co-relation 373. Up to 36 conditions per place. [2022-11-16 10:55:17,126 INFO L137 encePairwiseOnDemand]: 419/526 looper letters, 19 selfloop transitions, 2 changer transitions 6/398 dead transitions. [2022-11-16 10:55:17,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 398 transitions, 856 flow [2022-11-16 10:55:17,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1317 transitions. [2022-11-16 10:55:17,149 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8346007604562737 [2022-11-16 10:55:17,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1317 transitions. [2022-11-16 10:55:17,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1317 transitions. [2022-11-16 10:55:17,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:17,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1317 transitions. [2022-11-16 10:55:17,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 439.0) internal successors, (1317), 3 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states 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 10:55:17,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:17,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:17,175 INFO L175 Difference]: Start difference. First operand has 487 places, 503 transitions, 1024 flow. Second operand 3 states and 1317 transitions. [2022-11-16 10:55:17,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 398 transitions, 856 flow [2022-11-16 10:55:17,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 398 transitions, 844 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-16 10:55:17,189 INFO L231 Difference]: Finished difference. Result has 390 places, 392 transitions, 794 flow [2022-11-16 10:55:17,192 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=390, PETRI_TRANSITIONS=392} [2022-11-16 10:55:17,195 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -97 predicate places. [2022-11-16 10:55:17,195 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 392 transitions, 794 flow [2022-11-16 10:55:17,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:17,196 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:17,196 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:17,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 10:55:17,197 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1292687517, now seen corresponding path program 1 times [2022-11-16 10:55:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:17,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210149792] [2022-11-16 10:55:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:17,313 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 10:55:17,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:17,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210149792] [2022-11-16 10:55:17,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210149792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:17,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:17,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480534630] [2022-11-16 10:55:17,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:17,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:17,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:17,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:17,326 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526 [2022-11-16 10:55:17,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 392 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:17,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:17,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526 [2022-11-16 10:55:17,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:17,509 INFO L130 PetriNetUnfolder]: 30/407 cut-off events. [2022-11-16 10:55:17,510 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 10:55:17,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 407 events. 30/407 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 356 event pairs, 0 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 409. Up to 37 conditions per place. [2022-11-16 10:55:17,512 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 20 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2022-11-16 10:55:17,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 391 transitions, 836 flow [2022-11-16 10:55:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2022-11-16 10:55:17,517 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415 [2022-11-16 10:55:17,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions. [2022-11-16 10:55:17,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions. [2022-11-16 10:55:17,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:17,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions. [2022-11-16 10:55:17,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 10:55:17,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:17,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:17,526 INFO L175 Difference]: Start difference. First operand has 390 places, 392 transitions, 794 flow. Second operand 3 states and 1214 transitions. [2022-11-16 10:55:17,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 391 transitions, 836 flow [2022-11-16 10:55:17,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 391 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:17,534 INFO L231 Difference]: Finished difference. Result has 383 places, 391 transitions, 792 flow [2022-11-16 10:55:17,535 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=383, PETRI_TRANSITIONS=391} [2022-11-16 10:55:17,536 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -104 predicate places. [2022-11-16 10:55:17,536 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 391 transitions, 792 flow [2022-11-16 10:55:17,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:17,537 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:17,537 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:17,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 10:55:17,538 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:17,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash -624578094, now seen corresponding path program 1 times [2022-11-16 10:55:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:17,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621299289] [2022-11-16 10:55:17,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:17,594 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 10:55:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:17,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621299289] [2022-11-16 10:55:17,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621299289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:17,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:17,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:17,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891731959] [2022-11-16 10:55:17,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:17,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:17,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:17,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:17,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:17,599 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526 [2022-11-16 10:55:17,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 391 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:17,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:17,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526 [2022-11-16 10:55:17,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:17,743 INFO L130 PetriNetUnfolder]: 30/406 cut-off events. [2022-11-16 10:55:17,744 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 10:55:17,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 406 events. 30/406 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 357 event pairs, 0 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 401. Up to 37 conditions per place. [2022-11-16 10:55:17,747 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 20 selfloop transitions, 2 changer transitions 0/390 dead transitions. [2022-11-16 10:55:17,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 390 transitions, 834 flow [2022-11-16 10:55:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2022-11-16 10:55:17,752 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415 [2022-11-16 10:55:17,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions. [2022-11-16 10:55:17,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions. [2022-11-16 10:55:17,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:17,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions. [2022-11-16 10:55:17,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 10:55:17,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:17,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:17,761 INFO L175 Difference]: Start difference. First operand has 383 places, 391 transitions, 792 flow. Second operand 3 states and 1214 transitions. [2022-11-16 10:55:17,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 390 transitions, 834 flow [2022-11-16 10:55:17,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 390 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:17,769 INFO L231 Difference]: Finished difference. Result has 382 places, 390 transitions, 790 flow [2022-11-16 10:55:17,770 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=382, PETRI_TRANSITIONS=390} [2022-11-16 10:55:17,772 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -105 predicate places. [2022-11-16 10:55:17,772 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 390 transitions, 790 flow [2022-11-16 10:55:17,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:17,774 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:17,774 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] [2022-11-16 10:55:17,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 10:55:17,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1106350425, now seen corresponding path program 1 times [2022-11-16 10:55:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:17,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662262247] [2022-11-16 10:55:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:17,861 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 10:55:17,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:17,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662262247] [2022-11-16 10:55:17,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662262247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:17,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:17,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967324145] [2022-11-16 10:55:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:17,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:17,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:17,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:17,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:17,865 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:17,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 390 transitions, 790 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 10:55:17,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:17,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:17,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:18,066 INFO L130 PetriNetUnfolder]: 56/531 cut-off events. [2022-11-16 10:55:18,066 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-11-16 10:55:18,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 531 events. 56/531 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 943 event pairs, 0 based on Foata normal form. 1/453 useless extension candidates. Maximal degree in co-relation 545. Up to 38 conditions per place. [2022-11-16 10:55:18,071 INFO L137 encePairwiseOnDemand]: 522/526 looper letters, 28 selfloop transitions, 3 changer transitions 0/402 dead transitions. [2022-11-16 10:55:18,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 402 transitions, 881 flow [2022-11-16 10:55:18,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1232 transitions. [2022-11-16 10:55:18,074 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7807351077313055 [2022-11-16 10:55:18,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1232 transitions. [2022-11-16 10:55:18,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1232 transitions. [2022-11-16 10:55:18,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:18,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1232 transitions. [2022-11-16 10:55:18,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.6666666666667) internal successors, (1232), 3 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states 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 10:55:18,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:18,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:18,083 INFO L175 Difference]: Start difference. First operand has 382 places, 390 transitions, 790 flow. Second operand 3 states and 1232 transitions. [2022-11-16 10:55:18,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 402 transitions, 881 flow [2022-11-16 10:55:18,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 402 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:18,090 INFO L231 Difference]: Finished difference. Result has 382 places, 391 transitions, 801 flow [2022-11-16 10:55:18,091 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=801, PETRI_PLACES=382, PETRI_TRANSITIONS=391} [2022-11-16 10:55:18,091 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -105 predicate places. [2022-11-16 10:55:18,092 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 391 transitions, 801 flow [2022-11-16 10:55:18,093 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 10:55:18,093 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:18,093 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] [2022-11-16 10:55:18,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 10:55:18,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:18,094 INFO L85 PathProgramCache]: Analyzing trace with hash 587427587, now seen corresponding path program 1 times [2022-11-16 10:55:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:18,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361453218] [2022-11-16 10:55:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:18,138 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 10:55:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:18,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361453218] [2022-11-16 10:55:18,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361453218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:18,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:18,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114129353] [2022-11-16 10:55:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:18,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:18,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:18,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:18,142 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:18,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 391 transitions, 801 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 10:55:18,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:18,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:18,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:18,317 INFO L130 PetriNetUnfolder]: 56/524 cut-off events. [2022-11-16 10:55:18,317 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-16 10:55:18,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 524 events. 56/524 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 898 event pairs, 2 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 376. Up to 63 conditions per place. [2022-11-16 10:55:18,322 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 19 selfloop transitions, 2 changer transitions 0/390 dead transitions. [2022-11-16 10:55:18,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 390 transitions, 841 flow [2022-11-16 10:55:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2022-11-16 10:55:18,326 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628 [2022-11-16 10:55:18,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions. [2022-11-16 10:55:18,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions. [2022-11-16 10:55:18,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:18,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions. [2022-11-16 10:55:18,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 10:55:18,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:18,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:18,334 INFO L175 Difference]: Start difference. First operand has 382 places, 391 transitions, 801 flow. Second operand 3 states and 1220 transitions. [2022-11-16 10:55:18,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 390 transitions, 841 flow [2022-11-16 10:55:18,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 390 transitions, 838 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:18,364 INFO L231 Difference]: Finished difference. Result has 382 places, 390 transitions, 800 flow [2022-11-16 10:55:18,365 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=382, PETRI_TRANSITIONS=390} [2022-11-16 10:55:18,368 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -105 predicate places. [2022-11-16 10:55:18,368 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 390 transitions, 800 flow [2022-11-16 10:55:18,369 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 10:55:18,369 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:18,370 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] [2022-11-16 10:55:18,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 10:55:18,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1934066728, now seen corresponding path program 1 times [2022-11-16 10:55:18,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:18,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279947404] [2022-11-16 10:55:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:18,453 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 10:55:18,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:18,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279947404] [2022-11-16 10:55:18,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279947404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:18,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:18,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:18,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480626667] [2022-11-16 10:55:18,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:18,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:18,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:18,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:18,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:18,463 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:18,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 390 transitions, 800 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 10:55:18,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:18,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:18,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:18,670 INFO L130 PetriNetUnfolder]: 56/523 cut-off events. [2022-11-16 10:55:18,670 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-16 10:55:18,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 523 events. 56/523 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 903 event pairs, 2 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 542. Up to 61 conditions per place. [2022-11-16 10:55:18,676 INFO L137 encePairwiseOnDemand]: 524/526 looper letters, 19 selfloop transitions, 1 changer transitions 0/389 dead transitions. [2022-11-16 10:55:18,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 389 transitions, 838 flow [2022-11-16 10:55:18,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1219 transitions. [2022-11-16 10:55:18,681 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7724968314321926 [2022-11-16 10:55:18,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1219 transitions. [2022-11-16 10:55:18,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1219 transitions. [2022-11-16 10:55:18,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:18,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1219 transitions. [2022-11-16 10:55:18,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states 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 10:55:18,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:18,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:18,691 INFO L175 Difference]: Start difference. First operand has 382 places, 390 transitions, 800 flow. Second operand 3 states and 1219 transitions. [2022-11-16 10:55:18,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 389 transitions, 838 flow [2022-11-16 10:55:18,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 389 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:18,700 INFO L231 Difference]: Finished difference. Result has 381 places, 389 transitions, 796 flow [2022-11-16 10:55:18,701 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=381, PETRI_TRANSITIONS=389} [2022-11-16 10:55:18,704 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -106 predicate places. [2022-11-16 10:55:18,704 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 389 transitions, 796 flow [2022-11-16 10:55:18,706 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 10:55:18,706 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:18,706 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] [2022-11-16 10:55:18,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 10:55:18,706 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:18,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:18,707 INFO L85 PathProgramCache]: Analyzing trace with hash 82523941, now seen corresponding path program 1 times [2022-11-16 10:55:18,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:18,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573250082] [2022-11-16 10:55:18,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:18,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:18,806 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 10:55:18,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:18,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573250082] [2022-11-16 10:55:18,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573250082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:18,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:18,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:18,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591036344] [2022-11-16 10:55:18,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:18,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:18,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:18,815 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:18,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 389 transitions, 796 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 10:55:18,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:18,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:18,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:18,981 INFO L130 PetriNetUnfolder]: 56/522 cut-off events. [2022-11-16 10:55:18,982 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-16 10:55:18,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 522 events. 56/522 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 902 event pairs, 2 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 542. Up to 63 conditions per place. [2022-11-16 10:55:18,987 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 19 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2022-11-16 10:55:18,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 388 transitions, 836 flow [2022-11-16 10:55:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2022-11-16 10:55:18,991 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628 [2022-11-16 10:55:18,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions. [2022-11-16 10:55:18,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions. [2022-11-16 10:55:18,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:18,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions. [2022-11-16 10:55:18,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 10:55:19,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:19,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:19,002 INFO L175 Difference]: Start difference. First operand has 381 places, 389 transitions, 796 flow. Second operand 3 states and 1220 transitions. [2022-11-16 10:55:19,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 388 transitions, 836 flow [2022-11-16 10:55:19,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 388 transitions, 835 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:19,010 INFO L231 Difference]: Finished difference. Result has 381 places, 388 transitions, 797 flow [2022-11-16 10:55:19,011 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=381, PETRI_TRANSITIONS=388} [2022-11-16 10:55:19,011 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -106 predicate places. [2022-11-16 10:55:19,012 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 388 transitions, 797 flow [2022-11-16 10:55:19,013 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 10:55:19,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:19,013 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 10:55:19,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 10:55:19,014 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:19,014 INFO L85 PathProgramCache]: Analyzing trace with hash -884836121, now seen corresponding path program 1 times [2022-11-16 10:55:19,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:19,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11739743] [2022-11-16 10:55:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:19,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:19,541 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 10:55:19,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:19,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11739743] [2022-11-16 10:55:19,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11739743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:19,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:19,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:55:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423395077] [2022-11-16 10:55:19,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:19,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:55:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:19,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:55:19,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:55:19,547 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 526 [2022-11-16 10:55:19,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 388 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 338.8333333333333) internal successors, (2033), 6 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states 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 10:55:19,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:19,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 526 [2022-11-16 10:55:19,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:19,942 INFO L130 PetriNetUnfolder]: 224/687 cut-off events. [2022-11-16 10:55:19,943 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-16 10:55:19,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 687 events. 224/687 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1151 event pairs, 8 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 981. Up to 297 conditions per place. [2022-11-16 10:55:19,951 INFO L137 encePairwiseOnDemand]: 508/526 looper letters, 67 selfloop transitions, 15 changer transitions 0/385 dead transitions. [2022-11-16 10:55:19,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 385 transitions, 955 flow [2022-11-16 10:55:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:55:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 10:55:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2105 transitions. [2022-11-16 10:55:19,957 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6669835234474017 [2022-11-16 10:55:19,960 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2105 transitions. [2022-11-16 10:55:19,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2105 transitions. [2022-11-16 10:55:19,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:19,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2105 transitions. [2022-11-16 10:55:19,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 350.8333333333333) internal successors, (2105), 6 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states 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 10:55:19,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states 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 10:55:19,973 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states 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 10:55:19,974 INFO L175 Difference]: Start difference. First operand has 381 places, 388 transitions, 797 flow. Second operand 6 states and 2105 transitions. [2022-11-16 10:55:19,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 385 transitions, 955 flow [2022-11-16 10:55:19,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 385 transitions, 951 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:19,981 INFO L231 Difference]: Finished difference. Result has 381 places, 385 transitions, 817 flow [2022-11-16 10:55:19,982 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=817, PETRI_PLACES=381, PETRI_TRANSITIONS=385} [2022-11-16 10:55:19,984 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -106 predicate places. [2022-11-16 10:55:19,984 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 385 transitions, 817 flow [2022-11-16 10:55:20,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.8333333333333) internal successors, (2033), 6 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states 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 10:55:20,001 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:20,001 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] [2022-11-16 10:55:20,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 10:55:20,001 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:20,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash 778444681, now seen corresponding path program 1 times [2022-11-16 10:55:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:20,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994176160] [2022-11-16 10:55:20,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:20,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:20,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994176160] [2022-11-16 10:55:20,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994176160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:20,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:20,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:20,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015799546] [2022-11-16 10:55:20,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:20,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:20,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:20,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:20,055 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526 [2022-11-16 10:55:20,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 385 transitions, 817 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:20,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:20,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526 [2022-11-16 10:55:20,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:20,214 INFO L130 PetriNetUnfolder]: 56/518 cut-off events. [2022-11-16 10:55:20,214 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-16 10:55:20,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 518 events. 56/518 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 895 event pairs, 2 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 574. Up to 66 conditions per place. [2022-11-16 10:55:20,219 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 22 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2022-11-16 10:55:20,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 384 transitions, 863 flow [2022-11-16 10:55:20,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2022-11-16 10:55:20,223 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415 [2022-11-16 10:55:20,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions. [2022-11-16 10:55:20,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions. [2022-11-16 10:55:20,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:20,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions. [2022-11-16 10:55:20,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 10:55:20,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:20,230 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:20,230 INFO L175 Difference]: Start difference. First operand has 381 places, 385 transitions, 817 flow. Second operand 3 states and 1214 transitions. [2022-11-16 10:55:20,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 384 transitions, 863 flow [2022-11-16 10:55:20,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 384 transitions, 833 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 10:55:20,239 INFO L231 Difference]: Finished difference. Result has 377 places, 384 transitions, 789 flow [2022-11-16 10:55:20,240 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=377, PETRI_TRANSITIONS=384} [2022-11-16 10:55:20,241 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -110 predicate places. [2022-11-16 10:55:20,241 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 384 transitions, 789 flow [2022-11-16 10:55:20,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:20,242 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:20,242 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:20,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 10:55:20,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:20,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:20,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1272507022, now seen corresponding path program 1 times [2022-11-16 10:55:20,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:20,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242434590] [2022-11-16 10:55:20,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:20,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:20,294 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 10:55:20,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:20,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242434590] [2022-11-16 10:55:20,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242434590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:20,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:20,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134718161] [2022-11-16 10:55:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:20,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:20,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:20,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:20,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:20,303 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:20,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 384 transitions, 789 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 10:55:20,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:20,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:20,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:20,522 INFO L130 PetriNetUnfolder]: 88/653 cut-off events. [2022-11-16 10:55:20,522 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-11-16 10:55:20,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 653 events. 88/653 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1552 event pairs, 2 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 713. Up to 55 conditions per place. [2022-11-16 10:55:20,529 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 31 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2022-11-16 10:55:20,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 396 transitions, 890 flow [2022-11-16 10:55:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2022-11-16 10:55:20,534 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.779467680608365 [2022-11-16 10:55:20,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1230 transitions. [2022-11-16 10:55:20,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1230 transitions. [2022-11-16 10:55:20,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:20,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1230 transitions. [2022-11-16 10:55:20,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 10:55:20,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:20,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:20,542 INFO L175 Difference]: Start difference. First operand has 377 places, 384 transitions, 789 flow. Second operand 3 states and 1230 transitions. [2022-11-16 10:55:20,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 396 transitions, 890 flow [2022-11-16 10:55:20,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 396 transitions, 886 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:20,550 INFO L231 Difference]: Finished difference. Result has 377 places, 384 transitions, 793 flow [2022-11-16 10:55:20,551 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=377, PETRI_TRANSITIONS=384} [2022-11-16 10:55:20,552 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -110 predicate places. [2022-11-16 10:55:20,552 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 384 transitions, 793 flow [2022-11-16 10:55:20,552 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 10:55:20,553 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:20,553 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:20,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 10:55:20,553 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:20,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:20,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1915294856, now seen corresponding path program 1 times [2022-11-16 10:55:20,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:20,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368234315] [2022-11-16 10:55:20,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:20,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:20,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:20,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368234315] [2022-11-16 10:55:20,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368234315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:20,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:20,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230041834] [2022-11-16 10:55:20,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:20,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:20,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:20,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:20,601 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:20,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 384 transitions, 793 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 10:55:20,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:20,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:20,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:20,776 INFO L130 PetriNetUnfolder]: 84/620 cut-off events. [2022-11-16 10:55:20,776 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-11-16 10:55:20,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 620 events. 84/620 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1377 event pairs, 7 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 697. Up to 97 conditions per place. [2022-11-16 10:55:20,783 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 20 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2022-11-16 10:55:20,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 383 transitions, 835 flow [2022-11-16 10:55:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2022-11-16 10:55:20,787 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628 [2022-11-16 10:55:20,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions. [2022-11-16 10:55:20,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions. [2022-11-16 10:55:20,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:20,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions. [2022-11-16 10:55:20,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 10:55:20,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:20,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:20,795 INFO L175 Difference]: Start difference. First operand has 377 places, 384 transitions, 793 flow. Second operand 3 states and 1220 transitions. [2022-11-16 10:55:20,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 383 transitions, 835 flow [2022-11-16 10:55:20,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 383 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:20,803 INFO L231 Difference]: Finished difference. Result has 377 places, 383 transitions, 793 flow [2022-11-16 10:55:20,804 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=377, PETRI_TRANSITIONS=383} [2022-11-16 10:55:20,804 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -110 predicate places. [2022-11-16 10:55:20,804 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 383 transitions, 793 flow [2022-11-16 10:55:20,805 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 10:55:20,805 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:20,805 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] [2022-11-16 10:55:20,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 10:55:20,806 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:20,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash 849336443, now seen corresponding path program 1 times [2022-11-16 10:55:20,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:20,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725061177] [2022-11-16 10:55:20,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:20,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:20,853 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 10:55:20,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:20,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725061177] [2022-11-16 10:55:20,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725061177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:20,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:20,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:20,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288646463] [2022-11-16 10:55:20,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:20,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:20,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:20,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:20,857 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526 [2022-11-16 10:55:20,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 383 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:20,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:20,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526 [2022-11-16 10:55:20,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:21,080 INFO L130 PetriNetUnfolder]: 84/619 cut-off events. [2022-11-16 10:55:21,081 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-11-16 10:55:21,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 619 events. 84/619 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1380 event pairs, 7 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 695. Up to 100 conditions per place. [2022-11-16 10:55:21,087 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 23 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2022-11-16 10:55:21,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 382 transitions, 841 flow [2022-11-16 10:55:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2022-11-16 10:55:21,092 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415 [2022-11-16 10:55:21,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions. [2022-11-16 10:55:21,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions. [2022-11-16 10:55:21,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:21,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions. [2022-11-16 10:55:21,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 10:55:21,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:21,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:21,100 INFO L175 Difference]: Start difference. First operand has 377 places, 383 transitions, 793 flow. Second operand 3 states and 1214 transitions. [2022-11-16 10:55:21,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 382 transitions, 841 flow [2022-11-16 10:55:21,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 382 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:21,110 INFO L231 Difference]: Finished difference. Result has 376 places, 382 transitions, 791 flow [2022-11-16 10:55:21,111 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=791, PETRI_PLACES=376, PETRI_TRANSITIONS=382} [2022-11-16 10:55:21,111 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -111 predicate places. [2022-11-16 10:55:21,112 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 382 transitions, 791 flow [2022-11-16 10:55:21,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:21,112 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:21,113 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] [2022-11-16 10:55:21,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 10:55:21,113 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:21,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:21,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1181864719, now seen corresponding path program 1 times [2022-11-16 10:55:21,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:21,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728865961] [2022-11-16 10:55:21,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,167 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 10:55:21,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:21,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728865961] [2022-11-16 10:55:21,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728865961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:21,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:21,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:21,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318308187] [2022-11-16 10:55:21,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:21,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:21,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:21,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:21,177 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:21,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 382 transitions, 791 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 10:55:21,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:21,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:21,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:21,382 INFO L130 PetriNetUnfolder]: 84/618 cut-off events. [2022-11-16 10:55:21,382 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-11-16 10:55:21,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 618 events. 84/618 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1385 event pairs, 7 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 691. Up to 95 conditions per place. [2022-11-16 10:55:21,389 INFO L137 encePairwiseOnDemand]: 524/526 looper letters, 20 selfloop transitions, 1 changer transitions 0/381 dead transitions. [2022-11-16 10:55:21,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 381 transitions, 831 flow [2022-11-16 10:55:21,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1219 transitions. [2022-11-16 10:55:21,393 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7724968314321926 [2022-11-16 10:55:21,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1219 transitions. [2022-11-16 10:55:21,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1219 transitions. [2022-11-16 10:55:21,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:21,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1219 transitions. [2022-11-16 10:55:21,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states 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 10:55:21,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:21,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:21,402 INFO L175 Difference]: Start difference. First operand has 376 places, 382 transitions, 791 flow. Second operand 3 states and 1219 transitions. [2022-11-16 10:55:21,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 381 transitions, 831 flow [2022-11-16 10:55:21,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 381 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:21,412 INFO L231 Difference]: Finished difference. Result has 375 places, 381 transitions, 787 flow [2022-11-16 10:55:21,413 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=375, PETRI_TRANSITIONS=381} [2022-11-16 10:55:21,414 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -112 predicate places. [2022-11-16 10:55:21,414 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 381 transitions, 787 flow [2022-11-16 10:55:21,415 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 10:55:21,415 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:21,415 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] [2022-11-16 10:55:21,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 10:55:21,416 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 926345287, now seen corresponding path program 1 times [2022-11-16 10:55:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:21,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009453017] [2022-11-16 10:55:21,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,477 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 10:55:21,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:21,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009453017] [2022-11-16 10:55:21,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009453017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:21,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:21,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:21,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407375747] [2022-11-16 10:55:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:21,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:21,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:21,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:21,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:21,481 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:21,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 381 transitions, 787 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 10:55:21,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:21,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:21,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:21,662 INFO L130 PetriNetUnfolder]: 84/617 cut-off events. [2022-11-16 10:55:21,662 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-11-16 10:55:21,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 617 events. 84/617 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1383 event pairs, 7 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 689. Up to 97 conditions per place. [2022-11-16 10:55:21,669 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 20 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2022-11-16 10:55:21,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 380 transitions, 829 flow [2022-11-16 10:55:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2022-11-16 10:55:21,673 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628 [2022-11-16 10:55:21,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions. [2022-11-16 10:55:21,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions. [2022-11-16 10:55:21,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:21,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions. [2022-11-16 10:55:21,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 10:55:21,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:21,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:21,680 INFO L175 Difference]: Start difference. First operand has 375 places, 381 transitions, 787 flow. Second operand 3 states and 1220 transitions. [2022-11-16 10:55:21,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 380 transitions, 829 flow [2022-11-16 10:55:21,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 380 transitions, 828 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:21,733 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 788 flow [2022-11-16 10:55:21,734 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=375, PETRI_TRANSITIONS=380} [2022-11-16 10:55:21,734 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -112 predicate places. [2022-11-16 10:55:21,735 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 788 flow [2022-11-16 10:55:21,735 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 10:55:21,735 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:21,735 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] [2022-11-16 10:55:21,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 10:55:21,736 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:21,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:21,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1800171452, now seen corresponding path program 1 times [2022-11-16 10:55:21,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:21,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566867414] [2022-11-16 10:55:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:21,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,793 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 10:55:21,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:21,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566867414] [2022-11-16 10:55:21,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566867414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:21,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:21,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628119211] [2022-11-16 10:55:21,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:21,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:21,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:21,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:21,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:21,797 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526 [2022-11-16 10:55:21,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:21,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:21,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526 [2022-11-16 10:55:21,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:21,973 INFO L130 PetriNetUnfolder]: 84/616 cut-off events. [2022-11-16 10:55:21,974 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-11-16 10:55:21,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 616 events. 84/616 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1383 event pairs, 7 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 693. Up to 100 conditions per place. [2022-11-16 10:55:21,981 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 23 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2022-11-16 10:55:21,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 379 transitions, 836 flow [2022-11-16 10:55:21,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2022-11-16 10:55:21,984 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415 [2022-11-16 10:55:21,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions. [2022-11-16 10:55:21,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions. [2022-11-16 10:55:21,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:21,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions. [2022-11-16 10:55:21,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 10:55:21,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:21,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:21,992 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 788 flow. Second operand 3 states and 1214 transitions. [2022-11-16 10:55:21,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 379 transitions, 836 flow [2022-11-16 10:55:21,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 379 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:21,999 INFO L231 Difference]: Finished difference. Result has 374 places, 379 transitions, 786 flow [2022-11-16 10:55:21,999 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=374, PETRI_TRANSITIONS=379} [2022-11-16 10:55:22,000 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -113 predicate places. [2022-11-16 10:55:22,000 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 379 transitions, 786 flow [2022-11-16 10:55:22,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:22,001 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:22,001 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 10:55:22,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 10:55:22,002 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:22,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash -121418171, now seen corresponding path program 1 times [2022-11-16 10:55:22,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:22,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238463998] [2022-11-16 10:55:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:22,058 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 10:55:22,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:22,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238463998] [2022-11-16 10:55:22,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238463998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:22,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:22,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:22,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812964222] [2022-11-16 10:55:22,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:22,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:22,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:22,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:22,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:22,062 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:22,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 379 transitions, 786 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 10:55:22,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:22,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:22,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:22,369 INFO L130 PetriNetUnfolder]: 158/901 cut-off events. [2022-11-16 10:55:22,369 INFO L131 PetriNetUnfolder]: For 77/81 co-relation queries the response was YES. [2022-11-16 10:55:22,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 901 events. 158/901 cut-off events. For 77/81 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3153 event pairs, 7 based on Foata normal form. 4/774 useless extension candidates. Maximal degree in co-relation 1083. Up to 95 conditions per place. [2022-11-16 10:55:22,388 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 34 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2022-11-16 10:55:22,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 393 transitions, 902 flow [2022-11-16 10:55:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2022-11-16 10:55:22,392 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7801013941698353 [2022-11-16 10:55:22,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1231 transitions. [2022-11-16 10:55:22,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1231 transitions. [2022-11-16 10:55:22,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:22,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1231 transitions. [2022-11-16 10:55:22,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states 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 10:55:22,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:22,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:22,400 INFO L175 Difference]: Start difference. First operand has 374 places, 379 transitions, 786 flow. Second operand 3 states and 1231 transitions. [2022-11-16 10:55:22,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 393 transitions, 902 flow [2022-11-16 10:55:22,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 393 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:22,408 INFO L231 Difference]: Finished difference. Result has 374 places, 379 transitions, 790 flow [2022-11-16 10:55:22,408 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=374, PETRI_TRANSITIONS=379} [2022-11-16 10:55:22,409 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -113 predicate places. [2022-11-16 10:55:22,411 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 379 transitions, 790 flow [2022-11-16 10:55:22,412 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 10:55:22,412 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:22,412 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] [2022-11-16 10:55:22,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 10:55:22,412 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:22,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:22,413 INFO L85 PathProgramCache]: Analyzing trace with hash 845564649, now seen corresponding path program 1 times [2022-11-16 10:55:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:22,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346562233] [2022-11-16 10:55:22,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:22,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:22,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:22,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346562233] [2022-11-16 10:55:22,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346562233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:22,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:22,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71313235] [2022-11-16 10:55:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:22,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:22,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:22,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:22,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:22,479 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:22,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 379 transitions, 790 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 10:55:22,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:22,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:22,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:22,734 INFO L130 PetriNetUnfolder]: 156/884 cut-off events. [2022-11-16 10:55:22,735 INFO L131 PetriNetUnfolder]: For 97/99 co-relation queries the response was YES. [2022-11-16 10:55:22,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 884 events. 156/884 cut-off events. For 97/99 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3019 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1095. Up to 179 conditions per place. [2022-11-16 10:55:22,746 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 21 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2022-11-16 10:55:22,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 378 transitions, 834 flow [2022-11-16 10:55:22,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2022-11-16 10:55:22,749 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628 [2022-11-16 10:55:22,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions. [2022-11-16 10:55:22,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions. [2022-11-16 10:55:22,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:22,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions. [2022-11-16 10:55:22,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 10:55:22,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:22,756 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:22,756 INFO L175 Difference]: Start difference. First operand has 374 places, 379 transitions, 790 flow. Second operand 3 states and 1220 transitions. [2022-11-16 10:55:22,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 378 transitions, 834 flow [2022-11-16 10:55:22,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 378 transitions, 832 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:22,764 INFO L231 Difference]: Finished difference. Result has 374 places, 378 transitions, 790 flow [2022-11-16 10:55:22,765 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=374, PETRI_TRANSITIONS=378} [2022-11-16 10:55:22,765 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -113 predicate places. [2022-11-16 10:55:22,765 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 378 transitions, 790 flow [2022-11-16 10:55:22,766 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 10:55:22,766 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:22,766 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] [2022-11-16 10:55:22,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 10:55:22,767 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:22,767 INFO L85 PathProgramCache]: Analyzing trace with hash -977035603, now seen corresponding path program 1 times [2022-11-16 10:55:22,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:22,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932819141] [2022-11-16 10:55:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:22,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 10:55:22,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:22,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932819141] [2022-11-16 10:55:22,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932819141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:22,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:22,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:22,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672559223] [2022-11-16 10:55:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:22,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:22,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:22,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:22,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:22,838 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 526 [2022-11-16 10:55:22,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 378 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:22,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:22,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 526 [2022-11-16 10:55:22,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:23,113 INFO L130 PetriNetUnfolder]: 156/883 cut-off events. [2022-11-16 10:55:23,114 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES. [2022-11-16 10:55:23,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 883 events. 156/883 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3012 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1089. Up to 182 conditions per place. [2022-11-16 10:55:23,124 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2022-11-16 10:55:23,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 377 transitions, 840 flow [2022-11-16 10:55:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2022-11-16 10:55:23,128 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7693282636248415 [2022-11-16 10:55:23,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1214 transitions. [2022-11-16 10:55:23,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1214 transitions. [2022-11-16 10:55:23,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:23,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1214 transitions. [2022-11-16 10:55:23,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 10:55:23,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:23,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:23,135 INFO L175 Difference]: Start difference. First operand has 374 places, 378 transitions, 790 flow. Second operand 3 states and 1214 transitions. [2022-11-16 10:55:23,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 377 transitions, 840 flow [2022-11-16 10:55:23,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 377 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:23,142 INFO L231 Difference]: Finished difference. Result has 373 places, 377 transitions, 788 flow [2022-11-16 10:55:23,143 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=373, PETRI_TRANSITIONS=377} [2022-11-16 10:55:23,143 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -114 predicate places. [2022-11-16 10:55:23,143 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 377 transitions, 788 flow [2022-11-16 10:55:23,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states 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 10:55:23,144 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:23,144 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] [2022-11-16 10:55:23,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 10:55:23,145 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:23,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash -331651241, now seen corresponding path program 1 times [2022-11-16 10:55:23,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:23,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075766161] [2022-11-16 10:55:23,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:23,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:23,209 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 10:55:23,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:23,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075766161] [2022-11-16 10:55:23,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075766161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:23,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:23,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:23,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898778313] [2022-11-16 10:55:23,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:23,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:23,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:23,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:23,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:23,214 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:23,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 377 transitions, 788 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 10:55:23,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:23,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:23,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:23,460 INFO L130 PetriNetUnfolder]: 156/882 cut-off events. [2022-11-16 10:55:23,460 INFO L131 PetriNetUnfolder]: For 97/99 co-relation queries the response was YES. [2022-11-16 10:55:23,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 882 events. 156/882 cut-off events. For 97/99 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3000 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1085. Up to 177 conditions per place. [2022-11-16 10:55:23,471 INFO L137 encePairwiseOnDemand]: 524/526 looper letters, 21 selfloop transitions, 1 changer transitions 0/376 dead transitions. [2022-11-16 10:55:23,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 376 transitions, 830 flow [2022-11-16 10:55:23,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1219 transitions. [2022-11-16 10:55:23,475 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7724968314321926 [2022-11-16 10:55:23,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1219 transitions. [2022-11-16 10:55:23,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1219 transitions. [2022-11-16 10:55:23,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:23,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1219 transitions. [2022-11-16 10:55:23,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states 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 10:55:23,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:23,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:23,482 INFO L175 Difference]: Start difference. First operand has 373 places, 377 transitions, 788 flow. Second operand 3 states and 1219 transitions. [2022-11-16 10:55:23,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 376 transitions, 830 flow [2022-11-16 10:55:23,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 376 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:23,489 INFO L231 Difference]: Finished difference. Result has 372 places, 376 transitions, 784 flow [2022-11-16 10:55:23,489 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=372, PETRI_TRANSITIONS=376} [2022-11-16 10:55:23,490 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -115 predicate places. [2022-11-16 10:55:23,490 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 376 transitions, 784 flow [2022-11-16 10:55:23,491 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 10:55:23,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:23,491 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] [2022-11-16 10:55:23,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 10:55:23,492 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash 301842717, now seen corresponding path program 1 times [2022-11-16 10:55:23,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:23,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597937989] [2022-11-16 10:55:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:23,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:23,563 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 10:55:23,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:23,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597937989] [2022-11-16 10:55:23,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597937989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:23,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:23,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:23,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224695483] [2022-11-16 10:55:23,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:23,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:23,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:23,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:23,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:23,567 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:23,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 376 transitions, 784 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 10:55:23,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:23,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:23,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:23,904 INFO L130 PetriNetUnfolder]: 156/881 cut-off events. [2022-11-16 10:55:23,904 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES. [2022-11-16 10:55:23,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 881 events. 156/881 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3031 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1083. Up to 179 conditions per place. [2022-11-16 10:55:23,916 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 21 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2022-11-16 10:55:23,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 375 transitions, 828 flow [2022-11-16 10:55:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2022-11-16 10:55:23,921 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628 [2022-11-16 10:55:23,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions. [2022-11-16 10:55:23,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions. [2022-11-16 10:55:23,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:23,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions. [2022-11-16 10:55:23,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 10:55:23,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:23,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:23,929 INFO L175 Difference]: Start difference. First operand has 372 places, 376 transitions, 784 flow. Second operand 3 states and 1220 transitions. [2022-11-16 10:55:23,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 375 transitions, 828 flow [2022-11-16 10:55:23,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 375 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:23,937 INFO L231 Difference]: Finished difference. Result has 372 places, 375 transitions, 785 flow [2022-11-16 10:55:23,938 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=372, PETRI_TRANSITIONS=375} [2022-11-16 10:55:23,938 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -115 predicate places. [2022-11-16 10:55:23,938 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 375 transitions, 785 flow [2022-11-16 10:55:23,939 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 10:55:23,939 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:23,939 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, 1, 1, 1, 1, 1] [2022-11-16 10:55:23,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 10:55:23,940 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:23,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:23,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1375749048, now seen corresponding path program 1 times [2022-11-16 10:55:23,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:23,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065333411] [2022-11-16 10:55:23,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,029 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 10:55:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:24,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065333411] [2022-11-16 10:55:24,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065333411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:24,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:24,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149813264] [2022-11-16 10:55:24,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:24,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:24,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:24,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:24,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:24,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 375 transitions, 785 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 10:55:24,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:24,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:24,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:24,358 INFO L130 PetriNetUnfolder]: 156/880 cut-off events. [2022-11-16 10:55:24,358 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES. [2022-11-16 10:55:24,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 880 events. 156/880 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3027 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1084. Up to 179 conditions per place. [2022-11-16 10:55:24,369 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 21 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2022-11-16 10:55:24,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 374 transitions, 829 flow [2022-11-16 10:55:24,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2022-11-16 10:55:24,373 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628 [2022-11-16 10:55:24,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions. [2022-11-16 10:55:24,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions. [2022-11-16 10:55:24,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:24,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions. [2022-11-16 10:55:24,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 10:55:24,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:24,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:24,381 INFO L175 Difference]: Start difference. First operand has 372 places, 375 transitions, 785 flow. Second operand 3 states and 1220 transitions. [2022-11-16 10:55:24,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 374 transitions, 829 flow [2022-11-16 10:55:24,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 374 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:24,388 INFO L231 Difference]: Finished difference. Result has 371 places, 374 transitions, 783 flow [2022-11-16 10:55:24,389 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=371, PETRI_TRANSITIONS=374} [2022-11-16 10:55:24,389 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -116 predicate places. [2022-11-16 10:55:24,390 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 374 transitions, 783 flow [2022-11-16 10:55:24,390 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 10:55:24,390 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:24,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:24,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 10:55:24,391 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:24,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:24,392 INFO L85 PathProgramCache]: Analyzing trace with hash -25338025, now seen corresponding path program 1 times [2022-11-16 10:55:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:24,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464446772] [2022-11-16 10:55:24,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,458 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 10:55:24,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:24,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464446772] [2022-11-16 10:55:24,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464446772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:24,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:24,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:24,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099743680] [2022-11-16 10:55:24,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:24,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:24,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:24,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:24,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:24,462 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:24,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 374 transitions, 783 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 10:55:24,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:24,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:24,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:24,728 INFO L130 PetriNetUnfolder]: 156/879 cut-off events. [2022-11-16 10:55:24,729 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES. [2022-11-16 10:55:24,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 879 events. 156/879 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3019 event pairs, 22 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1083. Up to 179 conditions per place. [2022-11-16 10:55:24,738 INFO L137 encePairwiseOnDemand]: 523/526 looper letters, 21 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2022-11-16 10:55:24,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 373 transitions, 827 flow [2022-11-16 10:55:24,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2022-11-16 10:55:24,741 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628 [2022-11-16 10:55:24,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1220 transitions. [2022-11-16 10:55:24,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1220 transitions. [2022-11-16 10:55:24,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:24,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1220 transitions. [2022-11-16 10:55:24,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.6666666666667) internal successors, (1220), 3 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 10:55:24,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:24,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:24,749 INFO L175 Difference]: Start difference. First operand has 371 places, 374 transitions, 783 flow. Second operand 3 states and 1220 transitions. [2022-11-16 10:55:24,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 373 transitions, 827 flow [2022-11-16 10:55:24,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 373 transitions, 823 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:24,755 INFO L231 Difference]: Finished difference. Result has 370 places, 373 transitions, 781 flow [2022-11-16 10:55:24,756 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=370, PETRI_TRANSITIONS=373} [2022-11-16 10:55:24,756 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -117 predicate places. [2022-11-16 10:55:24,756 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 373 transitions, 781 flow [2022-11-16 10:55:24,757 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 10:55:24,757 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:24,757 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:24,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 10:55:24,758 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash 910216393, now seen corresponding path program 1 times [2022-11-16 10:55:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:24,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470370434] [2022-11-16 10:55:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,840 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 10:55:24,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:24,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470370434] [2022-11-16 10:55:24,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470370434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:24,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:24,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013897315] [2022-11-16 10:55:24,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:24,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:24,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:24,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:24,846 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 526 [2022-11-16 10:55:24,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 373 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states 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 10:55:24,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:24,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 526 [2022-11-16 10:55:24,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:25,487 INFO L130 PetriNetUnfolder]: 605/2060 cut-off events. [2022-11-16 10:55:25,487 INFO L131 PetriNetUnfolder]: For 304/312 co-relation queries the response was YES. [2022-11-16 10:55:25,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 2060 events. 605/2060 cut-off events. For 304/312 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 11871 event pairs, 88 based on Foata normal form. 1/1718 useless extension candidates. Maximal degree in co-relation 3058. Up to 566 conditions per place. [2022-11-16 10:55:25,517 INFO L137 encePairwiseOnDemand]: 517/526 looper letters, 31 selfloop transitions, 7 changer transitions 0/381 dead transitions. [2022-11-16 10:55:25,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 381 transitions, 886 flow [2022-11-16 10:55:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1218 transitions. [2022-11-16 10:55:25,521 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7718631178707225 [2022-11-16 10:55:25,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1218 transitions. [2022-11-16 10:55:25,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1218 transitions. [2022-11-16 10:55:25,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:25,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1218 transitions. [2022-11-16 10:55:25,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.0) internal successors, (1218), 3 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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 10:55:25,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:25,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:25,528 INFO L175 Difference]: Start difference. First operand has 370 places, 373 transitions, 781 flow. Second operand 3 states and 1218 transitions. [2022-11-16 10:55:25,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 381 transitions, 886 flow [2022-11-16 10:55:25,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 381 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:55:25,535 INFO L231 Difference]: Finished difference. Result has 367 places, 370 transitions, 794 flow [2022-11-16 10:55:25,537 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=367, PETRI_TRANSITIONS=370} [2022-11-16 10:55:25,537 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -120 predicate places. [2022-11-16 10:55:25,538 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 370 transitions, 794 flow [2022-11-16 10:55:25,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states 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 10:55:25,538 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:25,539 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, 1, 1, 1, 1, 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 10:55:25,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 10:55:25,539 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:25,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1090400631, now seen corresponding path program 1 times [2022-11-16 10:55:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:25,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746102463] [2022-11-16 10:55:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:25,625 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 10:55:25,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:25,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746102463] [2022-11-16 10:55:25,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746102463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:25,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:25,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:25,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168374643] [2022-11-16 10:55:25,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:25,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:25,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:25,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:25,629 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:25,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 370 transitions, 794 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 10:55:25,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:25,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:25,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:26,310 INFO L130 PetriNetUnfolder]: 722/2161 cut-off events. [2022-11-16 10:55:26,310 INFO L131 PetriNetUnfolder]: For 1440/1484 co-relation queries the response was YES. [2022-11-16 10:55:26,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 2161 events. 722/2161 cut-off events. For 1440/1484 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 12313 event pairs, 34 based on Foata normal form. 10/1882 useless extension candidates. Maximal degree in co-relation 3601. Up to 668 conditions per place. [2022-11-16 10:55:26,340 INFO L137 encePairwiseOnDemand]: 521/526 looper letters, 32 selfloop transitions, 4 changer transitions 0/382 dead transitions. [2022-11-16 10:55:26,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 382 transitions, 924 flow [2022-11-16 10:55:26,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2022-11-16 10:55:26,344 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7801013941698353 [2022-11-16 10:55:26,344 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1231 transitions. [2022-11-16 10:55:26,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1231 transitions. [2022-11-16 10:55:26,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:26,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1231 transitions. [2022-11-16 10:55:26,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states 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 10:55:26,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:26,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:26,351 INFO L175 Difference]: Start difference. First operand has 367 places, 370 transitions, 794 flow. Second operand 3 states and 1231 transitions. [2022-11-16 10:55:26,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 382 transitions, 924 flow [2022-11-16 10:55:26,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 382 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:26,359 INFO L231 Difference]: Finished difference. Result has 367 places, 369 transitions, 799 flow [2022-11-16 10:55:26,360 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=367, PETRI_TRANSITIONS=369} [2022-11-16 10:55:26,360 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -120 predicate places. [2022-11-16 10:55:26,360 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 369 transitions, 799 flow [2022-11-16 10:55:26,361 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 10:55:26,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:26,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:26,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 10:55:26,362 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:26,362 INFO L85 PathProgramCache]: Analyzing trace with hash 953408795, now seen corresponding path program 1 times [2022-11-16 10:55:26,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:26,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281087065] [2022-11-16 10:55:26,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:26,459 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 10:55:26,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:26,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281087065] [2022-11-16 10:55:26,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281087065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:26,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:26,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:26,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017153361] [2022-11-16 10:55:26,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:26,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:26,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:26,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:26,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:26,463 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:26,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 369 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:26,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:26,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:26,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:27,229 INFO L130 PetriNetUnfolder]: 802/2817 cut-off events. [2022-11-16 10:55:27,229 INFO L131 PetriNetUnfolder]: For 1844/1916 co-relation queries the response was YES. [2022-11-16 10:55:27,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4716 conditions, 2817 events. 802/2817 cut-off events. For 1844/1916 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 20797 event pairs, 42 based on Foata normal form. 16/2376 useless extension candidates. Maximal degree in co-relation 4647. Up to 824 conditions per place. [2022-11-16 10:55:27,265 INFO L137 encePairwiseOnDemand]: 521/526 looper letters, 31 selfloop transitions, 4 changer transitions 0/380 dead transitions. [2022-11-16 10:55:27,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 380 transitions, 927 flow [2022-11-16 10:55:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2022-11-16 10:55:27,325 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.779467680608365 [2022-11-16 10:55:27,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1230 transitions. [2022-11-16 10:55:27,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1230 transitions. [2022-11-16 10:55:27,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:27,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1230 transitions. [2022-11-16 10:55:27,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 10:55:27,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:27,333 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:27,333 INFO L175 Difference]: Start difference. First operand has 367 places, 369 transitions, 799 flow. Second operand 3 states and 1230 transitions. [2022-11-16 10:55:27,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 380 transitions, 927 flow [2022-11-16 10:55:27,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 380 transitions, 920 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:27,343 INFO L231 Difference]: Finished difference. Result has 367 places, 368 transitions, 807 flow [2022-11-16 10:55:27,344 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=807, PETRI_PLACES=367, PETRI_TRANSITIONS=368} [2022-11-16 10:55:27,344 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -120 predicate places. [2022-11-16 10:55:27,344 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 368 transitions, 807 flow [2022-11-16 10:55:27,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:27,345 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:27,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:27,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 10:55:27,346 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:27,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1333208660, now seen corresponding path program 1 times [2022-11-16 10:55:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:27,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030144916] [2022-11-16 10:55:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:28,228 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 10:55:28,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:28,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030144916] [2022-11-16 10:55:28,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030144916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:28,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:28,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:55:28,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604278811] [2022-11-16 10:55:28,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:28,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:55:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:28,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:55:28,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:55:28,233 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 526 [2022-11-16 10:55:28,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 368 transitions, 807 flow. Second operand has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 10:55:28,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:28,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 526 [2022-11-16 10:55:28,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:29,756 INFO L130 PetriNetUnfolder]: 1392/2833 cut-off events. [2022-11-16 10:55:29,756 INFO L131 PetriNetUnfolder]: For 4712/4712 co-relation queries the response was YES. [2022-11-16 10:55:29,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6815 conditions, 2833 events. 1392/2833 cut-off events. For 4712/4712 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 13618 event pairs, 22 based on Foata normal form. 0/2604 useless extension candidates. Maximal degree in co-relation 6743. Up to 1440 conditions per place. [2022-11-16 10:55:29,806 INFO L137 encePairwiseOnDemand]: 521/526 looper letters, 98 selfloop transitions, 4 changer transitions 0/415 dead transitions. [2022-11-16 10:55:29,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 415 transitions, 1277 flow [2022-11-16 10:55:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:55:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 10:55:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2267 transitions. [2022-11-16 10:55:29,811 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7183143219264893 [2022-11-16 10:55:29,811 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2267 transitions. [2022-11-16 10:55:29,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2267 transitions. [2022-11-16 10:55:29,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:29,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2267 transitions. [2022-11-16 10:55:29,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 377.8333333333333) internal successors, (2267), 6 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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 10:55:29,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states 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 10:55:29,823 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states 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 10:55:29,824 INFO L175 Difference]: Start difference. First operand has 367 places, 368 transitions, 807 flow. Second operand 6 states and 2267 transitions. [2022-11-16 10:55:29,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 415 transitions, 1277 flow [2022-11-16 10:55:29,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 415 transitions, 1261 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:29,833 INFO L231 Difference]: Finished difference. Result has 370 places, 367 transitions, 809 flow [2022-11-16 10:55:29,834 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=809, PETRI_PLACES=370, PETRI_TRANSITIONS=367} [2022-11-16 10:55:29,834 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -117 predicate places. [2022-11-16 10:55:29,834 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 367 transitions, 809 flow [2022-11-16 10:55:29,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 10:55:29,835 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:29,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:29,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 10:55:29,836 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1603463724, now seen corresponding path program 1 times [2022-11-16 10:55:29,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:29,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693243999] [2022-11-16 10:55:29,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:29,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:30,581 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 10:55:30,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:30,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693243999] [2022-11-16 10:55:30,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693243999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:30,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:30,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:55:30,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924302296] [2022-11-16 10:55:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:30,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:55:30,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:30,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:55:30,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:55:30,586 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 526 [2022-11-16 10:55:30,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 367 transitions, 809 flow. Second operand has 6 states, 6 states have (on average 367.0) internal successors, (2202), 6 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states 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 10:55:30,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:30,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 526 [2022-11-16 10:55:30,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:31,760 INFO L130 PetriNetUnfolder]: 1332/2672 cut-off events. [2022-11-16 10:55:31,761 INFO L131 PetriNetUnfolder]: For 2650/2650 co-relation queries the response was YES. [2022-11-16 10:55:31,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6524 conditions, 2672 events. 1332/2672 cut-off events. For 2650/2650 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 12593 event pairs, 103 based on Foata normal form. 0/2445 useless extension candidates. Maximal degree in co-relation 6451. Up to 896 conditions per place. [2022-11-16 10:55:31,810 INFO L137 encePairwiseOnDemand]: 521/526 looper letters, 73 selfloop transitions, 4 changer transitions 0/390 dead transitions. [2022-11-16 10:55:31,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 390 transitions, 1089 flow [2022-11-16 10:55:31,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:55:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 10:55:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2250 transitions. [2022-11-16 10:55:31,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7129277566539924 [2022-11-16 10:55:31,817 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2250 transitions. [2022-11-16 10:55:31,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2250 transitions. [2022-11-16 10:55:31,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:31,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2250 transitions. [2022-11-16 10:55:31,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 375.0) internal successors, (2250), 6 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states 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 10:55:31,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states 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 10:55:31,829 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states 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 10:55:31,829 INFO L175 Difference]: Start difference. First operand has 370 places, 367 transitions, 809 flow. Second operand 6 states and 2250 transitions. [2022-11-16 10:55:31,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 390 transitions, 1089 flow [2022-11-16 10:55:31,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 390 transitions, 1082 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 10:55:31,839 INFO L231 Difference]: Finished difference. Result has 370 places, 366 transitions, 808 flow [2022-11-16 10:55:31,840 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=808, PETRI_PLACES=370, PETRI_TRANSITIONS=366} [2022-11-16 10:55:31,840 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -117 predicate places. [2022-11-16 10:55:31,840 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 366 transitions, 808 flow [2022-11-16 10:55:31,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 367.0) internal successors, (2202), 6 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states 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 10:55:31,841 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:31,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:31,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 10:55:31,842 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:31,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:31,842 INFO L85 PathProgramCache]: Analyzing trace with hash 119167083, now seen corresponding path program 1 times [2022-11-16 10:55:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:31,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174149309] [2022-11-16 10:55:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:32,838 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 10:55:32,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174149309] [2022-11-16 10:55:32,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174149309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:32,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:32,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:55:32,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127003102] [2022-11-16 10:55:32,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:32,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:55:32,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:32,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:55:32,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:55:32,845 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 526 [2022-11-16 10:55:32,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 366 transitions, 808 flow. Second operand has 6 states, 6 states have (on average 368.0) internal successors, (2208), 6 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states 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 10:55:32,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:32,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 526 [2022-11-16 10:55:32,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:33,852 INFO L130 PetriNetUnfolder]: 1282/2557 cut-off events. [2022-11-16 10:55:33,852 INFO L131 PetriNetUnfolder]: For 2560/2560 co-relation queries the response was YES. [2022-11-16 10:55:33,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6311 conditions, 2557 events. 1282/2557 cut-off events. For 2560/2560 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 11591 event pairs, 202 based on Foata normal form. 0/2374 useless extension candidates. Maximal degree in co-relation 6238. Up to 1181 conditions per place. [2022-11-16 10:55:33,892 INFO L137 encePairwiseOnDemand]: 521/526 looper letters, 60 selfloop transitions, 4 changer transitions 0/377 dead transitions. [2022-11-16 10:55:33,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 377 transitions, 998 flow [2022-11-16 10:55:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:55:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 10:55:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2241 transitions. [2022-11-16 10:55:33,897 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7100760456273765 [2022-11-16 10:55:33,897 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2241 transitions. [2022-11-16 10:55:33,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2241 transitions. [2022-11-16 10:55:33,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:33,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2241 transitions. [2022-11-16 10:55:33,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 373.5) internal successors, (2241), 6 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states 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 10:55:33,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states 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 10:55:33,907 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 526.0) internal successors, (3682), 7 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states 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 10:55:33,907 INFO L175 Difference]: Start difference. First operand has 370 places, 366 transitions, 808 flow. Second operand 6 states and 2241 transitions. [2022-11-16 10:55:33,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 377 transitions, 998 flow [2022-11-16 10:55:33,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 377 transitions, 991 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 10:55:33,916 INFO L231 Difference]: Finished difference. Result has 370 places, 365 transitions, 807 flow [2022-11-16 10:55:33,916 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=807, PETRI_PLACES=370, PETRI_TRANSITIONS=365} [2022-11-16 10:55:33,917 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -117 predicate places. [2022-11-16 10:55:33,917 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 365 transitions, 807 flow [2022-11-16 10:55:33,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 368.0) internal successors, (2208), 6 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states 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 10:55:33,918 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:33,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:33,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-16 10:55:33,919 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 227 more)] === [2022-11-16 10:55:33,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1494121522, now seen corresponding path program 1 times [2022-11-16 10:55:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:33,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493838661] [2022-11-16 10:55:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,006 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 10:55:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:34,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493838661] [2022-11-16 10:55:34,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493838661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:34,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:34,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:55:34,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244911366] [2022-11-16 10:55:34,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:34,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:55:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:34,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:55:34,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:55:34,010 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 526 [2022-11-16 10:55:34,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 365 transitions, 807 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:34,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:34,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 526 [2022-11-16 10:55:34,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:34,409 INFO L130 PetriNetUnfolder]: 244/1547 cut-off events. [2022-11-16 10:55:34,409 INFO L131 PetriNetUnfolder]: For 560/568 co-relation queries the response was YES. [2022-11-16 10:55:34,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2486 conditions, 1547 events. 244/1547 cut-off events. For 560/568 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8855 event pairs, 42 based on Foata normal form. 64/1442 useless extension candidates. Maximal degree in co-relation 2413. Up to 346 conditions per place. [2022-11-16 10:55:34,423 INFO L137 encePairwiseOnDemand]: 524/526 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2022-11-16 10:55:34,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 364 transitions, 847 flow [2022-11-16 10:55:34,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:55:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:55:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1218 transitions. [2022-11-16 10:55:34,426 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7718631178707225 [2022-11-16 10:55:34,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1218 transitions. [2022-11-16 10:55:34,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1218 transitions. [2022-11-16 10:55:34,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:34,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1218 transitions. [2022-11-16 10:55:34,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.0) internal successors, (1218), 3 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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 10:55:34,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:34,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 526.0) internal successors, (2104), 4 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states 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 10:55:34,432 INFO L175 Difference]: Start difference. First operand has 370 places, 365 transitions, 807 flow. Second operand 3 states and 1218 transitions. [2022-11-16 10:55:34,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 364 transitions, 847 flow [2022-11-16 10:55:34,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 364 transitions, 840 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 10:55:34,438 INFO L231 Difference]: Finished difference. Result has 367 places, 0 transitions, 0 flow [2022-11-16 10:55:34,438 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=526, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=367, PETRI_TRANSITIONS=0} [2022-11-16 10:55:34,439 INFO L288 CegarLoopForPetriNet]: 487 programPoint places, -120 predicate places. [2022-11-16 10:55:34,439 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 0 transitions, 0 flow [2022-11-16 10:55:34,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:55:34,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (230 of 231 remaining) [2022-11-16 10:55:34,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (229 of 231 remaining) [2022-11-16 10:55:34,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (228 of 231 remaining) [2022-11-16 10:55:34,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (227 of 231 remaining) [2022-11-16 10:55:34,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (226 of 231 remaining) [2022-11-16 10:55:34,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (225 of 231 remaining) [2022-11-16 10:55:34,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (224 of 231 remaining) [2022-11-16 10:55:34,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (223 of 231 remaining) [2022-11-16 10:55:34,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (222 of 231 remaining) [2022-11-16 10:55:34,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (221 of 231 remaining) [2022-11-16 10:55:34,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (220 of 231 remaining) [2022-11-16 10:55:34,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (219 of 231 remaining) [2022-11-16 10:55:34,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (218 of 231 remaining) [2022-11-16 10:55:34,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (217 of 231 remaining) [2022-11-16 10:55:34,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (216 of 231 remaining) [2022-11-16 10:55:34,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (215 of 231 remaining) [2022-11-16 10:55:34,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (214 of 231 remaining) [2022-11-16 10:55:34,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (213 of 231 remaining) [2022-11-16 10:55:34,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (212 of 231 remaining) [2022-11-16 10:55:34,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (211 of 231 remaining) [2022-11-16 10:55:34,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (210 of 231 remaining) [2022-11-16 10:55:34,447 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (209 of 231 remaining) [2022-11-16 10:55:34,447 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (208 of 231 remaining) [2022-11-16 10:55:34,447 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (207 of 231 remaining) [2022-11-16 10:55:34,447 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (206 of 231 remaining) [2022-11-16 10:55:34,447 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (205 of 231 remaining) [2022-11-16 10:55:34,448 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (204 of 231 remaining) [2022-11-16 10:55:34,448 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (203 of 231 remaining) [2022-11-16 10:55:34,448 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (202 of 231 remaining) [2022-11-16 10:55:34,448 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (201 of 231 remaining) [2022-11-16 10:55:34,448 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (200 of 231 remaining) [2022-11-16 10:55:34,448 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (199 of 231 remaining) [2022-11-16 10:55:34,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (198 of 231 remaining) [2022-11-16 10:55:34,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (197 of 231 remaining) [2022-11-16 10:55:34,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (196 of 231 remaining) [2022-11-16 10:55:34,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (195 of 231 remaining) [2022-11-16 10:55:34,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (194 of 231 remaining) [2022-11-16 10:55:34,450 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (193 of 231 remaining) [2022-11-16 10:55:34,450 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (192 of 231 remaining) [2022-11-16 10:55:34,450 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (191 of 231 remaining) [2022-11-16 10:55:34,450 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (190 of 231 remaining) [2022-11-16 10:55:34,450 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (189 of 231 remaining) [2022-11-16 10:55:34,450 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (188 of 231 remaining) [2022-11-16 10:55:34,451 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (187 of 231 remaining) [2022-11-16 10:55:34,451 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (186 of 231 remaining) [2022-11-16 10:55:34,451 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (185 of 231 remaining) [2022-11-16 10:55:34,451 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (184 of 231 remaining) [2022-11-16 10:55:34,451 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (183 of 231 remaining) [2022-11-16 10:55:34,452 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (182 of 231 remaining) [2022-11-16 10:55:34,452 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (181 of 231 remaining) [2022-11-16 10:55:34,452 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (180 of 231 remaining) [2022-11-16 10:55:34,452 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (179 of 231 remaining) [2022-11-16 10:55:34,452 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (178 of 231 remaining) [2022-11-16 10:55:34,452 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (177 of 231 remaining) [2022-11-16 10:55:34,453 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (176 of 231 remaining) [2022-11-16 10:55:34,453 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (175 of 231 remaining) [2022-11-16 10:55:34,453 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (174 of 231 remaining) [2022-11-16 10:55:34,453 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (173 of 231 remaining) [2022-11-16 10:55:34,453 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (172 of 231 remaining) [2022-11-16 10:55:34,453 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (171 of 231 remaining) [2022-11-16 10:55:34,454 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (170 of 231 remaining) [2022-11-16 10:55:34,454 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (169 of 231 remaining) [2022-11-16 10:55:34,454 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (168 of 231 remaining) [2022-11-16 10:55:34,454 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (167 of 231 remaining) [2022-11-16 10:55:34,454 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (166 of 231 remaining) [2022-11-16 10:55:34,455 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (165 of 231 remaining) [2022-11-16 10:55:34,455 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (164 of 231 remaining) [2022-11-16 10:55:34,455 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (163 of 231 remaining) [2022-11-16 10:55:34,455 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (162 of 231 remaining) [2022-11-16 10:55:34,455 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (161 of 231 remaining) [2022-11-16 10:55:34,455 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (160 of 231 remaining) [2022-11-16 10:55:34,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (159 of 231 remaining) [2022-11-16 10:55:34,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (158 of 231 remaining) [2022-11-16 10:55:34,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (157 of 231 remaining) [2022-11-16 10:55:34,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (156 of 231 remaining) [2022-11-16 10:55:34,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (155 of 231 remaining) [2022-11-16 10:55:34,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (154 of 231 remaining) [2022-11-16 10:55:34,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (153 of 231 remaining) [2022-11-16 10:55:34,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (152 of 231 remaining) [2022-11-16 10:55:34,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (151 of 231 remaining) [2022-11-16 10:55:34,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (150 of 231 remaining) [2022-11-16 10:55:34,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (149 of 231 remaining) [2022-11-16 10:55:34,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (148 of 231 remaining) [2022-11-16 10:55:34,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (147 of 231 remaining) [2022-11-16 10:55:34,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (146 of 231 remaining) [2022-11-16 10:55:34,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (145 of 231 remaining) [2022-11-16 10:55:34,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (144 of 231 remaining) [2022-11-16 10:55:34,459 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (143 of 231 remaining) [2022-11-16 10:55:34,459 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (142 of 231 remaining) [2022-11-16 10:55:34,459 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (141 of 231 remaining) [2022-11-16 10:55:34,459 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (140 of 231 remaining) [2022-11-16 10:55:34,459 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (139 of 231 remaining) [2022-11-16 10:55:34,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (138 of 231 remaining) [2022-11-16 10:55:34,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (137 of 231 remaining) [2022-11-16 10:55:34,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (136 of 231 remaining) [2022-11-16 10:55:34,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (135 of 231 remaining) [2022-11-16 10:55:34,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (134 of 231 remaining) [2022-11-16 10:55:34,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (133 of 231 remaining) [2022-11-16 10:55:34,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (132 of 231 remaining) [2022-11-16 10:55:34,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (131 of 231 remaining) [2022-11-16 10:55:34,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (130 of 231 remaining) [2022-11-16 10:55:34,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (129 of 231 remaining) [2022-11-16 10:55:34,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (128 of 231 remaining) [2022-11-16 10:55:34,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (127 of 231 remaining) [2022-11-16 10:55:34,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (126 of 231 remaining) [2022-11-16 10:55:34,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (125 of 231 remaining) [2022-11-16 10:55:34,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (124 of 231 remaining) [2022-11-16 10:55:34,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (123 of 231 remaining) [2022-11-16 10:55:34,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (122 of 231 remaining) [2022-11-16 10:55:34,463 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (121 of 231 remaining) [2022-11-16 10:55:34,463 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (120 of 231 remaining) [2022-11-16 10:55:34,463 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (119 of 231 remaining) [2022-11-16 10:55:34,463 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (118 of 231 remaining) [2022-11-16 10:55:34,463 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (117 of 231 remaining) [2022-11-16 10:55:34,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (116 of 231 remaining) [2022-11-16 10:55:34,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (115 of 231 remaining) [2022-11-16 10:55:34,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (114 of 231 remaining) [2022-11-16 10:55:34,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (113 of 231 remaining) [2022-11-16 10:55:34,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (112 of 231 remaining) [2022-11-16 10:55:34,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (111 of 231 remaining) [2022-11-16 10:55:34,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (110 of 231 remaining) [2022-11-16 10:55:34,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (109 of 231 remaining) [2022-11-16 10:55:34,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (108 of 231 remaining) [2022-11-16 10:55:34,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (107 of 231 remaining) [2022-11-16 10:55:34,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (106 of 231 remaining) [2022-11-16 10:55:34,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (105 of 231 remaining) [2022-11-16 10:55:34,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (104 of 231 remaining) [2022-11-16 10:55:34,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (103 of 231 remaining) [2022-11-16 10:55:34,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 231 remaining) [2022-11-16 10:55:34,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 231 remaining) [2022-11-16 10:55:34,466 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 231 remaining) [2022-11-16 10:55:34,467 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (99 of 231 remaining) [2022-11-16 10:55:34,467 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (98 of 231 remaining) [2022-11-16 10:55:34,467 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (97 of 231 remaining) [2022-11-16 10:55:34,467 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (96 of 231 remaining) [2022-11-16 10:55:34,467 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (95 of 231 remaining) [2022-11-16 10:55:34,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (94 of 231 remaining) [2022-11-16 10:55:34,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (93 of 231 remaining) [2022-11-16 10:55:34,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (92 of 231 remaining) [2022-11-16 10:55:34,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (91 of 231 remaining) [2022-11-16 10:55:34,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (90 of 231 remaining) [2022-11-16 10:55:34,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (89 of 231 remaining) [2022-11-16 10:55:34,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (88 of 231 remaining) [2022-11-16 10:55:34,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (87 of 231 remaining) [2022-11-16 10:55:34,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (86 of 231 remaining) [2022-11-16 10:55:34,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (85 of 231 remaining) [2022-11-16 10:55:34,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (84 of 231 remaining) [2022-11-16 10:55:34,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (83 of 231 remaining) [2022-11-16 10:55:34,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (82 of 231 remaining) [2022-11-16 10:55:34,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (81 of 231 remaining) [2022-11-16 10:55:34,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (80 of 231 remaining) [2022-11-16 10:55:34,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (79 of 231 remaining) [2022-11-16 10:55:34,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (78 of 231 remaining) [2022-11-16 10:55:34,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (77 of 231 remaining) [2022-11-16 10:55:34,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (76 of 231 remaining) [2022-11-16 10:55:34,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (75 of 231 remaining) [2022-11-16 10:55:34,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (74 of 231 remaining) [2022-11-16 10:55:34,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (73 of 231 remaining) [2022-11-16 10:55:34,472 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (72 of 231 remaining) [2022-11-16 10:55:34,472 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (71 of 231 remaining) [2022-11-16 10:55:34,472 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (70 of 231 remaining) [2022-11-16 10:55:34,472 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (69 of 231 remaining) [2022-11-16 10:55:34,472 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (68 of 231 remaining) [2022-11-16 10:55:34,473 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (67 of 231 remaining) [2022-11-16 10:55:34,473 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (66 of 231 remaining) [2022-11-16 10:55:34,473 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (65 of 231 remaining) [2022-11-16 10:55:34,473 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (64 of 231 remaining) [2022-11-16 10:55:34,473 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (63 of 231 remaining) [2022-11-16 10:55:34,473 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (62 of 231 remaining) [2022-11-16 10:55:34,474 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (61 of 231 remaining) [2022-11-16 10:55:34,474 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (60 of 231 remaining) [2022-11-16 10:55:34,474 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (59 of 231 remaining) [2022-11-16 10:55:34,474 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (58 of 231 remaining) [2022-11-16 10:55:34,474 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (57 of 231 remaining) [2022-11-16 10:55:34,475 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (56 of 231 remaining) [2022-11-16 10:55:34,475 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (55 of 231 remaining) [2022-11-16 10:55:34,475 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (54 of 231 remaining) [2022-11-16 10:55:34,475 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (53 of 231 remaining) [2022-11-16 10:55:34,475 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (52 of 231 remaining) [2022-11-16 10:55:34,475 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (51 of 231 remaining) [2022-11-16 10:55:34,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (50 of 231 remaining) [2022-11-16 10:55:34,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (49 of 231 remaining) [2022-11-16 10:55:34,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (48 of 231 remaining) [2022-11-16 10:55:34,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (47 of 231 remaining) [2022-11-16 10:55:34,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (46 of 231 remaining) [2022-11-16 10:55:34,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (45 of 231 remaining) [2022-11-16 10:55:34,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (44 of 231 remaining) [2022-11-16 10:55:34,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (43 of 231 remaining) [2022-11-16 10:55:34,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (42 of 231 remaining) [2022-11-16 10:55:34,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (41 of 231 remaining) [2022-11-16 10:55:34,477 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (40 of 231 remaining) [2022-11-16 10:55:34,478 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (39 of 231 remaining) [2022-11-16 10:55:34,478 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (38 of 231 remaining) [2022-11-16 10:55:34,478 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (37 of 231 remaining) [2022-11-16 10:55:34,478 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (36 of 231 remaining) [2022-11-16 10:55:34,478 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (35 of 231 remaining) [2022-11-16 10:55:34,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (34 of 231 remaining) [2022-11-16 10:55:34,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (33 of 231 remaining) [2022-11-16 10:55:34,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (32 of 231 remaining) [2022-11-16 10:55:34,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (31 of 231 remaining) [2022-11-16 10:55:34,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (30 of 231 remaining) [2022-11-16 10:55:34,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (29 of 231 remaining) [2022-11-16 10:55:34,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (28 of 231 remaining) [2022-11-16 10:55:34,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (27 of 231 remaining) [2022-11-16 10:55:34,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (26 of 231 remaining) [2022-11-16 10:55:34,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (25 of 231 remaining) [2022-11-16 10:55:34,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (24 of 231 remaining) [2022-11-16 10:55:34,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (23 of 231 remaining) [2022-11-16 10:55:34,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (22 of 231 remaining) [2022-11-16 10:55:34,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (21 of 231 remaining) [2022-11-16 10:55:34,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (20 of 231 remaining) [2022-11-16 10:55:34,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (19 of 231 remaining) [2022-11-16 10:55:34,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (18 of 231 remaining) [2022-11-16 10:55:34,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (17 of 231 remaining) [2022-11-16 10:55:34,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (16 of 231 remaining) [2022-11-16 10:55:34,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (15 of 231 remaining) [2022-11-16 10:55:34,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (14 of 231 remaining) [2022-11-16 10:55:34,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (13 of 231 remaining) [2022-11-16 10:55:34,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 231 remaining) [2022-11-16 10:55:34,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (11 of 231 remaining) [2022-11-16 10:55:34,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (10 of 231 remaining) [2022-11-16 10:55:34,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (9 of 231 remaining) [2022-11-16 10:55:34,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (8 of 231 remaining) [2022-11-16 10:55:34,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (7 of 231 remaining) [2022-11-16 10:55:34,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (6 of 231 remaining) [2022-11-16 10:55:34,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (5 of 231 remaining) [2022-11-16 10:55:34,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (4 of 231 remaining) [2022-11-16 10:55:34,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (3 of 231 remaining) [2022-11-16 10:55:34,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (2 of 231 remaining) [2022-11-16 10:55:34,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (1 of 231 remaining) [2022-11-16 10:55:34,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (0 of 231 remaining) [2022-11-16 10:55:34,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-16 10:55:34,485 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, 1, 1, 1] [2022-11-16 10:55:34,492 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 10:55:34,492 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 10:55:34,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:55:34 BasicIcfg [2022-11-16 10:55:34,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 10:55:34,498 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 10:55:34,498 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 10:55:34,498 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 10:55:34,499 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:55:15" (3/4) ... [2022-11-16 10:55:34,501 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 10:55:34,505 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-16 10:55:34,506 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-16 10:55:34,506 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-16 10:55:34,513 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-11-16 10:55:34,513 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-16 10:55:34,514 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 10:55:34,514 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 10:55:34,586 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 10:55:34,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 10:55:34,587 INFO L158 Benchmark]: Toolchain (without parser) took 21407.92ms. Allocated memory was 107.0MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 62.9MB in the beginning and 436.0MB in the end (delta: -373.2MB). Peak memory consumption was 656.0MB. Max. memory is 16.1GB. [2022-11-16 10:55:34,588 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 107.0MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:55:34,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.25ms. Allocated memory is still 107.0MB. Free memory was 62.7MB in the beginning and 76.5MB in the end (delta: -13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 10:55:34,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.80ms. Allocated memory is still 107.0MB. Free memory was 76.5MB in the beginning and 71.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 10:55:34,589 INFO L158 Benchmark]: Boogie Preprocessor took 73.33ms. Allocated memory is still 107.0MB. Free memory was 71.7MB in the beginning and 67.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 10:55:34,589 INFO L158 Benchmark]: RCFGBuilder took 2040.10ms. Allocated memory was 107.0MB in the beginning and 132.1MB in the end (delta: 25.2MB). Free memory was 67.2MB in the beginning and 66.0MB in the end (delta: 1.2MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2022-11-16 10:55:34,589 INFO L158 Benchmark]: TraceAbstraction took 18589.04ms. Allocated memory was 132.1MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 64.8MB in the beginning and 442.3MB in the end (delta: -377.5MB). Peak memory consumption was 625.9MB. Max. memory is 16.1GB. [2022-11-16 10:55:34,590 INFO L158 Benchmark]: Witness Printer took 89.04ms. Allocated memory is still 1.1GB. Free memory was 442.3MB in the beginning and 436.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 10:55:34,592 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.26ms. Allocated memory is still 107.0MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.25ms. Allocated memory is still 107.0MB. Free memory was 62.7MB in the beginning and 76.5MB in the end (delta: -13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.80ms. Allocated memory is still 107.0MB. Free memory was 76.5MB in the beginning and 71.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.33ms. Allocated memory is still 107.0MB. Free memory was 71.7MB in the beginning and 67.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2040.10ms. Allocated memory was 107.0MB in the beginning and 132.1MB in the end (delta: 25.2MB). Free memory was 67.2MB in the beginning and 66.0MB in the end (delta: 1.2MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18589.04ms. Allocated memory was 132.1MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 64.8MB in the beginning and 442.3MB in the end (delta: -377.5MB). Peak memory consumption was 625.9MB. Max. memory is 16.1GB. * Witness Printer took 89.04ms. Allocated memory is still 1.1GB. Free memory was 442.3MB in the beginning and 436.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: 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: 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: 98]: 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: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: 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: 112]: 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: 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: 113]: 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: 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: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 653 locations, 231 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.3s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 241 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1265 IncrementalHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 241 mSDtfsCounter, 1265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1024occurred in iteration=0, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 4275 NumberOfCodeBlocks, 4275 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4246 ConstructedInterpolants, 0 QuantifiedInterpolants, 4654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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 128 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-16 10:55:34,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5881ae6-a56b-4453-824c-3d80a0a703f7/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