./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 6b4ec56b 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_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/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_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 12:38:40,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:38:40,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:38:40,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:38:40,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:38:40,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:38:40,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:38:40,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:38:40,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:38:40,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:38:40,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:38:40,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:38:40,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:38:40,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:38:40,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:38:40,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:38:40,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:38:40,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:38:40,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:38:40,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:38:40,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:38:40,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:38:40,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:38:40,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:38:40,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:38:40,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:38:40,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:38:40,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:38:40,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:38:40,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:38:40,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:38:40,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:38:40,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:38:40,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:38:40,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:38:40,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:38:40,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:38:40,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:38:40,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:38:40,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:38:40,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:38:40,835 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 12:38:40,870 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:38:40,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:38:40,871 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:38:40,871 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:38:40,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:38:40,872 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:38:40,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:38:40,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:38:40,881 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:38:40,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:38:40,881 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:38:40,881 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:38:40,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:38:40,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:38:40,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:38:40,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:38:40,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:38:40,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:38:40,883 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 12:38:40,883 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:38:40,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:38:40,884 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:38:40,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:38:40,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:38:40,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:38:40,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:38:40,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:38:40,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:38:40,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:38:40,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:38:40,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:38:40,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:38:40,887 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:38:40,887 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:38:40,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:38:40,888 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_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/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_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN 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-20 12:38:41,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:38:41,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:38:41,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:38:41,196 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:38:41,196 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:38:41,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-11-20 12:38:44,226 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:38:44,483 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:38:44,483 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-11-20 12:38:44,491 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/data/db9cf3c20/0691bcee815b49a587760b576636bd58/FLAG283c0ecd4 [2022-11-20 12:38:44,507 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/data/db9cf3c20/0691bcee815b49a587760b576636bd58 [2022-11-20 12:38:44,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:38:44,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:38:44,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:38:44,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:38:44,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:38:44,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:44,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4651bc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44, skipping insertion in model container [2022-11-20 12:38:44,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:44,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:38:44,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:38:44,764 WARN L237 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_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-11-20 12:38:44,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:38:44,784 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:38:44,818 WARN L237 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_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-11-20 12:38:44,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:38:44,840 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:38:44,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44 WrapperNode [2022-11-20 12:38:44,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:38:44,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:38:44,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:38:44,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:38:44,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:44,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:44,916 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 403 [2022-11-20 12:38:44,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:38:44,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:38:44,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:38:44,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:38:44,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:44,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:44,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:44,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:44,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:45,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:45,009 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:45,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:45,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:38:45,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:38:45,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:38:45,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:38:45,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (1/1) ... [2022-11-20 12:38:45,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:38:45,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:45,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:38:45,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95b3e4b8-a3bd-4003-97a5-0fa57f4984a3/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:38:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:38:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:38:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:38:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:38:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 12:38:45,125 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 12:38:45,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 12:38:45,125 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 12:38:45,126 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 12:38:45,126 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 12:38:45,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:38:45,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:38:45,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:38:45,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:38:45,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:38:45,128 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:38:45,334 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:38:45,337 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:38:46,169 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:38:46,186 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:38:46,186 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 12:38:46,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:38:46 BoogieIcfgContainer [2022-11-20 12:38:46,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:38:46,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:38:46,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:38:46,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:38:46,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:38:44" (1/3) ... [2022-11-20 12:38:46,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b6d49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:38:46, skipping insertion in model container [2022-11-20 12:38:46,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:38:44" (2/3) ... [2022-11-20 12:38:46,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b6d49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:38:46, skipping insertion in model container [2022-11-20 12:38:46,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:38:46" (3/3) ... [2022-11-20 12:38:46,214 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2022-11-20 12:38:46,223 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:38:46,234 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:38:46,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-11-20 12:38:46,235 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:38:46,444 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 12:38:46,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 517 places, 536 transitions, 1096 flow [2022-11-20 12:38:46,736 INFO L130 PetriNetUnfolder]: 29/533 cut-off events. [2022-11-20 12:38:46,736 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 12:38:46,754 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 918 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-20 12:38:46,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 517 places, 536 transitions, 1096 flow [2022-11-20 12:38:46,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 470 places, 486 transitions, 990 flow [2022-11-20 12:38:46,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:38:46,798 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;@1ed9d3e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:38:46,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-11-20 12:38:46,808 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-11-20 12:38:46,808 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:38:46,809 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:46,810 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:38:46,811 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-20 12:38:46,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1341404728, now seen corresponding path program 1 times [2022-11-20 12:38:46,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:46,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060342363] [2022-11-20 12:38:46,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:46,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:47,100 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-20 12:38:47,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:47,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060342363] [2022-11-20 12:38:47,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060342363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:47,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:47,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:38:47,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721890344] [2022-11-20 12:38:47,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:47,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:38:47,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:47,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:38:47,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:38:47,175 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 536 [2022-11-20 12:38:47,183 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-20 12:38:47,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:47,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 536 [2022-11-20 12:38:47,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:48,295 INFO L130 PetriNetUnfolder]: 204/3873 cut-off events. [2022-11-20 12:38:48,296 INFO L131 PetriNetUnfolder]: For 84/198 co-relation queries the response was YES. [2022-11-20 12:38:48,321 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 79. Compared 32936 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-20 12:38:48,345 INFO L137 encePairwiseOnDemand]: 513/536 looper letters, 27 selfloop transitions, 2 changer transitions 6/465 dead transitions. [2022-11-20 12:38:48,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 465 transitions, 1006 flow [2022-11-20 12:38:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:38:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:38:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1496 transitions. [2022-11-20 12:38:48,374 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9303482587064676 [2022-11-20 12:38:48,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1496 transitions. [2022-11-20 12:38:48,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1496 transitions. [2022-11-20 12:38:48,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:48,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1496 transitions. [2022-11-20 12:38:48,393 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-20 12:38:48,404 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-20 12:38:48,406 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-20 12:38:48,408 INFO L175 Difference]: Start difference. First operand has 470 places, 486 transitions, 990 flow. Second operand 3 states and 1496 transitions. [2022-11-20 12:38:48,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 465 transitions, 1006 flow [2022-11-20 12:38:48,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 465 transitions, 994 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 12:38:48,435 INFO L231 Difference]: Finished difference. Result has 465 places, 459 transitions, 928 flow [2022-11-20 12:38:48,438 INFO L271 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-20 12:38:48,443 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -5 predicate places. [2022-11-20 12:38:48,443 INFO L495 AbstractCegarLoop]: Abstraction has has 465 places, 459 transitions, 928 flow [2022-11-20 12:38:48,445 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-20 12:38:48,445 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:48,445 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:38:48,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:38:48,446 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-20 12:38:48,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:48,446 INFO L85 PathProgramCache]: Analyzing trace with hash -805986249, now seen corresponding path program 1 times [2022-11-20 12:38:48,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:48,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115015657] [2022-11-20 12:38:48,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:48,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:48,578 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-20 12:38:48,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:48,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115015657] [2022-11-20 12:38:48,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115015657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:48,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:48,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:38:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874337798] [2022-11-20 12:38:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:48,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:38:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:38:48,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:38:48,584 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 536 [2022-11-20 12:38:48,586 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-20 12:38:48,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:48,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 536 [2022-11-20 12:38:48,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:49,303 INFO L130 PetriNetUnfolder]: 100/2663 cut-off events. [2022-11-20 12:38:49,303 INFO L131 PetriNetUnfolder]: For 14/65 co-relation queries the response was YES. [2022-11-20 12:38:49,323 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 19670 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-20 12:38:49,338 INFO L137 encePairwiseOnDemand]: 529/536 looper letters, 19 selfloop transitions, 1 changer transitions 0/453 dead transitions. [2022-11-20 12:38:49,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 453 transitions, 956 flow [2022-11-20 12:38:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:38:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:38:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2022-11-20 12:38:49,344 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9210199004975125 [2022-11-20 12:38:49,344 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1481 transitions. [2022-11-20 12:38:49,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1481 transitions. [2022-11-20 12:38:49,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:49,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1481 transitions. [2022-11-20 12:38:49,350 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-20 12:38:49,354 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-20 12:38:49,355 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-20 12:38:49,355 INFO L175 Difference]: Start difference. First operand has 465 places, 459 transitions, 928 flow. Second operand 3 states and 1481 transitions. [2022-11-20 12:38:49,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 453 transitions, 956 flow [2022-11-20 12:38:49,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 453 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:38:49,367 INFO L231 Difference]: Finished difference. Result has 453 places, 453 transitions, 914 flow [2022-11-20 12:38:49,368 INFO L271 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-20 12:38:49,369 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-20 12:38:49,369 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 453 transitions, 914 flow [2022-11-20 12:38:49,371 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-20 12:38:49,371 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:49,372 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:38:49,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:38:49,372 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-20 12:38:49,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash 629444106, now seen corresponding path program 1 times [2022-11-20 12:38:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:49,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610226743] [2022-11-20 12:38:49,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:49,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:49,487 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-20 12:38:49,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:49,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610226743] [2022-11-20 12:38:49,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610226743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:49,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:49,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:38:49,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501575820] [2022-11-20 12:38:49,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:49,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:38:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:49,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:38:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:38:49,492 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 536 [2022-11-20 12:38:49,494 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-20 12:38:49,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:49,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 536 [2022-11-20 12:38:49,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:38:49,828 INFO L130 PetriNetUnfolder]: 43/1281 cut-off events. [2022-11-20 12:38:49,828 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-11-20 12:38:49,843 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 6137 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-20 12:38:49,850 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2022-11-20 12:38:49,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 946 flow [2022-11-20 12:38:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:38:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:38:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1500 transitions. [2022-11-20 12:38:49,855 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9328358208955224 [2022-11-20 12:38:49,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1500 transitions. [2022-11-20 12:38:49,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1500 transitions. [2022-11-20 12:38:49,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:49,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1500 transitions. [2022-11-20 12:38:49,860 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-20 12:38:49,863 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-20 12:38:49,865 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-20 12:38:49,865 INFO L175 Difference]: Start difference. First operand has 453 places, 453 transitions, 914 flow. Second operand 3 states and 1500 transitions. [2022-11-20 12:38:49,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 946 flow [2022-11-20 12:38:49,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 452 transitions, 945 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:38:49,874 INFO L231 Difference]: Finished difference. Result has 453 places, 452 transitions, 915 flow [2022-11-20 12:38:49,875 INFO L271 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-20 12:38:49,876 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-20 12:38:49,876 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 452 transitions, 915 flow [2022-11-20 12:38:49,877 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-20 12:38:49,877 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:49,878 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:38:49,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:38:49,878 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-20 12:38:49,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash -111013048, now seen corresponding path program 1 times [2022-11-20 12:38:49,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:49,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139555899] [2022-11-20 12:38:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:49,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:50,552 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-20 12:38:50,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:50,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139555899] [2022-11-20 12:38:50,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139555899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:38:50,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:38:50,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:38:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264706217] [2022-11-20 12:38:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:38:50,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:38:50,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:38:50,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:38:50,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:38:50,564 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 536 [2022-11-20 12:38:50,567 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-20 12:38:50,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:38:50,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 536 [2022-11-20 12:38:50,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:39:07,114 INFO L130 PetriNetUnfolder]: 27435/78367 cut-off events. [2022-11-20 12:39:07,115 INFO L131 PetriNetUnfolder]: For 380/3494 co-relation queries the response was YES. [2022-11-20 12:39:07,564 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 935388 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-20 12:39:08,055 INFO L137 encePairwiseOnDemand]: 518/536 looper letters, 93 selfloop transitions, 15 changer transitions 0/449 dead transitions. [2022-11-20 12:39:08,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 449 transitions, 1125 flow [2022-11-20 12:39:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:39:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 12:39:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2517 transitions. [2022-11-20 12:39:08,062 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7826492537313433 [2022-11-20 12:39:08,062 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2517 transitions. [2022-11-20 12:39:08,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2517 transitions. [2022-11-20 12:39:08,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:39:08,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2517 transitions. [2022-11-20 12:39:08,074 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-20 12:39:08,080 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-20 12:39:08,083 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-20 12:39:08,083 INFO L175 Difference]: Start difference. First operand has 453 places, 452 transitions, 915 flow. Second operand 6 states and 2517 transitions. [2022-11-20 12:39:08,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 449 transitions, 1125 flow [2022-11-20 12:39:08,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 449 transitions, 1121 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:39:08,094 INFO L231 Difference]: Finished difference. Result has 453 places, 449 transitions, 935 flow [2022-11-20 12:39:08,100 INFO L271 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-20 12:39:08,101 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-20 12:39:08,102 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 449 transitions, 935 flow [2022-11-20 12:39:08,103 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-20 12:39:08,104 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:39:08,104 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:08,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:39:08,105 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-20 12:39:08,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash 212005435, now seen corresponding path program 1 times [2022-11-20 12:39:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:39:08,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357221787] [2022-11-20 12:39:08,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:39:08,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:39:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:39:08,272 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-20 12:39:08,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:39:08,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357221787] [2022-11-20 12:39:08,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357221787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:08,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:08,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:39:08,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198832811] [2022-11-20 12:39:08,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:08,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:39:08,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:39:08,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:39:08,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:39:08,277 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 536 [2022-11-20 12:39:08,279 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-20 12:39:08,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:39:08,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 536 [2022-11-20 12:39:08,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:39:08,809 INFO L130 PetriNetUnfolder]: 66/1628 cut-off events. [2022-11-20 12:39:08,810 INFO L131 PetriNetUnfolder]: For 26/29 co-relation queries the response was YES. [2022-11-20 12:39:08,822 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 8780 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-20 12:39:08,828 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 2 changer transitions 0/448 dead transitions. [2022-11-20 12:39:08,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 448 transitions, 967 flow [2022-11-20 12:39:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:39:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:39:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1500 transitions. [2022-11-20 12:39:08,832 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9328358208955224 [2022-11-20 12:39:08,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1500 transitions. [2022-11-20 12:39:08,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1500 transitions. [2022-11-20 12:39:08,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:39:08,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1500 transitions. [2022-11-20 12:39:08,837 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-20 12:39:08,840 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-20 12:39:08,842 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-20 12:39:08,842 INFO L175 Difference]: Start difference. First operand has 453 places, 449 transitions, 935 flow. Second operand 3 states and 1500 transitions. [2022-11-20 12:39:08,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 448 transitions, 967 flow [2022-11-20 12:39:08,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 448 transitions, 937 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 12:39:08,850 INFO L231 Difference]: Finished difference. Result has 449 places, 448 transitions, 907 flow [2022-11-20 12:39:08,851 INFO L271 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-20 12:39:08,854 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -21 predicate places. [2022-11-20 12:39:08,855 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 448 transitions, 907 flow [2022-11-20 12:39:08,856 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-20 12:39:08,856 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:39:08,856 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:08,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:39:08,857 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-20 12:39:08,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:08,858 INFO L85 PathProgramCache]: Analyzing trace with hash 741170182, now seen corresponding path program 1 times [2022-11-20 12:39:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:39:08,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221440125] [2022-11-20 12:39:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:39:08,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:39:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:39:08,930 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-20 12:39:08,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:39:08,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221440125] [2022-11-20 12:39:08,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221440125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:08,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:08,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:39:08,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435333974] [2022-11-20 12:39:08,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:08,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:39:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:39:08,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:39:08,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:39:08,935 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 536 [2022-11-20 12:39:08,937 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-20 12:39:08,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:39:08,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 536 [2022-11-20 12:39:08,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:39:09,073 INFO L130 PetriNetUnfolder]: 21/688 cut-off events. [2022-11-20 12:39:09,074 INFO L131 PetriNetUnfolder]: For 16/19 co-relation queries the response was YES. [2022-11-20 12:39:09,079 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 10. Compared 1840 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-20 12:39:09,082 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2022-11-20 12:39:09,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 447 transitions, 939 flow [2022-11-20 12:39:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:39:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:39:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1500 transitions. [2022-11-20 12:39:09,086 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9328358208955224 [2022-11-20 12:39:09,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1500 transitions. [2022-11-20 12:39:09,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1500 transitions. [2022-11-20 12:39:09,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:39:09,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1500 transitions. [2022-11-20 12:39:09,091 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-20 12:39:09,094 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-20 12:39:09,095 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-20 12:39:09,095 INFO L175 Difference]: Start difference. First operand has 449 places, 448 transitions, 907 flow. Second operand 3 states and 1500 transitions. [2022-11-20 12:39:09,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 447 transitions, 939 flow [2022-11-20 12:39:09,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 447 transitions, 935 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:39:09,104 INFO L231 Difference]: Finished difference. Result has 448 places, 447 transitions, 905 flow [2022-11-20 12:39:09,105 INFO L271 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-20 12:39:09,105 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -22 predicate places. [2022-11-20 12:39:09,106 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 447 transitions, 905 flow [2022-11-20 12:39:09,107 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-20 12:39:09,107 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:39:09,107 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:09,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:39:09,108 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-20 12:39:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1313607301, now seen corresponding path program 1 times [2022-11-20 12:39:09,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:39:09,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627278358] [2022-11-20 12:39:09,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:39:09,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:39:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:39:09,197 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-20 12:39:09,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:39:09,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627278358] [2022-11-20 12:39:09,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627278358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:09,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:09,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:39:09,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772878943] [2022-11-20 12:39:09,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:09,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:39:09,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:39:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:39:09,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:39:09,202 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-20 12:39:09,203 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-20 12:39:09,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:39:09,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-20 12:39:09,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:39:09,313 INFO L130 PetriNetUnfolder]: 19/564 cut-off events. [2022-11-20 12:39:09,313 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-11-20 12:39:09,318 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 1569 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-20 12:39:09,321 INFO L137 encePairwiseOnDemand]: 531/536 looper letters, 12 selfloop transitions, 3 changer transitions 0/447 dead transitions. [2022-11-20 12:39:09,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 447 transitions, 937 flow [2022-11-20 12:39:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:39:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:39:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1508 transitions. [2022-11-20 12:39:09,324 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9378109452736318 [2022-11-20 12:39:09,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1508 transitions. [2022-11-20 12:39:09,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1508 transitions. [2022-11-20 12:39:09,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:39:09,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1508 transitions. [2022-11-20 12:39:09,329 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-20 12:39:09,341 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-20 12:39:09,342 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-20 12:39:09,342 INFO L175 Difference]: Start difference. First operand has 448 places, 447 transitions, 905 flow. Second operand 3 states and 1508 transitions. [2022-11-20 12:39:09,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 447 transitions, 937 flow [2022-11-20 12:39:09,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 447 transitions, 933 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:39:09,360 INFO L231 Difference]: Finished difference. Result has 446 places, 445 transitions, 903 flow [2022-11-20 12:39:09,361 INFO L271 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-20 12:39:09,362 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -24 predicate places. [2022-11-20 12:39:09,362 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 445 transitions, 903 flow [2022-11-20 12:39:09,363 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-20 12:39:09,364 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:39:09,364 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:09,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:39:09,364 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-20 12:39:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:09,365 INFO L85 PathProgramCache]: Analyzing trace with hash 343808445, now seen corresponding path program 1 times [2022-11-20 12:39:09,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:39:09,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753757969] [2022-11-20 12:39:09,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:39:09,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:39:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:39:09,431 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-20 12:39:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:39:09,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753757969] [2022-11-20 12:39:09,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753757969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:09,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:09,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:39:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079326064] [2022-11-20 12:39:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:09,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:39:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:39:09,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:39:09,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:39:09,437 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-20 12:39:09,439 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-20 12:39:09,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:39:09,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-20 12:39:09,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:39:09,680 INFO L130 PetriNetUnfolder]: 31/1132 cut-off events. [2022-11-20 12:39:09,680 INFO L131 PetriNetUnfolder]: For 13/15 co-relation queries the response was YES. [2022-11-20 12:39:09,693 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 4915 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-20 12:39:09,698 INFO L137 encePairwiseOnDemand]: 532/536 looper letters, 17 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2022-11-20 12:39:09,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 450 transitions, 956 flow [2022-11-20 12:39:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:39:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:39:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1512 transitions. [2022-11-20 12:39:09,702 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2022-11-20 12:39:09,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1512 transitions. [2022-11-20 12:39:09,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1512 transitions. [2022-11-20 12:39:09,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:39:09,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1512 transitions. [2022-11-20 12:39:09,711 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-20 12:39:09,714 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-20 12:39:09,715 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-20 12:39:09,715 INFO L175 Difference]: Start difference. First operand has 446 places, 445 transitions, 903 flow. Second operand 3 states and 1512 transitions. [2022-11-20 12:39:09,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 450 transitions, 956 flow [2022-11-20 12:39:09,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 450 transitions, 950 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:39:09,724 INFO L231 Difference]: Finished difference. Result has 445 places, 445 transitions, 907 flow [2022-11-20 12:39:09,725 INFO L271 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-20 12:39:09,729 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -25 predicate places. [2022-11-20 12:39:09,729 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 445 transitions, 907 flow [2022-11-20 12:39:09,730 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-20 12:39:09,730 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:39:09,730 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:09,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:39:09,731 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-20 12:39:09,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash 801371320, now seen corresponding path program 1 times [2022-11-20 12:39:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:39:09,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485581639] [2022-11-20 12:39:09,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:39:09,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:39:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:39:09,802 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-20 12:39:09,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:39:09,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485581639] [2022-11-20 12:39:09,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485581639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:09,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:09,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:39:09,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939268722] [2022-11-20 12:39:09,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:09,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:39:09,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:39:09,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:39:09,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:39:09,808 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-20 12:39:09,809 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-20 12:39:09,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:39:09,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-20 12:39:09,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:39:10,000 INFO L130 PetriNetUnfolder]: 31/782 cut-off events. [2022-11-20 12:39:10,000 INFO L131 PetriNetUnfolder]: For 20/55 co-relation queries the response was YES. [2022-11-20 12:39:10,007 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 3016 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-20 12:39:10,012 INFO L137 encePairwiseOnDemand]: 531/536 looper letters, 11 selfloop transitions, 2 changer transitions 4/445 dead transitions. [2022-11-20 12:39:10,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 445 transitions, 937 flow [2022-11-20 12:39:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:39:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:39:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2022-11-20 12:39:10,018 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9371890547263682 [2022-11-20 12:39:10,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1507 transitions. [2022-11-20 12:39:10,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1507 transitions. [2022-11-20 12:39:10,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:39:10,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1507 transitions. [2022-11-20 12:39:10,027 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-20 12:39:10,030 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-20 12:39:10,032 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-20 12:39:10,033 INFO L175 Difference]: Start difference. First operand has 445 places, 445 transitions, 907 flow. Second operand 3 states and 1507 transitions. [2022-11-20 12:39:10,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 445 transitions, 937 flow [2022-11-20 12:39:10,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 445 transitions, 937 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 12:39:10,043 INFO L231 Difference]: Finished difference. Result has 445 places, 439 transitions, 899 flow [2022-11-20 12:39:10,044 INFO L271 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-20 12:39:10,045 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -25 predicate places. [2022-11-20 12:39:10,045 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 439 transitions, 899 flow [2022-11-20 12:39:10,046 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-20 12:39:10,046 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:39:10,046 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:10,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:39:10,047 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-20 12:39:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:10,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1318734106, now seen corresponding path program 1 times [2022-11-20 12:39:10,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:39:10,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65456069] [2022-11-20 12:39:10,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:39:10,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:39:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:39:10,118 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-20 12:39:10,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:39:10,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65456069] [2022-11-20 12:39:10,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65456069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:10,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:10,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:39:10,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178278568] [2022-11-20 12:39:10,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:10,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:39:10,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:39:10,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:39:10,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:39:10,129 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-20 12:39:10,131 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-20 12:39:10,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:39:10,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-20 12:39:10,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:39:10,639 INFO L130 PetriNetUnfolder]: 73/1901 cut-off events. [2022-11-20 12:39:10,640 INFO L131 PetriNetUnfolder]: For 31/37 co-relation queries the response was YES. [2022-11-20 12:39:10,659 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 11644 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-20 12:39:10,666 INFO L137 encePairwiseOnDemand]: 532/536 looper letters, 16 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2022-11-20 12:39:10,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 443 transitions, 947 flow [2022-11-20 12:39:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:39:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:39:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2022-11-20 12:39:10,671 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9396766169154229 [2022-11-20 12:39:10,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1511 transitions. [2022-11-20 12:39:10,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1511 transitions. [2022-11-20 12:39:10,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:39:10,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1511 transitions. [2022-11-20 12:39:10,676 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-20 12:39:10,680 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-20 12:39:10,681 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-20 12:39:10,681 INFO L175 Difference]: Start difference. First operand has 445 places, 439 transitions, 899 flow. Second operand 3 states and 1511 transitions. [2022-11-20 12:39:10,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 443 transitions, 947 flow [2022-11-20 12:39:10,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 443 transitions, 943 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:39:10,689 INFO L231 Difference]: Finished difference. Result has 440 places, 439 transitions, 905 flow [2022-11-20 12:39:10,691 INFO L271 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-20 12:39:10,692 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -30 predicate places. [2022-11-20 12:39:10,692 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 439 transitions, 905 flow [2022-11-20 12:39:10,693 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-20 12:39:10,693 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:39:10,693 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:10,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:39:10,694 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-20 12:39:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:10,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1469836833, now seen corresponding path program 1 times [2022-11-20 12:39:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:39:10,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138383427] [2022-11-20 12:39:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:39:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:39:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:39:10,953 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-20 12:39:10,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:39:10,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138383427] [2022-11-20 12:39:10,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138383427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:10,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:10,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:39:10,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714016048] [2022-11-20 12:39:10,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:10,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:39:10,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:39:10,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:39:10,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:39:10,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 536 [2022-11-20 12:39:10,963 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-20 12:39:10,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:39:10,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 536 [2022-11-20 12:39:10,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:39:13,495 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-20 12:39:13,495 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,495 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,496 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,496 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,496 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-20 12:39:13,496 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,497 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,497 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,497 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,498 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-20 12:39:13,498 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,498 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,498 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,498 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,499 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-20 12:39:13,499 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,499 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,499 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,500 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,501 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-20 12:39:13,502 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,502 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,502 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,502 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,503 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-20 12:39:13,503 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,503 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,503 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,503 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,504 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-20 12:39:13,504 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,504 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,504 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,505 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,505 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-20 12:39:13,505 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,505 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,506 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,506 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,560 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-20 12:39:13,561 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-20 12:39:13,561 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,561 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,562 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,562 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,562 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-20 12:39:13,562 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-20 12:39:13,563 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,563 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,563 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,563 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,564 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-20 12:39:13,564 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-20 12:39:13,564 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,565 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,565 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,565 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,565 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-20 12:39:13,566 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-20 12:39:13,566 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,566 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,566 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,566 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,567 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-20 12:39:13,567 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-20 12:39:13,567 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,567 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,567 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,568 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,568 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-20 12:39:13,568 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-20 12:39:13,568 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,569 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,569 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,569 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,569 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-20 12:39:13,570 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-20 12:39:13,570 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,570 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,570 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,570 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,571 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-20 12:39:13,571 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-20 12:39:13,571 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-20 12:39:13,571 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-20 12:39:13,572 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,572 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 12:39:13,577 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-20 12:39:13,577 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-20 12:39:13,577 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 12:39:13,578 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,578 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-20 12:39:13,578 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-20 12:39:13,578 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-20 12:39:13,579 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 12:39:13,579 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,579 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-20 12:39:13,581 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-20 12:39:13,581 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-20 12:39:13,581 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 12:39:13,581 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,582 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-20 12:39:13,582 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-20 12:39:13,582 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-20 12:39:13,582 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 12:39:13,583 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,583 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-20 12:39:13,632 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-20 12:39:13,632 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,632 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 12:39:13,633 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,633 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-20 12:39:13,633 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-20 12:39:13,633 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-20 12:39:13,633 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,634 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 12:39:13,634 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,634 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-20 12:39:13,634 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-20 12:39:13,635 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-20 12:39:13,635 INFO L383 tUnfolder$Statistics]: this new event has 360 ancestors and is cut-off event [2022-11-20 12:39:13,635 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-20 12:39:13,635 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-20 12:39:13,636 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 12:39:13,636 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-20 12:39:13,636 INFO L383 tUnfolder$Statistics]: this new event has 360 ancestors and is cut-off event [2022-11-20 12:39:13,636 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 12:39:13,636 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-20 12:39:13,637 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-20 12:39:13,637 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-20 12:39:13,637 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,637 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 12:39:13,637 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-20 12:39:13,638 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,638 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-20 12:39:13,638 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-20 12:39:13,638 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,639 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 12:39:13,639 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-20 12:39:13,639 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-20 12:39:13,639 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-20 12:39:13,669 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-20 12:39:13,669 INFO L383 tUnfolder$Statistics]: this new event has 405 ancestors and is cut-off event [2022-11-20 12:39:13,669 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-20 12:39:13,669 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-20 12:39:13,669 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-20 12:39:13,670 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 12:39:13,670 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-20 12:39:13,670 INFO L383 tUnfolder$Statistics]: this new event has 405 ancestors and is cut-off event [2022-11-20 12:39:13,670 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 12:39:13,670 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-20 12:39:13,671 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-20 12:39:13,671 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-20 12:39:13,773 INFO L130 PetriNetUnfolder]: 1426/9500 cut-off events. [2022-11-20 12:39:13,773 INFO L131 PetriNetUnfolder]: For 125/194 co-relation queries the response was YES. [2022-11-20 12:39:13,848 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 91482 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-20 12:39:13,895 INFO L137 encePairwiseOnDemand]: 517/536 looper letters, 169 selfloop transitions, 28 changer transitions 0/561 dead transitions. [2022-11-20 12:39:13,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 561 transitions, 1559 flow [2022-11-20 12:39:13,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:39:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:39:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4973 transitions. [2022-11-20 12:39:13,909 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8434531886024423 [2022-11-20 12:39:13,910 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 4973 transitions. [2022-11-20 12:39:13,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 4973 transitions. [2022-11-20 12:39:13,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:39:13,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 4973 transitions. [2022-11-20 12:39:13,928 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-20 12:39:13,940 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-20 12:39:13,943 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-20 12:39:13,943 INFO L175 Difference]: Start difference. First operand has 440 places, 439 transitions, 905 flow. Second operand 11 states and 4973 transitions. [2022-11-20 12:39:13,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 561 transitions, 1559 flow [2022-11-20 12:39:13,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 561 transitions, 1559 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 12:39:13,955 INFO L231 Difference]: Finished difference. Result has 454 places, 456 transitions, 1038 flow [2022-11-20 12:39:13,956 INFO L271 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-20 12:39:13,956 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -16 predicate places. [2022-11-20 12:39:13,957 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 456 transitions, 1038 flow [2022-11-20 12:39:13,958 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-20 12:39:13,958 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:39:13,958 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:13,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:39:13,959 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-20 12:39:13,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash 966475415, now seen corresponding path program 1 times [2022-11-20 12:39:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:39:13,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102624582] [2022-11-20 12:39:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:39:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:39:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:39:14,040 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-20 12:39:14,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:39:14,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102624582] [2022-11-20 12:39:14,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102624582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:14,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:14,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:39:14,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106367296] [2022-11-20 12:39:14,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:14,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:39:14,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:39:14,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:39:14,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:39:14,046 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-20 12:39:14,048 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-20 12:39:14,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:39:14,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-20 12:39:14,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:39:14,789 INFO L130 PetriNetUnfolder]: 134/2993 cut-off events. [2022-11-20 12:39:14,789 INFO L131 PetriNetUnfolder]: For 122/157 co-relation queries the response was YES. [2022-11-20 12:39:14,819 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 20894 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-20 12:39:14,829 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 1 changer transitions 0/458 dead transitions. [2022-11-20 12:39:14,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 458 transitions, 1077 flow [2022-11-20 12:39:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:39:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:39:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1509 transitions. [2022-11-20 12:39:14,833 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9384328358208955 [2022-11-20 12:39:14,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1509 transitions. [2022-11-20 12:39:14,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1509 transitions. [2022-11-20 12:39:14,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:39:14,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1509 transitions. [2022-11-20 12:39:14,838 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-20 12:39:14,842 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-20 12:39:14,843 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-20 12:39:14,843 INFO L175 Difference]: Start difference. First operand has 454 places, 456 transitions, 1038 flow. Second operand 3 states and 1509 transitions. [2022-11-20 12:39:14,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 458 transitions, 1077 flow [2022-11-20 12:39:14,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 458 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:39:14,854 INFO L231 Difference]: Finished difference. Result has 453 places, 455 transitions, 1036 flow [2022-11-20 12:39:14,855 INFO L271 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-20 12:39:14,856 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-20 12:39:14,857 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 455 transitions, 1036 flow [2022-11-20 12:39:14,857 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-20 12:39:14,857 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:39:14,858 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:39:14,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:39:14,858 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-20 12:39:14,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:39:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash 319214509, now seen corresponding path program 1 times [2022-11-20 12:39:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:39:14,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45253213] [2022-11-20 12:39:14,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:39:14,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:39:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:39:15,373 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-20 12:39:15,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:39:15,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45253213] [2022-11-20 12:39:15,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45253213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:39:15,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:39:15,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:39:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309823133] [2022-11-20 12:39:15,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:39:15,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:39:15,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:39:15,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:39:15,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:39:15,379 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 536 [2022-11-20 12:39:15,382 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-20 12:39:15,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:39:15,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 536 [2022-11-20 12:39:15,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand