./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54b834084fe1393c06cef2b14fb31f788537bd44a8744d5b4241cffc72e1d744 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:55:07,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:55:07,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:55:07,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:55:07,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:55:07,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:55:07,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:55:07,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:55:07,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:55:07,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:55:07,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:55:07,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:55:07,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:55:07,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:55:07,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:55:07,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:55:07,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:55:07,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:55:07,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:55:07,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:55:07,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:55:07,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:55:07,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:55:07,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:55:07,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:55:07,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:55:07,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:55:07,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:55:07,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:55:07,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:55:07,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:55:07,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:55:07,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:55:07,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:55:07,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:55:07,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:55:07,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:55:07,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:55:07,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:55:07,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:55:07,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:55:07,213 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:55:07,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:55:07,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:55:07,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:55:07,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:55:07,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:55:07,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:55:07,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:55:07,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:55:07,254 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:55:07,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:55:07,255 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:55:07,255 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:55:07,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:55:07,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:55:07,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:55:07,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:55:07,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:55:07,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:55:07,257 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:55:07,257 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:55:07,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:55:07,257 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:55:07,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:55:07,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:55:07,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:55:07,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:55:07,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:55:07,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:55:07,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:55:07,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:55:07,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:55:07,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:55:07,260 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:55:07,260 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:55:07,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:55:07,261 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_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54b834084fe1393c06cef2b14fb31f788537bd44a8744d5b4241cffc72e1d744 [2022-11-02 20:55:07,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:55:07,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:55:07,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:55:07,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:55:07,613 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:55:07,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2022-11-02 20:55:07,690 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/data/88fa50991/8554ce00e31c43c397b6f09c1c7754e8/FLAG03c3bc83a [2022-11-02 20:55:08,279 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:55:08,279 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2022-11-02 20:55:08,287 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/data/88fa50991/8554ce00e31c43c397b6f09c1c7754e8/FLAG03c3bc83a [2022-11-02 20:55:08,598 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/data/88fa50991/8554ce00e31c43c397b6f09c1c7754e8 [2022-11-02 20:55:08,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:55:08,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:55:08,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:55:08,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:55:08,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:55:08,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:08,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e24c993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08, skipping insertion in model container [2022-11-02 20:55:08,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:08,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:55:08,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:55:08,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c[3642,3655] [2022-11-02 20:55:08,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:55:08,888 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:55:08,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c[3642,3655] [2022-11-02 20:55:08,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:55:08,948 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:55:08,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08 WrapperNode [2022-11-02 20:55:08,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:55:08,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:55:08,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:55:08,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:55:08,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:08,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:09,007 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 538 [2022-11-02 20:55:09,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:55:09,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:55:09,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:55:09,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:55:09,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:09,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:09,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:09,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:09,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:09,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:09,048 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:09,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:09,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:55:09,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:55:09,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:55:09,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:55:09,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (1/1) ... [2022-11-02 20:55:09,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:55:09,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:09,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:09,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:55:09,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:55:09,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:55:09,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:55:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:55:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:55:09,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:55:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:55:09,167 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:55:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:55:09,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:55:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:55:09,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:55:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:55:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:55:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:55:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:55:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:55:09,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:55:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:55:09,172 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:55:09,378 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:55:09,380 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:55:10,252 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:55:10,606 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:55:10,606 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 20:55:10,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:10 BoogieIcfgContainer [2022-11-02 20:55:10,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:55:10,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:55:10,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:55:10,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:55:10,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:55:08" (1/3) ... [2022-11-02 20:55:10,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dfeb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:55:10, skipping insertion in model container [2022-11-02 20:55:10,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:08" (2/3) ... [2022-11-02 20:55:10,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dfeb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:55:10, skipping insertion in model container [2022-11-02 20:55:10,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:10" (3/3) ... [2022-11-02 20:55:10,621 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2022-11-02 20:55:10,632 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:55:10,642 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:55:10,643 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2022-11-02 20:55:10,643 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:55:10,791 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:55:10,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 394 places, 401 transitions, 834 flow [2022-11-02 20:55:11,046 INFO L130 PetriNetUnfolder]: 20/397 cut-off events. [2022-11-02 20:55:11,047 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:55:11,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 397 events. 20/397 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 508 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 295. Up to 2 conditions per place. [2022-11-02 20:55:11,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 394 places, 401 transitions, 834 flow [2022-11-02 20:55:11,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 366 places, 371 transitions, 766 flow [2022-11-02 20:55:11,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:55:11,092 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;@2bfb8dd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:55:11,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 122 error locations. [2022-11-02 20:55:11,104 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-11-02 20:55:11,104 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:55:11,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:11,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:11,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:11,113 INFO L85 PathProgramCache]: Analyzing trace with hash -307695467, now seen corresponding path program 1 times [2022-11-02 20:55:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:11,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356531960] [2022-11-02 20:55:11,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:11,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:11,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:11,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356531960] [2022-11-02 20:55:11,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356531960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:11,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:11,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:11,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691666505] [2022-11-02 20:55:11,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:11,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:11,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:11,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:11,502 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 401 [2022-11-02 20:55:11,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 371 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:11,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:11,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 401 [2022-11-02 20:55:11,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:11,826 INFO L130 PetriNetUnfolder]: 122/463 cut-off events. [2022-11-02 20:55:11,826 INFO L131 PetriNetUnfolder]: For 68/78 co-relation queries the response was YES. [2022-11-02 20:55:11,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 463 events. 122/463 cut-off events. For 68/78 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 762 event pairs, 51 based on Foata normal form. 71/477 useless extension candidates. Maximal degree in co-relation 363. Up to 175 conditions per place. [2022-11-02 20:55:11,833 INFO L137 encePairwiseOnDemand]: 345/401 looper letters, 28 selfloop transitions, 2 changer transitions 4/317 dead transitions. [2022-11-02 20:55:11,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 317 transitions, 718 flow [2022-11-02 20:55:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1029 transitions. [2022-11-02 20:55:11,859 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8553615960099751 [2022-11-02 20:55:11,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1029 transitions. [2022-11-02 20:55:11,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1029 transitions. [2022-11-02 20:55:11,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:11,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1029 transitions. [2022-11-02 20:55:11,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:11,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:11,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:11,890 INFO L175 Difference]: Start difference. First operand has 366 places, 371 transitions, 766 flow. Second operand 3 states and 1029 transitions. [2022-11-02 20:55:11,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 317 transitions, 718 flow [2022-11-02 20:55:11,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 317 transitions, 702 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:55:11,911 INFO L231 Difference]: Finished difference. Result has 315 places, 313 transitions, 638 flow [2022-11-02 20:55:11,913 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=315, PETRI_TRANSITIONS=313} [2022-11-02 20:55:11,917 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -51 predicate places. [2022-11-02 20:55:11,918 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 313 transitions, 638 flow [2022-11-02 20:55:11,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:11,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:11,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:11,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:55:11,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:11,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1960065932, now seen corresponding path program 1 times [2022-11-02 20:55:11,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:11,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87680034] [2022-11-02 20:55:11,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:11,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:12,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:12,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87680034] [2022-11-02 20:55:12,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87680034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:12,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:12,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752728042] [2022-11-02 20:55:12,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:12,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:12,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:12,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:12,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:12,040 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 401 [2022-11-02 20:55:12,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 313 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:12,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 401 [2022-11-02 20:55:12,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:12,231 INFO L130 PetriNetUnfolder]: 122/458 cut-off events. [2022-11-02 20:55:12,231 INFO L131 PetriNetUnfolder]: For 15/25 co-relation queries the response was YES. [2022-11-02 20:55:12,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 458 events. 122/458 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 754 event pairs, 51 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 612. Up to 172 conditions per place. [2022-11-02 20:55:12,235 INFO L137 encePairwiseOnDemand]: 398/401 looper letters, 25 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2022-11-02 20:55:12,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 312 transitions, 690 flow [2022-11-02 20:55:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2022-11-02 20:55:12,239 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8162926018287614 [2022-11-02 20:55:12,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2022-11-02 20:55:12,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2022-11-02 20:55:12,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:12,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2022-11-02 20:55:12,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,247 INFO L175 Difference]: Start difference. First operand has 315 places, 313 transitions, 638 flow. Second operand 3 states and 982 transitions. [2022-11-02 20:55:12,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 312 transitions, 690 flow [2022-11-02 20:55:12,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 312 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:12,254 INFO L231 Difference]: Finished difference. Result has 310 places, 312 transitions, 636 flow [2022-11-02 20:55:12,255 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=310, PETRI_TRANSITIONS=312} [2022-11-02 20:55:12,256 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -56 predicate places. [2022-11-02 20:55:12,256 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 312 transitions, 636 flow [2022-11-02 20:55:12,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:12,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:12,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:55:12,258 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:12,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:12,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1683318428, now seen corresponding path program 1 times [2022-11-02 20:55:12,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:12,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565727879] [2022-11-02 20:55:12,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:12,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:12,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:12,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565727879] [2022-11-02 20:55:12,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565727879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:12,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:12,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:12,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010409016] [2022-11-02 20:55:12,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:12,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:12,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:12,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:12,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:12,317 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 401 [2022-11-02 20:55:12,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 312 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:12,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 401 [2022-11-02 20:55:12,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:12,495 INFO L130 PetriNetUnfolder]: 122/457 cut-off events. [2022-11-02 20:55:12,496 INFO L131 PetriNetUnfolder]: For 15/25 co-relation queries the response was YES. [2022-11-02 20:55:12,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 457 events. 122/457 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 744 event pairs, 51 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 598. Up to 166 conditions per place. [2022-11-02 20:55:12,499 INFO L137 encePairwiseOnDemand]: 398/401 looper letters, 19 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2022-11-02 20:55:12,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 311 transitions, 676 flow [2022-11-02 20:55:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2022-11-02 20:55:12,503 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8262676641729011 [2022-11-02 20:55:12,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2022-11-02 20:55:12,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2022-11-02 20:55:12,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:12,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2022-11-02 20:55:12,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,511 INFO L175 Difference]: Start difference. First operand has 310 places, 312 transitions, 636 flow. Second operand 3 states and 994 transitions. [2022-11-02 20:55:12,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 311 transitions, 676 flow [2022-11-02 20:55:12,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 311 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:12,517 INFO L231 Difference]: Finished difference. Result has 309 places, 311 transitions, 634 flow [2022-11-02 20:55:12,518 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=309, PETRI_TRANSITIONS=311} [2022-11-02 20:55:12,519 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -57 predicate places. [2022-11-02 20:55:12,519 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 311 transitions, 634 flow [2022-11-02 20:55:12,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:12,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:12,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:55:12,521 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash 208098549, now seen corresponding path program 1 times [2022-11-02 20:55:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:12,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294774139] [2022-11-02 20:55:12,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:12,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:12,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:12,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294774139] [2022-11-02 20:55:12,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294774139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:12,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:12,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709598805] [2022-11-02 20:55:12,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:12,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:12,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:12,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:12,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:12,575 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 401 [2022-11-02 20:55:12,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 311 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:12,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 401 [2022-11-02 20:55:12,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:12,720 INFO L130 PetriNetUnfolder]: 122/456 cut-off events. [2022-11-02 20:55:12,720 INFO L131 PetriNetUnfolder]: For 15/25 co-relation queries the response was YES. [2022-11-02 20:55:12,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 456 events. 122/456 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 750 event pairs, 51 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 590. Up to 166 conditions per place. [2022-11-02 20:55:12,724 INFO L137 encePairwiseOnDemand]: 398/401 looper letters, 19 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2022-11-02 20:55:12,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 310 transitions, 674 flow [2022-11-02 20:55:12,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2022-11-02 20:55:12,727 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8262676641729011 [2022-11-02 20:55:12,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2022-11-02 20:55:12,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2022-11-02 20:55:12,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:12,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2022-11-02 20:55:12,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,735 INFO L175 Difference]: Start difference. First operand has 309 places, 311 transitions, 634 flow. Second operand 3 states and 994 transitions. [2022-11-02 20:55:12,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 310 transitions, 674 flow [2022-11-02 20:55:12,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 310 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:12,742 INFO L231 Difference]: Finished difference. Result has 308 places, 310 transitions, 632 flow [2022-11-02 20:55:12,742 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=308, PETRI_TRANSITIONS=310} [2022-11-02 20:55:12,743 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -58 predicate places. [2022-11-02 20:55:12,743 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 310 transitions, 632 flow [2022-11-02 20:55:12,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:12,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:12,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:55:12,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:12,746 INFO L85 PathProgramCache]: Analyzing trace with hash -30678052, now seen corresponding path program 1 times [2022-11-02 20:55:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:12,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608854130] [2022-11-02 20:55:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,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-02 20:55:12,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:12,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608854130] [2022-11-02 20:55:12,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608854130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:12,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:12,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:12,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102839508] [2022-11-02 20:55:12,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:12,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:12,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:12,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:12,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:12,797 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 401 [2022-11-02 20:55:12,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 310 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:12,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 401 [2022-11-02 20:55:12,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:12,960 INFO L130 PetriNetUnfolder]: 122/455 cut-off events. [2022-11-02 20:55:12,960 INFO L131 PetriNetUnfolder]: For 15/25 co-relation queries the response was YES. [2022-11-02 20:55:12,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 455 events. 122/455 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 749 event pairs, 51 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 582. Up to 166 conditions per place. [2022-11-02 20:55:12,964 INFO L137 encePairwiseOnDemand]: 398/401 looper letters, 19 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2022-11-02 20:55:12,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 309 transitions, 672 flow [2022-11-02 20:55:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2022-11-02 20:55:12,967 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8262676641729011 [2022-11-02 20:55:12,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2022-11-02 20:55:12,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2022-11-02 20:55:12,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:12,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2022-11-02 20:55:12,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,975 INFO L175 Difference]: Start difference. First operand has 308 places, 310 transitions, 632 flow. Second operand 3 states and 994 transitions. [2022-11-02 20:55:12,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 309 transitions, 672 flow [2022-11-02 20:55:12,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 309 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:12,982 INFO L231 Difference]: Finished difference. Result has 307 places, 309 transitions, 630 flow [2022-11-02 20:55:12,983 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=307, PETRI_TRANSITIONS=309} [2022-11-02 20:55:12,983 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -59 predicate places. [2022-11-02 20:55:12,984 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 309 transitions, 630 flow [2022-11-02 20:55:12,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:12,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:12,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:55:12,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:12,986 INFO L85 PathProgramCache]: Analyzing trace with hash 668820700, now seen corresponding path program 1 times [2022-11-02 20:55:12,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:12,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471068893] [2022-11-02 20:55:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:12,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:13,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:13,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471068893] [2022-11-02 20:55:13,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471068893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:13,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:13,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:13,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099379515] [2022-11-02 20:55:13,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:13,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:13,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:13,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:13,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:13,038 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 401 [2022-11-02 20:55:13,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 309 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:13,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 401 [2022-11-02 20:55:13,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:13,173 INFO L130 PetriNetUnfolder]: 122/454 cut-off events. [2022-11-02 20:55:13,173 INFO L131 PetriNetUnfolder]: For 15/25 co-relation queries the response was YES. [2022-11-02 20:55:13,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 454 events. 122/454 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 753 event pairs, 51 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 574. Up to 166 conditions per place. [2022-11-02 20:55:13,177 INFO L137 encePairwiseOnDemand]: 398/401 looper letters, 19 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2022-11-02 20:55:13,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 308 transitions, 670 flow [2022-11-02 20:55:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2022-11-02 20:55:13,180 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8262676641729011 [2022-11-02 20:55:13,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2022-11-02 20:55:13,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2022-11-02 20:55:13,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:13,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2022-11-02 20:55:13,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,188 INFO L175 Difference]: Start difference. First operand has 307 places, 309 transitions, 630 flow. Second operand 3 states and 994 transitions. [2022-11-02 20:55:13,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 308 transitions, 670 flow [2022-11-02 20:55:13,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 308 transitions, 666 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:13,195 INFO L231 Difference]: Finished difference. Result has 306 places, 308 transitions, 628 flow [2022-11-02 20:55:13,196 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=306, PETRI_TRANSITIONS=308} [2022-11-02 20:55:13,196 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -60 predicate places. [2022-11-02 20:55:13,197 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 308 transitions, 628 flow [2022-11-02 20:55:13,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:13,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:13,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:55:13,198 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash 692037516, now seen corresponding path program 1 times [2022-11-02 20:55:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:13,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500619124] [2022-11-02 20:55:13,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:13,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:13,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:13,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500619124] [2022-11-02 20:55:13,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500619124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:13,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:13,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360330319] [2022-11-02 20:55:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:13,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:13,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:13,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:13,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:13,291 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 401 [2022-11-02 20:55:13,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 308 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:13,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 401 [2022-11-02 20:55:13,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:13,492 INFO L130 PetriNetUnfolder]: 122/453 cut-off events. [2022-11-02 20:55:13,492 INFO L131 PetriNetUnfolder]: For 15/25 co-relation queries the response was YES. [2022-11-02 20:55:13,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 453 events. 122/453 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 736 event pairs, 51 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 581. Up to 181 conditions per place. [2022-11-02 20:55:13,497 INFO L137 encePairwiseOnDemand]: 398/401 looper letters, 34 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2022-11-02 20:55:13,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 307 transitions, 698 flow [2022-11-02 20:55:13,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2022-11-02 20:55:13,502 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.801330008312552 [2022-11-02 20:55:13,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 964 transitions. [2022-11-02 20:55:13,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 964 transitions. [2022-11-02 20:55:13,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:13,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 964 transitions. [2022-11-02 20:55:13,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,511 INFO L175 Difference]: Start difference. First operand has 306 places, 308 transitions, 628 flow. Second operand 3 states and 964 transitions. [2022-11-02 20:55:13,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 307 transitions, 698 flow [2022-11-02 20:55:13,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 307 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:13,518 INFO L231 Difference]: Finished difference. Result has 305 places, 307 transitions, 626 flow [2022-11-02 20:55:13,519 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=305, PETRI_TRANSITIONS=307} [2022-11-02 20:55:13,520 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -61 predicate places. [2022-11-02 20:55:13,521 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 307 transitions, 626 flow [2022-11-02 20:55:13,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:13,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:13,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:55:13,522 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:13,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1769871603, now seen corresponding path program 1 times [2022-11-02 20:55:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:13,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037948849] [2022-11-02 20:55:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:13,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:13,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037948849] [2022-11-02 20:55:13,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037948849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:13,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:13,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:13,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243243290] [2022-11-02 20:55:13,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:13,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:13,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:13,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:13,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:13,625 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 401 [2022-11-02 20:55:13,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 307 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:13,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 401 [2022-11-02 20:55:13,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:13,771 INFO L130 PetriNetUnfolder]: 122/452 cut-off events. [2022-11-02 20:55:13,771 INFO L131 PetriNetUnfolder]: For 15/25 co-relation queries the response was YES. [2022-11-02 20:55:13,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 452 events. 122/452 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 737 event pairs, 51 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 563. Up to 171 conditions per place. [2022-11-02 20:55:13,775 INFO L137 encePairwiseOnDemand]: 398/401 looper letters, 24 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2022-11-02 20:55:13,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 306 transitions, 676 flow [2022-11-02 20:55:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 981 transitions. [2022-11-02 20:55:13,782 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8154613466334164 [2022-11-02 20:55:13,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 981 transitions. [2022-11-02 20:55:13,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 981 transitions. [2022-11-02 20:55:13,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:13,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 981 transitions. [2022-11-02 20:55:13,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,788 INFO L175 Difference]: Start difference. First operand has 305 places, 307 transitions, 626 flow. Second operand 3 states and 981 transitions. [2022-11-02 20:55:13,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 306 transitions, 676 flow [2022-11-02 20:55:13,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 306 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:13,795 INFO L231 Difference]: Finished difference. Result has 304 places, 306 transitions, 624 flow [2022-11-02 20:55:13,796 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=304, PETRI_TRANSITIONS=306} [2022-11-02 20:55:13,799 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -62 predicate places. [2022-11-02 20:55:13,799 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 306 transitions, 624 flow [2022-11-02 20:55:13,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:13,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:13,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:55:13,801 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1162922956, now seen corresponding path program 1 times [2022-11-02 20:55:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:13,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980897450] [2022-11-02 20:55:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:13,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:13,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980897450] [2022-11-02 20:55:13,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980897450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:13,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:13,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:13,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389200968] [2022-11-02 20:55:13,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:13,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:13,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:13,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:13,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:13,903 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 401 [2022-11-02 20:55:13,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 306 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:13,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:13,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 401 [2022-11-02 20:55:13,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:14,054 INFO L130 PetriNetUnfolder]: 122/451 cut-off events. [2022-11-02 20:55:14,054 INFO L131 PetriNetUnfolder]: For 15/25 co-relation queries the response was YES. [2022-11-02 20:55:14,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 451 events. 122/451 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 727 event pairs, 51 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 559. Up to 175 conditions per place. [2022-11-02 20:55:14,057 INFO L137 encePairwiseOnDemand]: 398/401 looper letters, 28 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2022-11-02 20:55:14,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 305 transitions, 682 flow [2022-11-02 20:55:14,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:14,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2022-11-02 20:55:14,060 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8113050706566916 [2022-11-02 20:55:14,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 976 transitions. [2022-11-02 20:55:14,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 976 transitions. [2022-11-02 20:55:14,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:14,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 976 transitions. [2022-11-02 20:55:14,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,067 INFO L175 Difference]: Start difference. First operand has 304 places, 306 transitions, 624 flow. Second operand 3 states and 976 transitions. [2022-11-02 20:55:14,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 305 transitions, 682 flow [2022-11-02 20:55:14,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 305 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:14,073 INFO L231 Difference]: Finished difference. Result has 303 places, 305 transitions, 622 flow [2022-11-02 20:55:14,074 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=303, PETRI_TRANSITIONS=305} [2022-11-02 20:55:14,074 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -63 predicate places. [2022-11-02 20:55:14,074 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 305 transitions, 622 flow [2022-11-02 20:55:14,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:14,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:14,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:55:14,076 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1382538127, now seen corresponding path program 1 times [2022-11-02 20:55:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:14,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426249958] [2022-11-02 20:55:14,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:14,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:14,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426249958] [2022-11-02 20:55:14,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426249958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:14,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:14,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:14,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385802499] [2022-11-02 20:55:14,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:14,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:14,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:14,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:14,120 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 401 [2022-11-02 20:55:14,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 305 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:14,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 401 [2022-11-02 20:55:14,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:14,249 INFO L130 PetriNetUnfolder]: 122/448 cut-off events. [2022-11-02 20:55:14,249 INFO L131 PetriNetUnfolder]: For 16/26 co-relation queries the response was YES. [2022-11-02 20:55:14,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 448 events. 122/448 cut-off events. For 16/26 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 733 event pairs, 51 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 542. Up to 168 conditions per place. [2022-11-02 20:55:14,252 INFO L137 encePairwiseOnDemand]: 397/401 looper letters, 23 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2022-11-02 20:55:14,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 302 transitions, 664 flow [2022-11-02 20:55:14,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 981 transitions. [2022-11-02 20:55:14,256 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8154613466334164 [2022-11-02 20:55:14,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 981 transitions. [2022-11-02 20:55:14,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 981 transitions. [2022-11-02 20:55:14,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:14,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 981 transitions. [2022-11-02 20:55:14,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,263 INFO L175 Difference]: Start difference. First operand has 303 places, 305 transitions, 622 flow. Second operand 3 states and 981 transitions. [2022-11-02 20:55:14,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 302 transitions, 664 flow [2022-11-02 20:55:14,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 302 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:14,269 INFO L231 Difference]: Finished difference. Result has 300 places, 302 transitions, 614 flow [2022-11-02 20:55:14,270 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=300, PETRI_TRANSITIONS=302} [2022-11-02 20:55:14,271 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -66 predicate places. [2022-11-02 20:55:14,272 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 302 transitions, 614 flow [2022-11-02 20:55:14,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:14,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:14,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:55:14,273 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:14,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash 166489063, now seen corresponding path program 1 times [2022-11-02 20:55:14,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:14,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062197209] [2022-11-02 20:55:14,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:14,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:14,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:14,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062197209] [2022-11-02 20:55:14,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062197209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:14,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:14,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:14,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071179734] [2022-11-02 20:55:14,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:14,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:14,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:14,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:14,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:14,365 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 401 [2022-11-02 20:55:14,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 302 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:14,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 401 [2022-11-02 20:55:14,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:14,502 INFO L130 PetriNetUnfolder]: 122/447 cut-off events. [2022-11-02 20:55:14,502 INFO L131 PetriNetUnfolder]: For 15/25 co-relation queries the response was YES. [2022-11-02 20:55:14,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 447 events. 122/447 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 734 event pairs, 51 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 538. Up to 166 conditions per place. [2022-11-02 20:55:14,506 INFO L137 encePairwiseOnDemand]: 398/401 looper letters, 19 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-11-02 20:55:14,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 301 transitions, 654 flow [2022-11-02 20:55:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2022-11-02 20:55:14,509 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8262676641729011 [2022-11-02 20:55:14,509 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2022-11-02 20:55:14,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2022-11-02 20:55:14,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:14,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2022-11-02 20:55:14,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,531 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,532 INFO L175 Difference]: Start difference. First operand has 300 places, 302 transitions, 614 flow. Second operand 3 states and 994 transitions. [2022-11-02 20:55:14,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 301 transitions, 654 flow [2022-11-02 20:55:14,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 301 transitions, 653 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:14,539 INFO L231 Difference]: Finished difference. Result has 300 places, 301 transitions, 615 flow [2022-11-02 20:55:14,540 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=300, PETRI_TRANSITIONS=301} [2022-11-02 20:55:14,541 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -66 predicate places. [2022-11-02 20:55:14,542 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 301 transitions, 615 flow [2022-11-02 20:55:14,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:14,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:14,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:55:14,543 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:14,544 INFO L85 PathProgramCache]: Analyzing trace with hash 576931780, now seen corresponding path program 1 times [2022-11-02 20:55:14,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:14,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515810225] [2022-11-02 20:55:14,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:14,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:15,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:15,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515810225] [2022-11-02 20:55:15,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515810225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:15,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:15,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:15,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181805660] [2022-11-02 20:55:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:15,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:15,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:15,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:15,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:15,204 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 401 [2022-11-02 20:55:15,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 301 transitions, 615 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:15,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:15,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 401 [2022-11-02 20:55:15,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:15,679 INFO L130 PetriNetUnfolder]: 710/1212 cut-off events. [2022-11-02 20:55:15,679 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:55:15,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2179 conditions, 1212 events. 710/1212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3289 event pairs, 345 based on Foata normal form. 0/1152 useless extension candidates. Maximal degree in co-relation 2085. Up to 942 conditions per place. [2022-11-02 20:55:15,690 INFO L137 encePairwiseOnDemand]: 395/401 looper letters, 51 selfloop transitions, 5 changer transitions 0/300 dead transitions. [2022-11-02 20:55:15,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 300 transitions, 725 flow [2022-11-02 20:55:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:55:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1791 transitions. [2022-11-02 20:55:15,694 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7443890274314214 [2022-11-02 20:55:15,694 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1791 transitions. [2022-11-02 20:55:15,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1791 transitions. [2022-11-02 20:55:15,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:15,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1791 transitions. [2022-11-02 20:55:15,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 298.5) internal successors, (1791), 6 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:15,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 401.0) internal successors, (2807), 7 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:15,705 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 401.0) internal successors, (2807), 7 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:15,705 INFO L175 Difference]: Start difference. First operand has 300 places, 301 transitions, 615 flow. Second operand 6 states and 1791 transitions. [2022-11-02 20:55:15,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 300 transitions, 725 flow [2022-11-02 20:55:15,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 300 transitions, 721 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:15,712 INFO L231 Difference]: Finished difference. Result has 302 places, 300 transitions, 619 flow [2022-11-02 20:55:15,712 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=619, PETRI_PLACES=302, PETRI_TRANSITIONS=300} [2022-11-02 20:55:15,713 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -64 predicate places. [2022-11-02 20:55:15,713 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 300 transitions, 619 flow [2022-11-02 20:55:15,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:15,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:15,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:15,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:55:15,715 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash 656519301, now seen corresponding path program 1 times [2022-11-02 20:55:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:15,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412154714] [2022-11-02 20:55:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:15,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:15,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412154714] [2022-11-02 20:55:15,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412154714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:15,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:15,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:15,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569505849] [2022-11-02 20:55:15,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:15,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:15,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:15,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:15,779 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 401 [2022-11-02 20:55:15,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 300 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:15,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:15,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 401 [2022-11-02 20:55:15,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:16,029 INFO L130 PetriNetUnfolder]: 240/823 cut-off events. [2022-11-02 20:55:16,030 INFO L131 PetriNetUnfolder]: For 30/60 co-relation queries the response was YES. [2022-11-02 20:55:16,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 823 events. 240/823 cut-off events. For 30/60 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2800 event pairs, 51 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1179. Up to 197 conditions per place. [2022-11-02 20:55:16,036 INFO L137 encePairwiseOnDemand]: 392/401 looper letters, 40 selfloop transitions, 4 changer transitions 0/311 dead transitions. [2022-11-02 20:55:16,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 311 transitions, 736 flow [2022-11-02 20:55:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2022-11-02 20:55:16,041 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8187863674147964 [2022-11-02 20:55:16,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 985 transitions. [2022-11-02 20:55:16,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 985 transitions. [2022-11-02 20:55:16,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:16,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 985 transitions. [2022-11-02 20:55:16,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,049 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,049 INFO L175 Difference]: Start difference. First operand has 302 places, 300 transitions, 619 flow. Second operand 3 states and 985 transitions. [2022-11-02 20:55:16,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 311 transitions, 736 flow [2022-11-02 20:55:16,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 311 transitions, 726 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:55:16,056 INFO L231 Difference]: Finished difference. Result has 296 places, 298 transitions, 627 flow [2022-11-02 20:55:16,057 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=296, PETRI_TRANSITIONS=298} [2022-11-02 20:55:16,058 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -70 predicate places. [2022-11-02 20:55:16,058 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 298 transitions, 627 flow [2022-11-02 20:55:16,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:16,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:16,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:55:16,059 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash -445102903, now seen corresponding path program 1 times [2022-11-02 20:55:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:16,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927787237] [2022-11-02 20:55:16,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:16,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:16,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:16,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927787237] [2022-11-02 20:55:16,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927787237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:16,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:16,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:16,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890862479] [2022-11-02 20:55:16,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:16,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:16,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:16,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:16,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:16,124 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 401 [2022-11-02 20:55:16,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 298 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:16,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 401 [2022-11-02 20:55:16,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:16,516 INFO L130 PetriNetUnfolder]: 456/1287 cut-off events. [2022-11-02 20:55:16,516 INFO L131 PetriNetUnfolder]: For 255/306 co-relation queries the response was YES. [2022-11-02 20:55:16,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2147 conditions, 1287 events. 456/1287 cut-off events. For 255/306 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5854 event pairs, 116 based on Foata normal form. 4/1174 useless extension candidates. Maximal degree in co-relation 2050. Up to 359 conditions per place. [2022-11-02 20:55:16,531 INFO L137 encePairwiseOnDemand]: 395/401 looper letters, 34 selfloop transitions, 3 changer transitions 12/312 dead transitions. [2022-11-02 20:55:16,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 312 transitions, 750 flow [2022-11-02 20:55:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1000 transitions. [2022-11-02 20:55:16,534 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8312551953449709 [2022-11-02 20:55:16,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1000 transitions. [2022-11-02 20:55:16,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1000 transitions. [2022-11-02 20:55:16,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:16,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1000 transitions. [2022-11-02 20:55:16,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 333.3333333333333) internal successors, (1000), 3 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,542 INFO L175 Difference]: Start difference. First operand has 296 places, 298 transitions, 627 flow. Second operand 3 states and 1000 transitions. [2022-11-02 20:55:16,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 312 transitions, 750 flow [2022-11-02 20:55:16,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 312 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:16,551 INFO L231 Difference]: Finished difference. Result has 295 places, 287 transitions, 606 flow [2022-11-02 20:55:16,552 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=295, PETRI_TRANSITIONS=287} [2022-11-02 20:55:16,552 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -71 predicate places. [2022-11-02 20:55:16,553 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 287 transitions, 606 flow [2022-11-02 20:55:16,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:16,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:16,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:55:16,554 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:16,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:16,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1537594718, now seen corresponding path program 1 times [2022-11-02 20:55:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:16,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676457699] [2022-11-02 20:55:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:16,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:16,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676457699] [2022-11-02 20:55:16,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676457699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:16,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:16,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:16,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496738516] [2022-11-02 20:55:16,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:16,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:16,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:16,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:16,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:16,613 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 401 [2022-11-02 20:55:16,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 287 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:16,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 401 [2022-11-02 20:55:16,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:17,039 INFO L130 PetriNetUnfolder]: 536/1548 cut-off events. [2022-11-02 20:55:17,040 INFO L131 PetriNetUnfolder]: For 229/298 co-relation queries the response was YES. [2022-11-02 20:55:17,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2721 conditions, 1548 events. 536/1548 cut-off events. For 229/298 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7891 event pairs, 236 based on Foata normal form. 4/1388 useless extension candidates. Maximal degree in co-relation 2623. Up to 664 conditions per place. [2022-11-02 20:55:17,055 INFO L137 encePairwiseOnDemand]: 394/401 looper letters, 39 selfloop transitions, 4 changer transitions 4/301 dead transitions. [2022-11-02 20:55:17,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 301 transitions, 740 flow [2022-11-02 20:55:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 995 transitions. [2022-11-02 20:55:17,058 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8270989193682461 [2022-11-02 20:55:17,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 995 transitions. [2022-11-02 20:55:17,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 995 transitions. [2022-11-02 20:55:17,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:17,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 995 transitions. [2022-11-02 20:55:17,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:17,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:17,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:17,064 INFO L175 Difference]: Start difference. First operand has 295 places, 287 transitions, 606 flow. Second operand 3 states and 995 transitions. [2022-11-02 20:55:17,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 301 transitions, 740 flow [2022-11-02 20:55:17,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 301 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:17,070 INFO L231 Difference]: Finished difference. Result has 285 places, 283 transitions, 613 flow [2022-11-02 20:55:17,071 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=285, PETRI_TRANSITIONS=283} [2022-11-02 20:55:17,072 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -81 predicate places. [2022-11-02 20:55:17,072 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 283 transitions, 613 flow [2022-11-02 20:55:17,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:17,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:17,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:17,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:55:17,073 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:17,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1285679097, now seen corresponding path program 1 times [2022-11-02 20:55:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:17,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743062923] [2022-11-02 20:55:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:17,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:17,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743062923] [2022-11-02 20:55:17,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743062923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:17,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:17,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:17,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677353229] [2022-11-02 20:55:17,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:17,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:17,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:17,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:17,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:17,129 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 401 [2022-11-02 20:55:17,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 283 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:17,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:17,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 401 [2022-11-02 20:55:17,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:17,674 INFO L130 PetriNetUnfolder]: 642/2109 cut-off events. [2022-11-02 20:55:17,675 INFO L131 PetriNetUnfolder]: For 437/481 co-relation queries the response was YES. [2022-11-02 20:55:17,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3648 conditions, 2109 events. 642/2109 cut-off events. For 437/481 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 12735 event pairs, 145 based on Foata normal form. 4/1902 useless extension candidates. Maximal degree in co-relation 3550. Up to 789 conditions per place. [2022-11-02 20:55:17,697 INFO L137 encePairwiseOnDemand]: 395/401 looper letters, 39 selfloop transitions, 3 changer transitions 8/300 dead transitions. [2022-11-02 20:55:17,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 300 transitions, 765 flow [2022-11-02 20:55:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2022-11-02 20:55:17,700 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8320864505403158 [2022-11-02 20:55:17,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1001 transitions. [2022-11-02 20:55:17,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1001 transitions. [2022-11-02 20:55:17,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:17,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1001 transitions. [2022-11-02 20:55:17,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 333.6666666666667) internal successors, (1001), 3 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:17,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:17,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:17,707 INFO L175 Difference]: Start difference. First operand has 285 places, 283 transitions, 613 flow. Second operand 3 states and 1001 transitions. [2022-11-02 20:55:17,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 300 transitions, 765 flow [2022-11-02 20:55:17,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 300 transitions, 765 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:55:17,715 INFO L231 Difference]: Finished difference. Result has 282 places, 277 transitions, 608 flow [2022-11-02 20:55:17,716 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=282, PETRI_TRANSITIONS=277} [2022-11-02 20:55:17,716 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -84 predicate places. [2022-11-02 20:55:17,717 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 277 transitions, 608 flow [2022-11-02 20:55:17,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:17,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:17,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:17,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:55:17,718 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1796444022, now seen corresponding path program 1 times [2022-11-02 20:55:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:17,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747168204] [2022-11-02 20:55:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:18,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:18,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747168204] [2022-11-02 20:55:18,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747168204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:18,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:18,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:18,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52356914] [2022-11-02 20:55:18,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:18,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:18,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:18,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:18,405 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 401 [2022-11-02 20:55:18,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 277 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 296.1666666666667) internal successors, (1777), 6 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:18,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:18,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 401 [2022-11-02 20:55:18,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:20,425 INFO L130 PetriNetUnfolder]: 3805/5889 cut-off events. [2022-11-02 20:55:20,425 INFO L131 PetriNetUnfolder]: For 3618/3618 co-relation queries the response was YES. [2022-11-02 20:55:20,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15391 conditions, 5889 events. 3805/5889 cut-off events. For 3618/3618 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 27874 event pairs, 343 based on Foata normal form. 0/5714 useless extension candidates. Maximal degree in co-relation 15292. Up to 2847 conditions per place. [2022-11-02 20:55:20,489 INFO L137 encePairwiseOnDemand]: 396/401 looper letters, 114 selfloop transitions, 4 changer transitions 1/340 dead transitions. [2022-11-02 20:55:20,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 340 transitions, 1116 flow [2022-11-02 20:55:20,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:55:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1844 transitions. [2022-11-02 20:55:20,494 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7664172901080631 [2022-11-02 20:55:20,494 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1844 transitions. [2022-11-02 20:55:20,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1844 transitions. [2022-11-02 20:55:20,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:20,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1844 transitions. [2022-11-02 20:55:20,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 307.3333333333333) internal successors, (1844), 6 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:20,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 401.0) internal successors, (2807), 7 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:20,504 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 401.0) internal successors, (2807), 7 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:20,504 INFO L175 Difference]: Start difference. First operand has 282 places, 277 transitions, 608 flow. Second operand 6 states and 1844 transitions. [2022-11-02 20:55:20,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 340 transitions, 1116 flow [2022-11-02 20:55:20,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 340 transitions, 1116 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:55:20,512 INFO L231 Difference]: Finished difference. Result has 281 places, 275 transitions, 612 flow [2022-11-02 20:55:20,513 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=612, PETRI_PLACES=281, PETRI_TRANSITIONS=275} [2022-11-02 20:55:20,513 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -85 predicate places. [2022-11-02 20:55:20,513 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 275 transitions, 612 flow [2022-11-02 20:55:20,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.1666666666667) internal successors, (1777), 6 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:20,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:20,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:20,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:55:20,515 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:20,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1118256930, now seen corresponding path program 1 times [2022-11-02 20:55:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:20,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692561490] [2022-11-02 20:55:20,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:20,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:21,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:21,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692561490] [2022-11-02 20:55:21,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692561490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:21,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:21,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:21,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501836785] [2022-11-02 20:55:21,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:21,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:21,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:21,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:21,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:21,234 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 401 [2022-11-02 20:55:21,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 275 transitions, 612 flow. Second operand has 6 states, 6 states have (on average 297.1666666666667) internal successors, (1783), 6 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:21,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:21,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 401 [2022-11-02 20:55:21,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:23,450 INFO L130 PetriNetUnfolder]: 3476/5573 cut-off events. [2022-11-02 20:55:23,450 INFO L131 PetriNetUnfolder]: For 3451/3451 co-relation queries the response was YES. [2022-11-02 20:55:23,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14615 conditions, 5573 events. 3476/5573 cut-off events. For 3451/3451 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 26985 event pairs, 1123 based on Foata normal form. 0/5409 useless extension candidates. Maximal degree in co-relation 14515. Up to 2995 conditions per place. [2022-11-02 20:55:23,512 INFO L137 encePairwiseOnDemand]: 396/401 looper letters, 97 selfloop transitions, 4 changer transitions 0/322 dead transitions. [2022-11-02 20:55:23,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 322 transitions, 1016 flow [2022-11-02 20:55:23,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:55:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1834 transitions. [2022-11-02 20:55:23,517 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7622610141313383 [2022-11-02 20:55:23,517 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1834 transitions. [2022-11-02 20:55:23,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1834 transitions. [2022-11-02 20:55:23,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:23,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1834 transitions. [2022-11-02 20:55:23,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 305.6666666666667) internal successors, (1834), 6 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:23,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 401.0) internal successors, (2807), 7 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:23,526 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 401.0) internal successors, (2807), 7 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:23,527 INFO L175 Difference]: Start difference. First operand has 281 places, 275 transitions, 612 flow. Second operand 6 states and 1834 transitions. [2022-11-02 20:55:23,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 322 transitions, 1016 flow [2022-11-02 20:55:23,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 322 transitions, 1009 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:55:23,536 INFO L231 Difference]: Finished difference. Result has 280 places, 274 transitions, 611 flow [2022-11-02 20:55:23,536 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=611, PETRI_PLACES=280, PETRI_TRANSITIONS=274} [2022-11-02 20:55:23,537 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -86 predicate places. [2022-11-02 20:55:23,537 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 274 transitions, 611 flow [2022-11-02 20:55:23,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.1666666666667) internal successors, (1783), 6 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:23,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:23,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:23,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:55:23,538 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:23,539 INFO L85 PathProgramCache]: Analyzing trace with hash -870043782, now seen corresponding path program 1 times [2022-11-02 20:55:23,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:23,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500295161] [2022-11-02 20:55:23,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:23,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:24,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:24,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500295161] [2022-11-02 20:55:24,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500295161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:24,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:24,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532709786] [2022-11-02 20:55:24,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:24,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:24,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:24,218 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 401 [2022-11-02 20:55:24,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 274 transitions, 611 flow. Second operand has 6 states, 6 states have (on average 298.1666666666667) internal successors, (1789), 6 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:24,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:24,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 401 [2022-11-02 20:55:24,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:26,060 INFO L130 PetriNetUnfolder]: 3367/5587 cut-off events. [2022-11-02 20:55:26,060 INFO L131 PetriNetUnfolder]: For 3253/3253 co-relation queries the response was YES. [2022-11-02 20:55:26,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14294 conditions, 5587 events. 3367/5587 cut-off events. For 3253/3253 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 28582 event pairs, 1441 based on Foata normal form. 0/5434 useless extension candidates. Maximal degree in co-relation 14194. Up to 3911 conditions per place. [2022-11-02 20:55:26,116 INFO L137 encePairwiseOnDemand]: 396/401 looper letters, 80 selfloop transitions, 4 changer transitions 0/305 dead transitions. [2022-11-02 20:55:26,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 305 transitions, 913 flow [2022-11-02 20:55:26,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:55:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1825 transitions. [2022-11-02 20:55:26,121 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.758520365752286 [2022-11-02 20:55:26,121 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1825 transitions. [2022-11-02 20:55:26,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1825 transitions. [2022-11-02 20:55:26,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:26,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1825 transitions. [2022-11-02 20:55:26,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 304.1666666666667) internal successors, (1825), 6 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:26,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 401.0) internal successors, (2807), 7 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:26,135 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 401.0) internal successors, (2807), 7 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:26,135 INFO L175 Difference]: Start difference. First operand has 280 places, 274 transitions, 611 flow. Second operand 6 states and 1825 transitions. [2022-11-02 20:55:26,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 305 transitions, 913 flow [2022-11-02 20:55:26,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 305 transitions, 906 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:55:26,144 INFO L231 Difference]: Finished difference. Result has 280 places, 273 transitions, 610 flow [2022-11-02 20:55:26,145 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=610, PETRI_PLACES=280, PETRI_TRANSITIONS=273} [2022-11-02 20:55:26,145 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -86 predicate places. [2022-11-02 20:55:26,145 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 273 transitions, 610 flow [2022-11-02 20:55:26,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.1666666666667) internal successors, (1789), 6 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:26,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:26,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:26,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:55:26,147 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 118 more)] === [2022-11-02 20:55:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:26,147 INFO L85 PathProgramCache]: Analyzing trace with hash -534940977, now seen corresponding path program 1 times [2022-11-02 20:55:26,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:26,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244050417] [2022-11-02 20:55:26,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:26,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:26,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:26,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244050417] [2022-11-02 20:55:26,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244050417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:26,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:26,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:26,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711640461] [2022-11-02 20:55:26,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:26,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:26,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:26,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:26,889 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 401 [2022-11-02 20:55:26,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 273 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 299.1666666666667) internal successors, (1795), 6 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:26,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:26,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 401 [2022-11-02 20:55:26,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:28,166 INFO L130 PetriNetUnfolder]: 3412/5643 cut-off events. [2022-11-02 20:55:28,166 INFO L131 PetriNetUnfolder]: For 3266/3266 co-relation queries the response was YES. [2022-11-02 20:55:28,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14422 conditions, 5643 events. 3412/5643 cut-off events. For 3266/3266 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 29123 event pairs, 1615 based on Foata normal form. 15/5496 useless extension candidates. Maximal degree in co-relation 14322. Up to 4421 conditions per place. [2022-11-02 20:55:28,187 INFO L137 encePairwiseOnDemand]: 396/401 looper letters, 0 selfloop transitions, 0 changer transitions 288/288 dead transitions. [2022-11-02 20:55:28,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 288 transitions, 810 flow [2022-11-02 20:55:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:55:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1816 transitions. [2022-11-02 20:55:28,192 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7547797173732336 [2022-11-02 20:55:28,192 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1816 transitions. [2022-11-02 20:55:28,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1816 transitions. [2022-11-02 20:55:28,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:28,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1816 transitions. [2022-11-02 20:55:28,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 302.6666666666667) internal successors, (1816), 6 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:28,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 401.0) internal successors, (2807), 7 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:28,203 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 401.0) internal successors, (2807), 7 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:28,203 INFO L175 Difference]: Start difference. First operand has 280 places, 273 transitions, 610 flow. Second operand 6 states and 1816 transitions. [2022-11-02 20:55:28,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 288 transitions, 810 flow [2022-11-02 20:55:28,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 288 transitions, 803 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:55:28,208 INFO L231 Difference]: Finished difference. Result has 280 places, 0 transitions, 0 flow [2022-11-02 20:55:28,209 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=401, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=280, PETRI_TRANSITIONS=0} [2022-11-02 20:55:28,209 INFO L287 CegarLoopForPetriNet]: 366 programPoint places, -86 predicate places. [2022-11-02 20:55:28,209 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 0 transitions, 0 flow [2022-11-02 20:55:28,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.1666666666667) internal successors, (1795), 6 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:28,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (121 of 122 remaining) [2022-11-02 20:55:28,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (120 of 122 remaining) [2022-11-02 20:55:28,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (119 of 122 remaining) [2022-11-02 20:55:28,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (118 of 122 remaining) [2022-11-02 20:55:28,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (117 of 122 remaining) [2022-11-02 20:55:28,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (116 of 122 remaining) [2022-11-02 20:55:28,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (115 of 122 remaining) [2022-11-02 20:55:28,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (114 of 122 remaining) [2022-11-02 20:55:28,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (113 of 122 remaining) [2022-11-02 20:55:28,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (112 of 122 remaining) [2022-11-02 20:55:28,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (111 of 122 remaining) [2022-11-02 20:55:28,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (110 of 122 remaining) [2022-11-02 20:55:28,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (109 of 122 remaining) [2022-11-02 20:55:28,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (108 of 122 remaining) [2022-11-02 20:55:28,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (107 of 122 remaining) [2022-11-02 20:55:28,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (106 of 122 remaining) [2022-11-02 20:55:28,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (105 of 122 remaining) [2022-11-02 20:55:28,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (104 of 122 remaining) [2022-11-02 20:55:28,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (103 of 122 remaining) [2022-11-02 20:55:28,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (102 of 122 remaining) [2022-11-02 20:55:28,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (101 of 122 remaining) [2022-11-02 20:55:28,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (100 of 122 remaining) [2022-11-02 20:55:28,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (99 of 122 remaining) [2022-11-02 20:55:28,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (98 of 122 remaining) [2022-11-02 20:55:28,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (97 of 122 remaining) [2022-11-02 20:55:28,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (96 of 122 remaining) [2022-11-02 20:55:28,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (95 of 122 remaining) [2022-11-02 20:55:28,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (94 of 122 remaining) [2022-11-02 20:55:28,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (93 of 122 remaining) [2022-11-02 20:55:28,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (92 of 122 remaining) [2022-11-02 20:55:28,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (91 of 122 remaining) [2022-11-02 20:55:28,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (90 of 122 remaining) [2022-11-02 20:55:28,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (89 of 122 remaining) [2022-11-02 20:55:28,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (88 of 122 remaining) [2022-11-02 20:55:28,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (87 of 122 remaining) [2022-11-02 20:55:28,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (86 of 122 remaining) [2022-11-02 20:55:28,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (85 of 122 remaining) [2022-11-02 20:55:28,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (84 of 122 remaining) [2022-11-02 20:55:28,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (83 of 122 remaining) [2022-11-02 20:55:28,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (82 of 122 remaining) [2022-11-02 20:55:28,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (81 of 122 remaining) [2022-11-02 20:55:28,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (80 of 122 remaining) [2022-11-02 20:55:28,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (79 of 122 remaining) [2022-11-02 20:55:28,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (78 of 122 remaining) [2022-11-02 20:55:28,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (77 of 122 remaining) [2022-11-02 20:55:28,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (76 of 122 remaining) [2022-11-02 20:55:28,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (75 of 122 remaining) [2022-11-02 20:55:28,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (74 of 122 remaining) [2022-11-02 20:55:28,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (73 of 122 remaining) [2022-11-02 20:55:28,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (72 of 122 remaining) [2022-11-02 20:55:28,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (71 of 122 remaining) [2022-11-02 20:55:28,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (70 of 122 remaining) [2022-11-02 20:55:28,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (69 of 122 remaining) [2022-11-02 20:55:28,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (68 of 122 remaining) [2022-11-02 20:55:28,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (67 of 122 remaining) [2022-11-02 20:55:28,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (66 of 122 remaining) [2022-11-02 20:55:28,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (65 of 122 remaining) [2022-11-02 20:55:28,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (64 of 122 remaining) [2022-11-02 20:55:28,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (63 of 122 remaining) [2022-11-02 20:55:28,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (62 of 122 remaining) [2022-11-02 20:55:28,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (61 of 122 remaining) [2022-11-02 20:55:28,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (60 of 122 remaining) [2022-11-02 20:55:28,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (59 of 122 remaining) [2022-11-02 20:55:28,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 122 remaining) [2022-11-02 20:55:28,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 122 remaining) [2022-11-02 20:55:28,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 122 remaining) [2022-11-02 20:55:28,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 122 remaining) [2022-11-02 20:55:28,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (54 of 122 remaining) [2022-11-02 20:55:28,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (53 of 122 remaining) [2022-11-02 20:55:28,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (52 of 122 remaining) [2022-11-02 20:55:28,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (51 of 122 remaining) [2022-11-02 20:55:28,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (50 of 122 remaining) [2022-11-02 20:55:28,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (49 of 122 remaining) [2022-11-02 20:55:28,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (48 of 122 remaining) [2022-11-02 20:55:28,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (47 of 122 remaining) [2022-11-02 20:55:28,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (46 of 122 remaining) [2022-11-02 20:55:28,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (45 of 122 remaining) [2022-11-02 20:55:28,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (44 of 122 remaining) [2022-11-02 20:55:28,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 122 remaining) [2022-11-02 20:55:28,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 122 remaining) [2022-11-02 20:55:28,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 122 remaining) [2022-11-02 20:55:28,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (40 of 122 remaining) [2022-11-02 20:55:28,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 122 remaining) [2022-11-02 20:55:28,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (38 of 122 remaining) [2022-11-02 20:55:28,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (37 of 122 remaining) [2022-11-02 20:55:28,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 122 remaining) [2022-11-02 20:55:28,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 122 remaining) [2022-11-02 20:55:28,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (34 of 122 remaining) [2022-11-02 20:55:28,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (33 of 122 remaining) [2022-11-02 20:55:28,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (32 of 122 remaining) [2022-11-02 20:55:28,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (31 of 122 remaining) [2022-11-02 20:55:28,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (30 of 122 remaining) [2022-11-02 20:55:28,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 122 remaining) [2022-11-02 20:55:28,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 122 remaining) [2022-11-02 20:55:28,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (27 of 122 remaining) [2022-11-02 20:55:28,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (26 of 122 remaining) [2022-11-02 20:55:28,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 122 remaining) [2022-11-02 20:55:28,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 122 remaining) [2022-11-02 20:55:28,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (23 of 122 remaining) [2022-11-02 20:55:28,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 122 remaining) [2022-11-02 20:55:28,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (21 of 122 remaining) [2022-11-02 20:55:28,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (20 of 122 remaining) [2022-11-02 20:55:28,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (19 of 122 remaining) [2022-11-02 20:55:28,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 122 remaining) [2022-11-02 20:55:28,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (17 of 122 remaining) [2022-11-02 20:55:28,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (16 of 122 remaining) [2022-11-02 20:55:28,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (15 of 122 remaining) [2022-11-02 20:55:28,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (14 of 122 remaining) [2022-11-02 20:55:28,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (13 of 122 remaining) [2022-11-02 20:55:28,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (12 of 122 remaining) [2022-11-02 20:55:28,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (11 of 122 remaining) [2022-11-02 20:55:28,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (10 of 122 remaining) [2022-11-02 20:55:28,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (9 of 122 remaining) [2022-11-02 20:55:28,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (8 of 122 remaining) [2022-11-02 20:55:28,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (7 of 122 remaining) [2022-11-02 20:55:28,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (6 of 122 remaining) [2022-11-02 20:55:28,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 122 remaining) [2022-11-02 20:55:28,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (4 of 122 remaining) [2022-11-02 20:55:28,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (3 of 122 remaining) [2022-11-02 20:55:28,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (2 of 122 remaining) [2022-11-02 20:55:28,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (1 of 122 remaining) [2022-11-02 20:55:28,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (0 of 122 remaining) [2022-11-02 20:55:28,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:55:28,233 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:28,239 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:55:28,239 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:55:28,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:55:28 BasicIcfg [2022-11-02 20:55:28,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:55:28,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:55:28,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:55:28,249 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:55:28,249 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:10" (3/4) ... [2022-11-02 20:55:28,252 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:55:28,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:55:28,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:55:28,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:55:28,258 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-02 20:55:28,271 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-02 20:55:28,272 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:55:28,272 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:55:28,273 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:55:28,355 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:55:28,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:55:28,357 INFO L158 Benchmark]: Toolchain (without parser) took 19754.27ms. Allocated memory was 138.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 106.8MB in the beginning and 788.8MB in the end (delta: -682.0MB). Peak memory consumption was 617.1MB. Max. memory is 16.1GB. [2022-11-02 20:55:28,357 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 109.1MB. Free memory was 64.3MB in the beginning and 64.2MB in the end (delta: 46.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:55:28,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.19ms. Allocated memory is still 138.4MB. Free memory was 106.8MB in the beginning and 109.5MB in the end (delta: -2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:55:28,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.30ms. Allocated memory is still 138.4MB. Free memory was 109.5MB in the beginning and 105.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:55:28,358 INFO L158 Benchmark]: Boogie Preprocessor took 61.79ms. Allocated memory is still 138.4MB. Free memory was 105.7MB in the beginning and 102.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:55:28,359 INFO L158 Benchmark]: RCFGBuilder took 1539.39ms. Allocated memory is still 138.4MB. Free memory was 102.6MB in the beginning and 94.7MB in the end (delta: 7.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2022-11-02 20:55:28,359 INFO L158 Benchmark]: TraceAbstraction took 17634.02ms. Allocated memory was 138.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 94.0MB in the beginning and 794.1MB in the end (delta: -700.1MB). Peak memory consumption was 599.8MB. Max. memory is 16.1GB. [2022-11-02 20:55:28,359 INFO L158 Benchmark]: Witness Printer took 107.59ms. Allocated memory is still 1.4GB. Free memory was 794.1MB in the beginning and 788.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:55:28,366 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.31ms. Allocated memory is still 109.1MB. Free memory was 64.3MB in the beginning and 64.2MB in the end (delta: 46.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.19ms. Allocated memory is still 138.4MB. Free memory was 106.8MB in the beginning and 109.5MB in the end (delta: -2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.30ms. Allocated memory is still 138.4MB. Free memory was 109.5MB in the beginning and 105.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.79ms. Allocated memory is still 138.4MB. Free memory was 105.7MB in the beginning and 102.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1539.39ms. Allocated memory is still 138.4MB. Free memory was 102.6MB in the beginning and 94.7MB in the end (delta: 7.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17634.02ms. Allocated memory was 138.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 94.0MB in the beginning and 794.1MB in the end (delta: -700.1MB). Peak memory consumption was 599.8MB. Max. memory is 16.1GB. * Witness Printer took 107.59ms. Allocated memory is still 1.4GB. Free memory was 794.1MB in the beginning and 788.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: 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: 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: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: 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: 135]: 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: 135]: 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: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 100]: 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: 100]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 462 locations, 122 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: 17.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1207 IncrementalHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 217 mSDtfsCounter, 1207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=766occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2215 NumberOfCodeBlocks, 2215 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2195 ConstructedInterpolants, 0 QuantifiedInterpolants, 2664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 74 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:55:28,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039b606-8bd2-4691-9afe-bd21095f12a5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE