./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/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_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/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_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/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 6727abf6d3311127e7c3f388ca276994a5a41bcb1f2faca3217c66ebe13b8b8f --- 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:18:36,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:18:36,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:18:36,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:18:36,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:18:36,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:18:36,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:18:36,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:18:36,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:18:36,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:18:36,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:18:36,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:18:36,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:18:36,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:18:36,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:18:36,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:18:36,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:18:36,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:18:36,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:18:36,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:18:36,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:18:36,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:18:36,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:18:36,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:18:36,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:18:36,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:18:36,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:18:36,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:18:36,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:18:36,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:18:36,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:18:36,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:18:36,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:18:36,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:18:36,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:18:36,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:18:36,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:18:36,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:18:36,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:18:36,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:18:36,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:18:36,328 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:18:36,365 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:18:36,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:18:36,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:18:36,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:18:36,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:18:36,375 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:18:36,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:18:36,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:18:36,376 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:18:36,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:18:36,378 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:18:36,378 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:18:36,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:18:36,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:18:36,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:18:36,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:18:36,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:18:36,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:18:36,380 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:18:36,380 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:18:36,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:18:36,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:18:36,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:18:36,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:18:36,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:18:36,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:18:36,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:18:36,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:18:36,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:18:36,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:18:36,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:18:36,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:18:36,384 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:18:36,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:18:36,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:18:36,384 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_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/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_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/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 -> 6727abf6d3311127e7c3f388ca276994a5a41bcb1f2faca3217c66ebe13b8b8f [2022-11-02 20:18:36,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:18:36,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:18:36,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:18:36,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:18:36,738 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:18:36,739 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-11-02 20:18:36,852 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/bin/uautomizer-Dbtcem3rbc/data/4a5d3c386/fbb354b4f51e47009be39def49966463/FLAG80a0788be [2022-11-02 20:18:37,468 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:18:37,469 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-11-02 20:18:37,483 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/bin/uautomizer-Dbtcem3rbc/data/4a5d3c386/fbb354b4f51e47009be39def49966463/FLAG80a0788be [2022-11-02 20:18:37,784 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/bin/uautomizer-Dbtcem3rbc/data/4a5d3c386/fbb354b4f51e47009be39def49966463 [2022-11-02 20:18:37,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:18:37,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:18:37,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:18:37,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:18:37,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:18:37,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:18:37" (1/1) ... [2022-11-02 20:18:37,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f1017e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:37, skipping insertion in model container [2022-11-02 20:18:37,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:18:37" (1/1) ... [2022-11-02 20:18:37,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:18:37,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:18:38,079 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_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-11-02 20:18:38,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:18:38,097 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:18:38,139 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_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-11-02 20:18:38,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:18:38,163 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:18:38,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:38 WrapperNode [2022-11-02 20:18:38,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:18:38,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:18:38,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:18:38,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:18:38,176 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:18:38" (1/1) ... [2022-11-02 20:18:38,190 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:18:38" (1/1) ... [2022-11-02 20:18:38,243 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 403 [2022-11-02 20:18:38,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:18:38,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:18:38,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:18:38,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:18:38,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:38" (1/1) ... [2022-11-02 20:18:38,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:38" (1/1) ... [2022-11-02 20:18:38,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:38" (1/1) ... [2022-11-02 20:18:38,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:38" (1/1) ... [2022-11-02 20:18:38,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:38" (1/1) ... [2022-11-02 20:18:38,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:38" (1/1) ... [2022-11-02 20:18:38,308 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:38" (1/1) ... [2022-11-02 20:18:38,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:38" (1/1) ... [2022-11-02 20:18:38,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:18:38,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:18:38,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:18:38,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:18:38,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:38" (1/1) ... [2022-11-02 20:18:38,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:18:38,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:18:38,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:18:38,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6e8c9c-42bb-4494-9eb4-f3d2d5371b58/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:18:38,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:18:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:18:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:18:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:18:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:18:38,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:18:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:18:38,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:18:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:18:38,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:18:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:18:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:18:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:18:38,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:18:38,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:18:38,430 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:18:38,647 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:18:38,649 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:18:39,560 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:18:39,573 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:18:39,573 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 20:18:39,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:18:39 BoogieIcfgContainer [2022-11-02 20:18:39,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:18:39,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:18:39,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:18:39,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:18:39,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:18:37" (1/3) ... [2022-11-02 20:18:39,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ab3c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:18:39, skipping insertion in model container [2022-11-02 20:18:39,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:38" (2/3) ... [2022-11-02 20:18:39,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ab3c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:18:39, skipping insertion in model container [2022-11-02 20:18:39,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:18:39" (3/3) ... [2022-11-02 20:18:39,586 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2022-11-02 20:18:39,595 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:18:39,606 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:18:39,606 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-11-02 20:18:39,606 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:18:39,746 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:18:39,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 517 places, 536 transitions, 1096 flow [2022-11-02 20:18:40,052 INFO L130 PetriNetUnfolder]: 29/533 cut-off events. [2022-11-02 20:18:40,052 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:18:40,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 533 events. 29/533 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 920 event pairs, 0 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 332. Up to 2 conditions per place. [2022-11-02 20:18:40,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 517 places, 536 transitions, 1096 flow [2022-11-02 20:18:40,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 470 places, 486 transitions, 990 flow [2022-11-02 20:18:40,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:18:40,109 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;@45fb0824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:18:40,110 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-11-02 20:18:40,114 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-11-02 20:18:40,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:18:40,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:40,116 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] [2022-11-02 20:18:40,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:18:40,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1341404728, now seen corresponding path program 1 times [2022-11-02 20:18:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:40,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233105906] [2022-11-02 20:18:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:40,400 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:18:40,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:40,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233105906] [2022-11-02 20:18:40,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233105906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:40,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:40,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:40,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903964467] [2022-11-02 20:18:40,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:40,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:40,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:40,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:40,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:40,480 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 536 [2022-11-02 20:18:40,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 486 transitions, 990 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:40,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:40,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 536 [2022-11-02 20:18:40,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:18:42,025 INFO L130 PetriNetUnfolder]: 204/3873 cut-off events. [2022-11-02 20:18:42,026 INFO L131 PetriNetUnfolder]: For 84/198 co-relation queries the response was YES. [2022-11-02 20:18:42,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4258 conditions, 3873 events. 204/3873 cut-off events. For 84/198 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 32974 event pairs, 135 based on Foata normal form. 131/3412 useless extension candidates. Maximal degree in co-relation 3809. Up to 316 conditions per place. [2022-11-02 20:18:42,080 INFO L137 encePairwiseOnDemand]: 513/536 looper letters, 27 selfloop transitions, 2 changer transitions 6/465 dead transitions. [2022-11-02 20:18:42,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 465 transitions, 1006 flow [2022-11-02 20:18:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:18:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1496 transitions. [2022-11-02 20:18:42,109 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9303482587064676 [2022-11-02 20:18:42,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1496 transitions. [2022-11-02 20:18:42,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1496 transitions. [2022-11-02 20:18:42,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:18:42,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1496 transitions. [2022-11-02 20:18:42,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 498.6666666666667) internal successors, (1496), 3 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:42,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:42,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:42,146 INFO L175 Difference]: Start difference. First operand has 470 places, 486 transitions, 990 flow. Second operand 3 states and 1496 transitions. [2022-11-02 20:18:42,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 465 transitions, 1006 flow [2022-11-02 20:18:42,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 465 transitions, 994 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:18:42,172 INFO L231 Difference]: Finished difference. Result has 465 places, 459 transitions, 928 flow [2022-11-02 20:18:42,175 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=465, PETRI_TRANSITIONS=459} [2022-11-02 20:18:42,185 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -5 predicate places. [2022-11-02 20:18:42,185 INFO L495 AbstractCegarLoop]: Abstraction has has 465 places, 459 transitions, 928 flow [2022-11-02 20:18:42,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:42,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:42,188 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:18:42,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:18:42,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:18:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash -805986249, now seen corresponding path program 1 times [2022-11-02 20:18:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:42,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148840316] [2022-11-02 20:18:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:42,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:42,264 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:18:42,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:42,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148840316] [2022-11-02 20:18:42,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148840316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:42,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:42,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:42,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672085984] [2022-11-02 20:18:42,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:42,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:42,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:42,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:42,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:42,271 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 536 [2022-11-02 20:18:42,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 459 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:42,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:42,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 536 [2022-11-02 20:18:42,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:18:43,126 INFO L130 PetriNetUnfolder]: 100/2663 cut-off events. [2022-11-02 20:18:43,127 INFO L131 PetriNetUnfolder]: For 14/65 co-relation queries the response was YES. [2022-11-02 20:18:43,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 2663 events. 100/2663 cut-off events. For 14/65 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 19718 event pairs, 56 based on Foata normal form. 0/2311 useless extension candidates. Maximal degree in co-relation 2799. Up to 152 conditions per place. [2022-11-02 20:18:43,169 INFO L137 encePairwiseOnDemand]: 529/536 looper letters, 19 selfloop transitions, 1 changer transitions 0/453 dead transitions. [2022-11-02 20:18:43,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 453 transitions, 956 flow [2022-11-02 20:18:43,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:18:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2022-11-02 20:18:43,175 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9210199004975125 [2022-11-02 20:18:43,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1481 transitions. [2022-11-02 20:18:43,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1481 transitions. [2022-11-02 20:18:43,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:18:43,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1481 transitions. [2022-11-02 20:18:43,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:43,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:43,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:43,189 INFO L175 Difference]: Start difference. First operand has 465 places, 459 transitions, 928 flow. Second operand 3 states and 1481 transitions. [2022-11-02 20:18:43,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 453 transitions, 956 flow [2022-11-02 20:18:43,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 453 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:18:43,204 INFO L231 Difference]: Finished difference. Result has 453 places, 453 transitions, 914 flow [2022-11-02 20:18:43,205 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=914, PETRI_PLACES=453, PETRI_TRANSITIONS=453} [2022-11-02 20:18:43,206 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-02 20:18:43,206 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 453 transitions, 914 flow [2022-11-02 20:18:43,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:43,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:43,208 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] [2022-11-02 20:18:43,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:18:43,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:18:43,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash 629444106, now seen corresponding path program 1 times [2022-11-02 20:18:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:43,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91697696] [2022-11-02 20:18:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:43,337 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:18:43,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:43,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91697696] [2022-11-02 20:18:43,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91697696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:43,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:43,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:43,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536667987] [2022-11-02 20:18:43,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:43,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:43,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:43,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:43,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:43,342 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 536 [2022-11-02 20:18:43,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 453 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:43,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:43,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 536 [2022-11-02 20:18:43,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:18:43,749 INFO L130 PetriNetUnfolder]: 43/1281 cut-off events. [2022-11-02 20:18:43,749 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-11-02 20:18:43,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 1281 events. 43/1281 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6134 event pairs, 21 based on Foata normal form. 0/1122 useless extension candidates. Maximal degree in co-relation 1332. Up to 72 conditions per place. [2022-11-02 20:18:43,778 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2022-11-02 20:18:43,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 946 flow [2022-11-02 20:18:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:18:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1500 transitions. [2022-11-02 20:18:43,782 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9328358208955224 [2022-11-02 20:18:43,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1500 transitions. [2022-11-02 20:18:43,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1500 transitions. [2022-11-02 20:18:43,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:18:43,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1500 transitions. [2022-11-02 20:18:43,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 500.0) internal successors, (1500), 3 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:43,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:43,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:43,794 INFO L175 Difference]: Start difference. First operand has 453 places, 453 transitions, 914 flow. Second operand 3 states and 1500 transitions. [2022-11-02 20:18:43,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 946 flow [2022-11-02 20:18:43,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 452 transitions, 945 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:18:43,805 INFO L231 Difference]: Finished difference. Result has 453 places, 452 transitions, 915 flow [2022-11-02 20:18:43,806 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=915, PETRI_PLACES=453, PETRI_TRANSITIONS=452} [2022-11-02 20:18:43,807 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-02 20:18:43,807 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 452 transitions, 915 flow [2022-11-02 20:18:43,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:43,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:43,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:18:43,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:18:43,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:18:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash -111013048, now seen corresponding path program 1 times [2022-11-02 20:18:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:43,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128008399] [2022-11-02 20:18:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:44,609 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:18:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128008399] [2022-11-02 20:18:44,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128008399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:44,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:44,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:18:44,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80946321] [2022-11-02 20:18:44,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:44,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:18:44,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:44,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:18:44,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:18:44,618 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 536 [2022-11-02 20:18:44,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 452 transitions, 915 flow. Second operand has 6 states, 6 states have (on average 402.8333333333333) internal successors, (2417), 6 states have internal predecessors, (2417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:18:44,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:44,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 536 [2022-11-02 20:18:44,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:03,051 INFO L130 PetriNetUnfolder]: 27435/78367 cut-off events. [2022-11-02 20:19:03,052 INFO L131 PetriNetUnfolder]: For 380/3494 co-relation queries the response was YES. [2022-11-02 20:19:03,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115934 conditions, 78367 events. 27435/78367 cut-off events. For 380/3494 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 936611 event pairs, 24192 based on Foata normal form. 0/65913 useless extension candidates. Maximal degree in co-relation 115900. Up to 37490 conditions per place. [2022-11-02 20:19:04,073 INFO L137 encePairwiseOnDemand]: 518/536 looper letters, 93 selfloop transitions, 15 changer transitions 0/449 dead transitions. [2022-11-02 20:19:04,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 449 transitions, 1125 flow [2022-11-02 20:19:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:19:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:19:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2517 transitions. [2022-11-02 20:19:04,080 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7826492537313433 [2022-11-02 20:19:04,082 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2517 transitions. [2022-11-02 20:19:04,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2517 transitions. [2022-11-02 20:19:04,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:04,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2517 transitions. [2022-11-02 20:19:04,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 419.5) internal successors, (2517), 6 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:04,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:04,104 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:04,105 INFO L175 Difference]: Start difference. First operand has 453 places, 452 transitions, 915 flow. Second operand 6 states and 2517 transitions. [2022-11-02 20:19:04,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 449 transitions, 1125 flow [2022-11-02 20:19:04,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 449 transitions, 1121 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:19:04,123 INFO L231 Difference]: Finished difference. Result has 453 places, 449 transitions, 935 flow [2022-11-02 20:19:04,132 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=935, PETRI_PLACES=453, PETRI_TRANSITIONS=449} [2022-11-02 20:19:04,133 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-02 20:19:04,134 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 449 transitions, 935 flow [2022-11-02 20:19:04,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 402.8333333333333) internal successors, (2417), 6 states have internal predecessors, (2417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:04,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:04,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:04,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:19:04,138 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:19:04,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash 212005435, now seen corresponding path program 1 times [2022-11-02 20:19:04,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:04,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187968031] [2022-11-02 20:19:04,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:04,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:04,236 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:19:04,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:04,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187968031] [2022-11-02 20:19:04,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187968031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:04,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:04,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:04,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961245970] [2022-11-02 20:19:04,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:04,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:04,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:04,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:04,245 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 536 [2022-11-02 20:19:04,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 449 transitions, 935 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:04,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:04,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 536 [2022-11-02 20:19:04,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:04,929 INFO L130 PetriNetUnfolder]: 66/1628 cut-off events. [2022-11-02 20:19:04,929 INFO L131 PetriNetUnfolder]: For 26/29 co-relation queries the response was YES. [2022-11-02 20:19:04,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 1628 events. 66/1628 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8789 event pairs, 39 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 1724. Up to 105 conditions per place. [2022-11-02 20:19:04,945 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 2 changer transitions 0/448 dead transitions. [2022-11-02 20:19:04,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 448 transitions, 967 flow [2022-11-02 20:19:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:19:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1500 transitions. [2022-11-02 20:19:04,950 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9328358208955224 [2022-11-02 20:19:04,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1500 transitions. [2022-11-02 20:19:04,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1500 transitions. [2022-11-02 20:19:04,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:04,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1500 transitions. [2022-11-02 20:19:04,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 500.0) internal successors, (1500), 3 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:04,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:04,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:04,963 INFO L175 Difference]: Start difference. First operand has 453 places, 449 transitions, 935 flow. Second operand 3 states and 1500 transitions. [2022-11-02 20:19:04,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 448 transitions, 967 flow [2022-11-02 20:19:04,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 448 transitions, 937 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:19:04,973 INFO L231 Difference]: Finished difference. Result has 449 places, 448 transitions, 907 flow [2022-11-02 20:19:04,974 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=907, PETRI_PLACES=449, PETRI_TRANSITIONS=448} [2022-11-02 20:19:04,977 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -21 predicate places. [2022-11-02 20:19:04,978 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 448 transitions, 907 flow [2022-11-02 20:19:04,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:04,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:04,980 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] [2022-11-02 20:19:04,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:19:04,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:19:04,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash 741170182, now seen corresponding path program 1 times [2022-11-02 20:19:04,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:04,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915014414] [2022-11-02 20:19:04,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:05,071 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:19:05,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:05,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915014414] [2022-11-02 20:19:05,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915014414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:05,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:05,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:05,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767542594] [2022-11-02 20:19:05,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:05,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:05,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:05,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:05,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:05,079 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 536 [2022-11-02 20:19:05,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 448 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:05,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 536 [2022-11-02 20:19:05,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:05,239 INFO L130 PetriNetUnfolder]: 21/688 cut-off events. [2022-11-02 20:19:05,239 INFO L131 PetriNetUnfolder]: For 16/19 co-relation queries the response was YES. [2022-11-02 20:19:05,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 688 events. 21/688 cut-off events. For 16/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1833 event pairs, 12 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 706. Up to 43 conditions per place. [2022-11-02 20:19:05,249 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2022-11-02 20:19:05,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 447 transitions, 939 flow [2022-11-02 20:19:05,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:19:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1500 transitions. [2022-11-02 20:19:05,254 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9328358208955224 [2022-11-02 20:19:05,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1500 transitions. [2022-11-02 20:19:05,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1500 transitions. [2022-11-02 20:19:05,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:05,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1500 transitions. [2022-11-02 20:19:05,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 500.0) internal successors, (1500), 3 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,264 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,265 INFO L175 Difference]: Start difference. First operand has 449 places, 448 transitions, 907 flow. Second operand 3 states and 1500 transitions. [2022-11-02 20:19:05,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 447 transitions, 939 flow [2022-11-02 20:19:05,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 447 transitions, 935 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:19:05,274 INFO L231 Difference]: Finished difference. Result has 448 places, 447 transitions, 905 flow [2022-11-02 20:19:05,275 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=448, PETRI_TRANSITIONS=447} [2022-11-02 20:19:05,279 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -22 predicate places. [2022-11-02 20:19:05,279 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 447 transitions, 905 flow [2022-11-02 20:19:05,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:05,280 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] [2022-11-02 20:19:05,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:19:05,281 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:19:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1313607301, now seen corresponding path program 1 times [2022-11-02 20:19:05,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:05,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101871917] [2022-11-02 20:19:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:05,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:05,366 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:19:05,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:05,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101871917] [2022-11-02 20:19:05,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101871917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:05,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:05,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:05,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312246156] [2022-11-02 20:19:05,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:05,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:05,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:05,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:05,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:05,378 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-02 20:19:05,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 447 transitions, 905 flow. Second operand has 3 states, 3 states have (on average 498.0) internal successors, (1494), 3 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:05,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-02 20:19:05,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:05,514 INFO L130 PetriNetUnfolder]: 19/564 cut-off events. [2022-11-02 20:19:05,515 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-11-02 20:19:05,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 564 events. 19/564 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1551 event pairs, 6 based on Foata normal form. 1/518 useless extension candidates. Maximal degree in co-relation 585. Up to 23 conditions per place. [2022-11-02 20:19:05,524 INFO L137 encePairwiseOnDemand]: 531/536 looper letters, 12 selfloop transitions, 3 changer transitions 0/447 dead transitions. [2022-11-02 20:19:05,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 447 transitions, 937 flow [2022-11-02 20:19:05,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:19:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1508 transitions. [2022-11-02 20:19:05,529 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9378109452736318 [2022-11-02 20:19:05,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1508 transitions. [2022-11-02 20:19:05,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1508 transitions. [2022-11-02 20:19:05,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:05,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1508 transitions. [2022-11-02 20:19:05,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 502.6666666666667) internal successors, (1508), 3 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,561 INFO L175 Difference]: Start difference. First operand has 448 places, 447 transitions, 905 flow. Second operand 3 states and 1508 transitions. [2022-11-02 20:19:05,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 447 transitions, 937 flow [2022-11-02 20:19:05,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 447 transitions, 933 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:19:05,571 INFO L231 Difference]: Finished difference. Result has 446 places, 445 transitions, 903 flow [2022-11-02 20:19:05,574 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=903, PETRI_PLACES=446, PETRI_TRANSITIONS=445} [2022-11-02 20:19:05,575 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -24 predicate places. [2022-11-02 20:19:05,575 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 445 transitions, 903 flow [2022-11-02 20:19:05,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 498.0) internal successors, (1494), 3 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:05,576 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:19:05,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:19:05,577 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:19:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash 343808445, now seen corresponding path program 1 times [2022-11-02 20:19:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:05,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034012654] [2022-11-02 20:19:05,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:05,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:05,655 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:19:05,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:05,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034012654] [2022-11-02 20:19:05,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034012654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:05,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:05,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:05,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479761815] [2022-11-02 20:19:05,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:05,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:05,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:05,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:05,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:05,660 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-02 20:19:05,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 445 transitions, 903 flow. Second operand has 3 states, 3 states have (on average 498.6666666666667) internal successors, (1496), 3 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:05,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-02 20:19:05,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:05,936 INFO L130 PetriNetUnfolder]: 31/1132 cut-off events. [2022-11-02 20:19:05,937 INFO L131 PetriNetUnfolder]: For 13/15 co-relation queries the response was YES. [2022-11-02 20:19:05,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 1132 events. 31/1132 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4907 event pairs, 4 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1174. Up to 46 conditions per place. [2022-11-02 20:19:05,956 INFO L137 encePairwiseOnDemand]: 532/536 looper letters, 17 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2022-11-02 20:19:05,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 450 transitions, 956 flow [2022-11-02 20:19:05,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:19:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1512 transitions. [2022-11-02 20:19:05,961 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2022-11-02 20:19:05,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1512 transitions. [2022-11-02 20:19:05,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1512 transitions. [2022-11-02 20:19:05,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:05,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1512 transitions. [2022-11-02 20:19:05,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 504.0) internal successors, (1512), 3 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,970 INFO L175 Difference]: Start difference. First operand has 446 places, 445 transitions, 903 flow. Second operand 3 states and 1512 transitions. [2022-11-02 20:19:05,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 450 transitions, 956 flow [2022-11-02 20:19:05,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 450 transitions, 950 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:19:05,981 INFO L231 Difference]: Finished difference. Result has 445 places, 445 transitions, 907 flow [2022-11-02 20:19:05,982 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=907, PETRI_PLACES=445, PETRI_TRANSITIONS=445} [2022-11-02 20:19:05,984 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -25 predicate places. [2022-11-02 20:19:05,985 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 445 transitions, 907 flow [2022-11-02 20:19:05,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 498.6666666666667) internal successors, (1496), 3 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:05,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:05,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:05,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:19:05,986 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:19:05,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash 801371320, now seen corresponding path program 1 times [2022-11-02 20:19:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:05,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977149326] [2022-11-02 20:19:05,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:05,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:06,064 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:19:06,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:06,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977149326] [2022-11-02 20:19:06,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977149326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:06,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:06,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:06,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627710770] [2022-11-02 20:19:06,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:06,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:06,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:06,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:06,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:06,074 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-02 20:19:06,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 445 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:06,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:06,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-02 20:19:06,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:06,282 INFO L130 PetriNetUnfolder]: 31/782 cut-off events. [2022-11-02 20:19:06,282 INFO L131 PetriNetUnfolder]: For 20/55 co-relation queries the response was YES. [2022-11-02 20:19:06,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 782 events. 31/782 cut-off events. For 20/55 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3022 event pairs, 9 based on Foata normal form. 6/712 useless extension candidates. Maximal degree in co-relation 823. Up to 35 conditions per place. [2022-11-02 20:19:06,296 INFO L137 encePairwiseOnDemand]: 531/536 looper letters, 11 selfloop transitions, 2 changer transitions 4/445 dead transitions. [2022-11-02 20:19:06,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 445 transitions, 937 flow [2022-11-02 20:19:06,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:19:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2022-11-02 20:19:06,302 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9371890547263682 [2022-11-02 20:19:06,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1507 transitions. [2022-11-02 20:19:06,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1507 transitions. [2022-11-02 20:19:06,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:06,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1507 transitions. [2022-11-02 20:19:06,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:06,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:06,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:06,314 INFO L175 Difference]: Start difference. First operand has 445 places, 445 transitions, 907 flow. Second operand 3 states and 1507 transitions. [2022-11-02 20:19:06,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 445 transitions, 937 flow [2022-11-02 20:19:06,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 445 transitions, 937 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:19:06,324 INFO L231 Difference]: Finished difference. Result has 445 places, 439 transitions, 899 flow [2022-11-02 20:19:06,326 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=445, PETRI_TRANSITIONS=439} [2022-11-02 20:19:06,326 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -25 predicate places. [2022-11-02 20:19:06,327 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 439 transitions, 899 flow [2022-11-02 20:19:06,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:06,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:06,328 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] [2022-11-02 20:19:06,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:19:06,329 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:19:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:06,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1318734106, now seen corresponding path program 1 times [2022-11-02 20:19:06,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:06,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857425948] [2022-11-02 20:19:06,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:06,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:06,403 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:19:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:06,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857425948] [2022-11-02 20:19:06,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857425948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:06,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:06,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:06,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709159813] [2022-11-02 20:19:06,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:06,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:06,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:06,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:06,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:06,408 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-02 20:19:06,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 439 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 499.0) internal successors, (1497), 3 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:06,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:06,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-02 20:19:06,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:06,853 INFO L130 PetriNetUnfolder]: 73/1901 cut-off events. [2022-11-02 20:19:06,853 INFO L131 PetriNetUnfolder]: For 31/37 co-relation queries the response was YES. [2022-11-02 20:19:06,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2054 conditions, 1901 events. 73/1901 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 11575 event pairs, 6 based on Foata normal form. 2/1701 useless extension candidates. Maximal degree in co-relation 2019. Up to 93 conditions per place. [2022-11-02 20:19:06,879 INFO L137 encePairwiseOnDemand]: 532/536 looper letters, 16 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2022-11-02 20:19:06,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 443 transitions, 947 flow [2022-11-02 20:19:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:19:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2022-11-02 20:19:06,884 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9396766169154229 [2022-11-02 20:19:06,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1511 transitions. [2022-11-02 20:19:06,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1511 transitions. [2022-11-02 20:19:06,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:06,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1511 transitions. [2022-11-02 20:19:06,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 503.6666666666667) internal successors, (1511), 3 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:06,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:06,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:06,895 INFO L175 Difference]: Start difference. First operand has 445 places, 439 transitions, 899 flow. Second operand 3 states and 1511 transitions. [2022-11-02 20:19:06,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 443 transitions, 947 flow [2022-11-02 20:19:06,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 443 transitions, 943 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:19:06,904 INFO L231 Difference]: Finished difference. Result has 440 places, 439 transitions, 905 flow [2022-11-02 20:19:06,905 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=440, PETRI_TRANSITIONS=439} [2022-11-02 20:19:06,906 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -30 predicate places. [2022-11-02 20:19:06,906 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 439 transitions, 905 flow [2022-11-02 20:19:06,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.0) internal successors, (1497), 3 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:06,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:06,907 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] [2022-11-02 20:19:06,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:19:06,908 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:19:06,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:06,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1469836833, now seen corresponding path program 1 times [2022-11-02 20:19:06,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:06,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093751504] [2022-11-02 20:19:06,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:06,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:07,137 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:19:07,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:07,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093751504] [2022-11-02 20:19:07,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093751504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:07,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:07,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:07,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633594220] [2022-11-02 20:19:07,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:07,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:07,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:07,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:07,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:07,143 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 536 [2022-11-02 20:19:07,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 439 transitions, 905 flow. Second operand has 7 states, 7 states have (on average 439.0) internal successors, (3073), 7 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:07,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:07,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 536 [2022-11-02 20:19:07,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:09,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [69#L51true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-02 20:19:09,272 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,272 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,272 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,272 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [69#L51true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-02 20:19:09,273 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,273 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,273 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,273 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,273 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [69#L51true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-02 20:19:09,273 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,273 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,273 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,274 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,274 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [69#L51true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-02 20:19:09,274 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,274 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,274 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,274 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,276 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, 133#L50-8true, 562#(= |#race~B~0| 0), Black: 551#true, 313#L59true]) [2022-11-02 20:19:09,276 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,276 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,277 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,277 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,277 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, 133#L50-8true, 562#(= |#race~B~0| 0), Black: 551#true, 313#L59true]) [2022-11-02 20:19:09,277 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,277 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,278 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,278 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,278 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, 133#L50-8true, 562#(= |#race~B~0| 0), Black: 551#true]) [2022-11-02 20:19:09,278 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,278 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,278 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,279 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,279 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, 133#L50-8true, 562#(= |#race~B~0| 0), Black: 551#true]) [2022-11-02 20:19:09,279 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,279 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,279 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,280 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,331 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [69#L51true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-02 20:19:09,332 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-02 20:19:09,332 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,332 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,332 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,332 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,333 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [69#L51true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-02 20:19:09,333 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-02 20:19:09,333 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,333 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,333 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,333 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,334 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, 133#L50-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-02 20:19:09,334 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-02 20:19:09,334 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,335 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,335 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,335 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,335 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, 133#L50-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-02 20:19:09,335 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-02 20:19:09,335 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,336 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,336 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,336 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,336 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [69#L51true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-02 20:19:09,336 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-02 20:19:09,336 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,337 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,337 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,337 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,337 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [69#L51true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-02 20:19:09,337 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-02 20:19:09,338 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,338 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,338 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,338 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,338 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, 133#L50-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-02 20:19:09,338 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-02 20:19:09,339 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,339 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,339 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,339 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,339 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, 133#L50-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-02 20:19:09,340 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-02 20:19:09,340 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-02 20:19:09,340 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-02 20:19:09,340 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,340 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-02 20:19:09,344 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 51#L86-7true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-02 20:19:09,345 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-02 20:19:09,345 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:19:09,345 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,345 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-02 20:19:09,345 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 51#L86-7true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-02 20:19:09,346 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-02 20:19:09,346 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:19:09,346 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,346 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-02 20:19:09,347 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 51#L86-7true, 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-02 20:19:09,348 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-02 20:19:09,348 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:19:09,348 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,348 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-02 20:19:09,348 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 51#L86-7true, 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-02 20:19:09,348 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-02 20:19:09,349 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:19:09,349 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,349 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-02 20:19:09,389 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [51#L86-7true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-02 20:19:09,389 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,389 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:19:09,389 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,389 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-02 20:19:09,390 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-02 20:19:09,390 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [51#L86-7true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-02 20:19:09,390 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,390 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:19:09,390 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,391 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-02 20:19:09,391 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-02 20:19:09,391 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 305#L87-7true]) [2022-11-02 20:19:09,391 INFO L383 tUnfolder$Statistics]: this new event has 360 ancestors and is cut-off event [2022-11-02 20:19:09,392 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-02 20:19:09,392 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-02 20:19:09,392 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-02 20:19:09,392 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 305#L87-7true]) [2022-11-02 20:19:09,392 INFO L383 tUnfolder$Statistics]: this new event has 360 ancestors and is cut-off event [2022-11-02 20:19:09,393 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-02 20:19:09,393 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-02 20:19:09,393 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-02 20:19:09,393 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [51#L86-7true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-02 20:19:09,393 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,394 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:19:09,394 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-02 20:19:09,394 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,394 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-02 20:19:09,394 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [51#L86-7true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-02 20:19:09,395 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,395 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-02 20:19:09,395 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-02 20:19:09,395 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-02 20:19:09,395 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-02 20:19:09,422 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 305#L87-7true]) [2022-11-02 20:19:09,422 INFO L383 tUnfolder$Statistics]: this new event has 405 ancestors and is cut-off event [2022-11-02 20:19:09,423 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-02 20:19:09,423 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-02 20:19:09,423 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-02 20:19:09,423 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-02 20:19:09,423 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 305#L87-7true]) [2022-11-02 20:19:09,423 INFO L383 tUnfolder$Statistics]: this new event has 405 ancestors and is cut-off event [2022-11-02 20:19:09,424 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-02 20:19:09,424 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-02 20:19:09,424 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-02 20:19:09,424 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-02 20:19:09,507 INFO L130 PetriNetUnfolder]: 1426/9500 cut-off events. [2022-11-02 20:19:09,507 INFO L131 PetriNetUnfolder]: For 125/194 co-relation queries the response was YES. [2022-11-02 20:19:09,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12100 conditions, 9500 events. 1426/9500 cut-off events. For 125/194 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 91393 event pairs, 846 based on Foata normal form. 0/7916 useless extension candidates. Maximal degree in co-relation 12063. Up to 1457 conditions per place. [2022-11-02 20:19:09,601 INFO L137 encePairwiseOnDemand]: 517/536 looper letters, 169 selfloop transitions, 28 changer transitions 0/561 dead transitions. [2022-11-02 20:19:09,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 561 transitions, 1559 flow [2022-11-02 20:19:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:19:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:19:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4973 transitions. [2022-11-02 20:19:09,616 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8434531886024423 [2022-11-02 20:19:09,616 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 4973 transitions. [2022-11-02 20:19:09,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 4973 transitions. [2022-11-02 20:19:09,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:09,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 4973 transitions. [2022-11-02 20:19:09,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 452.09090909090907) internal successors, (4973), 11 states have internal predecessors, (4973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:09,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 536.0) internal successors, (6432), 12 states have internal predecessors, (6432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:09,647 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 536.0) internal successors, (6432), 12 states have internal predecessors, (6432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:09,647 INFO L175 Difference]: Start difference. First operand has 440 places, 439 transitions, 905 flow. Second operand 11 states and 4973 transitions. [2022-11-02 20:19:09,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 561 transitions, 1559 flow [2022-11-02 20:19:09,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 561 transitions, 1559 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:19:09,658 INFO L231 Difference]: Finished difference. Result has 454 places, 456 transitions, 1038 flow [2022-11-02 20:19:09,659 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1038, PETRI_PLACES=454, PETRI_TRANSITIONS=456} [2022-11-02 20:19:09,660 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -16 predicate places. [2022-11-02 20:19:09,660 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 456 transitions, 1038 flow [2022-11-02 20:19:09,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 439.0) internal successors, (3073), 7 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:09,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:09,662 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] [2022-11-02 20:19:09,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:19:09,662 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:19:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:09,663 INFO L85 PathProgramCache]: Analyzing trace with hash 966475415, now seen corresponding path program 1 times [2022-11-02 20:19:09,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:09,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969324467] [2022-11-02 20:19:09,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:09,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,735 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:19:09,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:09,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969324467] [2022-11-02 20:19:09,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969324467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:09,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:09,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306377538] [2022-11-02 20:19:09,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:09,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:09,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:09,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:09,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:09,741 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-02 20:19:09,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 456 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:09,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:09,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-02 20:19:09,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:10,563 INFO L130 PetriNetUnfolder]: 134/2993 cut-off events. [2022-11-02 20:19:10,563 INFO L131 PetriNetUnfolder]: For 122/157 co-relation queries the response was YES. [2022-11-02 20:19:10,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3401 conditions, 2993 events. 134/2993 cut-off events. For 122/157 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 20872 event pairs, 48 based on Foata normal form. 0/2725 useless extension candidates. Maximal degree in co-relation 3359. Up to 175 conditions per place. [2022-11-02 20:19:10,614 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 1 changer transitions 0/458 dead transitions. [2022-11-02 20:19:10,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 458 transitions, 1077 flow [2022-11-02 20:19:10,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:19:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1509 transitions. [2022-11-02 20:19:10,619 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9384328358208955 [2022-11-02 20:19:10,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1509 transitions. [2022-11-02 20:19:10,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1509 transitions. [2022-11-02 20:19:10,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:10,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1509 transitions. [2022-11-02 20:19:10,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 503.0) internal successors, (1509), 3 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:10,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:10,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:10,631 INFO L175 Difference]: Start difference. First operand has 454 places, 456 transitions, 1038 flow. Second operand 3 states and 1509 transitions. [2022-11-02 20:19:10,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 458 transitions, 1077 flow [2022-11-02 20:19:10,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 458 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:19:10,645 INFO L231 Difference]: Finished difference. Result has 453 places, 455 transitions, 1036 flow [2022-11-02 20:19:10,646 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=453, PETRI_TRANSITIONS=455} [2022-11-02 20:19:10,647 INFO L287 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-02 20:19:10,648 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 455 transitions, 1036 flow [2022-11-02 20:19:10,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:10,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:10,649 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] [2022-11-02 20:19:10,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:19:10,649 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-02 20:19:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash 319214509, now seen corresponding path program 1 times [2022-11-02 20:19:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:10,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475960320] [2022-11-02 20:19:10,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:11,328 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:19:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:11,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475960320] [2022-11-02 20:19:11,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475960320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:11,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:11,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:19:11,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558577378] [2022-11-02 20:19:11,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:11,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:11,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:11,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:11,335 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 536 [2022-11-02 20:19:11,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 455 transitions, 1036 flow. Second operand has 6 states, 6 states have (on average 430.0) internal successors, (2580), 6 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:11,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:11,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 536 [2022-11-02 20:19:11,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand