./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 846c6ea342419c7ea85c72de8af40f1cf8af72c22131b8a3f2ebdacec113c699 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:17:12,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:17:12,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:17:12,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:17:12,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:17:12,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:17:12,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:17:12,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:17:12,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:17:12,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:17:12,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:17:12,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:17:12,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:17:12,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:17:12,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:17:12,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:17:12,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:17:12,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:17:12,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:17:12,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:17:12,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:17:12,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:17:12,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:17:12,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:17:12,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:17:12,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:17:12,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:17:12,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:17:12,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:17:12,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:17:12,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:17:12,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:17:12,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:17:12,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:17:12,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:17:12,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:17:12,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:17:12,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:17:12,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:17:12,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:17:12,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:17:12,490 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 12:17:12,543 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:17:12,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:17:12,544 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:17:12,544 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:17:12,545 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:17:12,545 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:17:12,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:17:12,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:17:12,547 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:17:12,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:17:12,548 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:17:12,549 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:17:12,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:17:12,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:17:12,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:17:12,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:17:12,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:17:12,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:17:12,550 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 12:17:12,550 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:17:12,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:17:12,551 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:17:12,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:17:12,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:17:12,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:17:12,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:17:12,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:17:12,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:17:12,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:17:12,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:17:12,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:17:12,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:17:12,553 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:17:12,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:17:12,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:17:12,554 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_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 846c6ea342419c7ea85c72de8af40f1cf8af72c22131b8a3f2ebdacec113c699 [2022-11-16 12:17:12,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:17:12,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:17:12,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:17:12,970 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:17:12,971 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:17:12,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2022-11-16 12:17:13,062 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/data/4e49a80d0/9b439b25cffb4998b1065b9efe43c99a/FLAG1dc297ab6 [2022-11-16 12:17:13,633 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:17:13,634 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2022-11-16 12:17:13,643 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/data/4e49a80d0/9b439b25cffb4998b1065b9efe43c99a/FLAG1dc297ab6 [2022-11-16 12:17:13,946 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/data/4e49a80d0/9b439b25cffb4998b1065b9efe43c99a [2022-11-16 12:17:13,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:17:13,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:17:13,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:17:13,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:17:13,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:17:13,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:13" (1/1) ... [2022-11-16 12:17:13,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c19f6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:13, skipping insertion in model container [2022-11-16 12:17:13,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:13" (1/1) ... [2022-11-16 12:17:13,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:17:13,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:17:14,279 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c[2495,2508] [2022-11-16 12:17:14,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:17:14,306 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:17:14,362 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c[2495,2508] [2022-11-16 12:17:14,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:17:14,393 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:17:14,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14 WrapperNode [2022-11-16 12:17:14,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:17:14,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:17:14,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:17:14,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:17:14,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,480 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 240 [2022-11-16 12:17:14,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:17:14,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:17:14,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:17:14,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:17:14,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,553 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:17:14,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:17:14,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:17:14,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:17:14,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (1/1) ... [2022-11-16 12:17:14,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:17:14,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:14,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:17:14,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:17:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:17:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 12:17:14,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 12:17:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 12:17:14,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 12:17:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:17:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:17:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:17:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:17:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:17:14,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:17:14,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:17:14,681 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:17:14,817 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:17:14,820 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:17:15,443 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:17:15,468 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:17:15,468 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:17:15,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:15 BoogieIcfgContainer [2022-11-16 12:17:15,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:17:15,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:17:15,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:17:15,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:17:15,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:17:13" (1/3) ... [2022-11-16 12:17:15,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c00aa16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:15, skipping insertion in model container [2022-11-16 12:17:15,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:14" (2/3) ... [2022-11-16 12:17:15,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c00aa16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:15, skipping insertion in model container [2022-11-16 12:17:15,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:15" (3/3) ... [2022-11-16 12:17:15,492 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2022-11-16 12:17:15,503 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:17:15,519 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:17:15,519 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-16 12:17:15,520 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:17:15,750 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 12:17:15,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 322 transitions, 660 flow [2022-11-16 12:17:16,001 INFO L130 PetriNetUnfolder]: 18/320 cut-off events. [2022-11-16 12:17:16,001 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-16 12:17:16,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 320 events. 18/320 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 653 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 177. Up to 2 conditions per place. [2022-11-16 12:17:16,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 311 places, 322 transitions, 660 flow [2022-11-16 12:17:16,025 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 299 transitions, 610 flow [2022-11-16 12:17:16,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:17:16,045 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;@2b4f505c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:17:16,046 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-11-16 12:17:16,053 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-11-16 12:17:16,053 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:17:16,054 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:16,055 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-16 12:17:16,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:16,062 INFO L85 PathProgramCache]: Analyzing trace with hash 256179703, now seen corresponding path program 1 times [2022-11-16 12:17:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:16,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925935265] [2022-11-16 12:17:16,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:16,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:16,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:16,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925935265] [2022-11-16 12:17:16,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925935265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:16,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:16,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:16,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957263983] [2022-11-16 12:17:16,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:16,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:16,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:16,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:16,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:16,372 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-16 12:17:16,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 299 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:16,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:16,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-16 12:17:16,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:16,635 INFO L130 PetriNetUnfolder]: 34/629 cut-off events. [2022-11-16 12:17:16,635 INFO L131 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2022-11-16 12:17:16,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 629 events. 34/629 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2707 event pairs, 15 based on Foata normal form. 18/555 useless extension candidates. Maximal degree in co-relation 485. Up to 49 conditions per place. [2022-11-16 12:17:16,646 INFO L137 encePairwiseOnDemand]: 313/322 looper letters, 13 selfloop transitions, 2 changer transitions 2/292 dead transitions. [2022-11-16 12:17:16,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 292 transitions, 626 flow [2022-11-16 12:17:16,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2022-11-16 12:17:16,679 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.94824016563147 [2022-11-16 12:17:16,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 916 transitions. [2022-11-16 12:17:16,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 916 transitions. [2022-11-16 12:17:16,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:16,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 916 transitions. [2022-11-16 12:17:16,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:16,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:16,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:16,715 INFO L175 Difference]: Start difference. First operand has 290 places, 299 transitions, 610 flow. Second operand 3 states and 916 transitions. [2022-11-16 12:17:16,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 292 transitions, 626 flow [2022-11-16 12:17:16,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 292 transitions, 618 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:17:16,735 INFO L231 Difference]: Finished difference. Result has 287 places, 290 transitions, 588 flow [2022-11-16 12:17:16,739 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=287, PETRI_TRANSITIONS=290} [2022-11-16 12:17:16,747 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -3 predicate places. [2022-11-16 12:17:16,748 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 290 transitions, 588 flow [2022-11-16 12:17:16,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:16,749 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:16,749 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] [2022-11-16 12:17:16,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:17:16,752 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:16,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1762688841, now seen corresponding path program 1 times [2022-11-16 12:17:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:16,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461540166] [2022-11-16 12:17:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:16,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:16,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:16,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461540166] [2022-11-16 12:17:16,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461540166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:16,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:16,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:16,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797143550] [2022-11-16 12:17:16,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:16,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:16,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:16,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:16,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:16,924 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-16 12:17:16,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 290 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:16,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:16,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-16 12:17:16,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:17,169 INFO L130 PetriNetUnfolder]: 34/629 cut-off events. [2022-11-16 12:17:17,169 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-11-16 12:17:17,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 629 events. 34/629 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2709 event pairs, 15 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 654. Up to 49 conditions per place. [2022-11-16 12:17:17,178 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 13 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2022-11-16 12:17:17,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 289 transitions, 616 flow [2022-11-16 12:17:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2022-11-16 12:17:17,182 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2022-11-16 12:17:17,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 910 transitions. [2022-11-16 12:17:17,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 910 transitions. [2022-11-16 12:17:17,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:17,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 910 transitions. [2022-11-16 12:17:17,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,190 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,191 INFO L175 Difference]: Start difference. First operand has 287 places, 290 transitions, 588 flow. Second operand 3 states and 910 transitions. [2022-11-16 12:17:17,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 289 transitions, 616 flow [2022-11-16 12:17:17,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 289 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:17:17,202 INFO L231 Difference]: Finished difference. Result has 284 places, 289 transitions, 586 flow [2022-11-16 12:17:17,203 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=284, PETRI_TRANSITIONS=289} [2022-11-16 12:17:17,204 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -6 predicate places. [2022-11-16 12:17:17,204 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 289 transitions, 586 flow [2022-11-16 12:17:17,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,206 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:17,206 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] [2022-11-16 12:17:17,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:17:17,207 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1771786282, now seen corresponding path program 1 times [2022-11-16 12:17:17,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:17,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026985980] [2022-11-16 12:17:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:17,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:17,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026985980] [2022-11-16 12:17:17,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026985980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:17,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:17,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:17,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214177129] [2022-11-16 12:17:17,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:17,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:17,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:17,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:17,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:17,345 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 322 [2022-11-16 12:17:17,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 289 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:17,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 322 [2022-11-16 12:17:17,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:17,567 INFO L130 PetriNetUnfolder]: 65/844 cut-off events. [2022-11-16 12:17:17,567 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-16 12:17:17,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 844 events. 65/844 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4863 event pairs, 27 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 884. Up to 71 conditions per place. [2022-11-16 12:17:17,576 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 16 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2022-11-16 12:17:17,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 288 transitions, 620 flow [2022-11-16 12:17:17,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2022-11-16 12:17:17,581 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2022-11-16 12:17:17,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2022-11-16 12:17:17,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2022-11-16 12:17:17,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:17,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2022-11-16 12:17:17,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,590 INFO L175 Difference]: Start difference. First operand has 284 places, 289 transitions, 586 flow. Second operand 3 states and 904 transitions. [2022-11-16 12:17:17,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 288 transitions, 620 flow [2022-11-16 12:17:17,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 288 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:17:17,598 INFO L231 Difference]: Finished difference. Result has 283 places, 288 transitions, 584 flow [2022-11-16 12:17:17,598 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=283, PETRI_TRANSITIONS=288} [2022-11-16 12:17:17,602 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -7 predicate places. [2022-11-16 12:17:17,602 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 288 transitions, 584 flow [2022-11-16 12:17:17,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:17,604 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] [2022-11-16 12:17:17,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:17:17,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:17,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash 158111424, now seen corresponding path program 1 times [2022-11-16 12:17:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:17,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479014715] [2022-11-16 12:17:17,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:17,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:17,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:17,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479014715] [2022-11-16 12:17:17,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479014715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:17,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:17,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:17,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018285041] [2022-11-16 12:17:17,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:17,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:17,719 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 322 [2022-11-16 12:17:17,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 288 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:17,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 322 [2022-11-16 12:17:17,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:17,934 INFO L130 PetriNetUnfolder]: 69/925 cut-off events. [2022-11-16 12:17:17,935 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-16 12:17:17,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 925 events. 69/925 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5677 event pairs, 27 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 962. Up to 71 conditions per place. [2022-11-16 12:17:17,947 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 16 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2022-11-16 12:17:17,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 287 transitions, 618 flow [2022-11-16 12:17:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2022-11-16 12:17:17,951 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2022-11-16 12:17:17,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2022-11-16 12:17:17,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2022-11-16 12:17:17,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:17,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2022-11-16 12:17:17,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,965 INFO L175 Difference]: Start difference. First operand has 283 places, 288 transitions, 584 flow. Second operand 3 states and 904 transitions. [2022-11-16 12:17:17,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 287 transitions, 618 flow [2022-11-16 12:17:17,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 287 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:17:17,973 INFO L231 Difference]: Finished difference. Result has 282 places, 287 transitions, 582 flow [2022-11-16 12:17:17,975 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=282, PETRI_TRANSITIONS=287} [2022-11-16 12:17:17,977 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -8 predicate places. [2022-11-16 12:17:17,978 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 287 transitions, 582 flow [2022-11-16 12:17:17,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,985 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:17,986 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] [2022-11-16 12:17:17,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:17:17,986 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:17,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash 630059981, now seen corresponding path program 1 times [2022-11-16 12:17:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:17,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57433520] [2022-11-16 12:17:17,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:17,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:18,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:18,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57433520] [2022-11-16 12:17:18,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57433520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:18,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:18,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:18,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36622972] [2022-11-16 12:17:18,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:18,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:18,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:18,111 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 322 [2022-11-16 12:17:18,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 287 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:18,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 322 [2022-11-16 12:17:18,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:18,303 INFO L130 PetriNetUnfolder]: 61/758 cut-off events. [2022-11-16 12:17:18,303 INFO L131 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2022-11-16 12:17:18,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 758 events. 61/758 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4169 event pairs, 27 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 794. Up to 79 conditions per place. [2022-11-16 12:17:18,313 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 16 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2022-11-16 12:17:18,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 286 transitions, 616 flow [2022-11-16 12:17:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2022-11-16 12:17:18,317 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2022-11-16 12:17:18,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2022-11-16 12:17:18,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2022-11-16 12:17:18,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:18,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2022-11-16 12:17:18,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,325 INFO L175 Difference]: Start difference. First operand has 282 places, 287 transitions, 582 flow. Second operand 3 states and 904 transitions. [2022-11-16 12:17:18,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 286 transitions, 616 flow [2022-11-16 12:17:18,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 286 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:17:18,332 INFO L231 Difference]: Finished difference. Result has 281 places, 286 transitions, 580 flow [2022-11-16 12:17:18,333 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=281, PETRI_TRANSITIONS=286} [2022-11-16 12:17:18,336 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -9 predicate places. [2022-11-16 12:17:18,336 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 286 transitions, 580 flow [2022-11-16 12:17:18,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,337 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:18,338 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:18,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:17:18,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2071424859, now seen corresponding path program 1 times [2022-11-16 12:17:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:18,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172488989] [2022-11-16 12:17:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:18,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:18,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172488989] [2022-11-16 12:17:18,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172488989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:18,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:18,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:18,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686093085] [2022-11-16 12:17:18,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:18,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:18,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:18,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:18,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:18,448 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 322 [2022-11-16 12:17:18,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 286 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:18,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 322 [2022-11-16 12:17:18,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:18,674 INFO L130 PetriNetUnfolder]: 64/907 cut-off events. [2022-11-16 12:17:18,674 INFO L131 PetriNetUnfolder]: For 10/12 co-relation queries the response was YES. [2022-11-16 12:17:18,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 907 events. 64/907 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5562 event pairs, 27 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 937. Up to 76 conditions per place. [2022-11-16 12:17:18,683 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 16 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2022-11-16 12:17:18,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 285 transitions, 614 flow [2022-11-16 12:17:18,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2022-11-16 12:17:18,687 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2022-11-16 12:17:18,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2022-11-16 12:17:18,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2022-11-16 12:17:18,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:18,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2022-11-16 12:17:18,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,695 INFO L175 Difference]: Start difference. First operand has 281 places, 286 transitions, 580 flow. Second operand 3 states and 904 transitions. [2022-11-16 12:17:18,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 285 transitions, 614 flow [2022-11-16 12:17:18,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 285 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:17:18,703 INFO L231 Difference]: Finished difference. Result has 280 places, 285 transitions, 578 flow [2022-11-16 12:17:18,704 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=280, PETRI_TRANSITIONS=285} [2022-11-16 12:17:18,707 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -10 predicate places. [2022-11-16 12:17:18,708 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 285 transitions, 578 flow [2022-11-16 12:17:18,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,710 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:18,710 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] [2022-11-16 12:17:18,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:17:18,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:18,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1842906131, now seen corresponding path program 1 times [2022-11-16 12:17:18,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:18,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133861214] [2022-11-16 12:17:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:18,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:18,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133861214] [2022-11-16 12:17:18,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133861214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:18,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:18,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234404835] [2022-11-16 12:17:18,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:18,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:18,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:18,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:18,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:18,829 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-16 12:17:18,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 285 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:18,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-16 12:17:18,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:18,972 INFO L130 PetriNetUnfolder]: 48/746 cut-off events. [2022-11-16 12:17:18,972 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 12:17:18,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 746 events. 48/746 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4022 event pairs, 8 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 728. Up to 36 conditions per place. [2022-11-16 12:17:18,980 INFO L137 encePairwiseOnDemand]: 316/322 looper letters, 13 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2022-11-16 12:17:18,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 286 transitions, 613 flow [2022-11-16 12:17:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2022-11-16 12:17:18,985 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9451345755693582 [2022-11-16 12:17:18,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 913 transitions. [2022-11-16 12:17:18,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 913 transitions. [2022-11-16 12:17:18,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:18,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 913 transitions. [2022-11-16 12:17:18,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:18,993 INFO L175 Difference]: Start difference. First operand has 280 places, 285 transitions, 578 flow. Second operand 3 states and 913 transitions. [2022-11-16 12:17:18,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 286 transitions, 613 flow [2022-11-16 12:17:18,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 286 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:17:19,000 INFO L231 Difference]: Finished difference. Result has 278 places, 285 transitions, 589 flow [2022-11-16 12:17:19,001 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=589, PETRI_PLACES=278, PETRI_TRANSITIONS=285} [2022-11-16 12:17:19,002 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2022-11-16 12:17:19,002 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 285 transitions, 589 flow [2022-11-16 12:17:19,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:19,003 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:19,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:17:19,004 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash -549652323, now seen corresponding path program 1 times [2022-11-16 12:17:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:19,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135936184] [2022-11-16 12:17:19,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:19,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:19,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:19,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135936184] [2022-11-16 12:17:19,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135936184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:19,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:19,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:19,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671987568] [2022-11-16 12:17:19,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:19,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:19,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:19,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:19,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:19,056 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-16 12:17:19,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 285 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:19,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-16 12:17:19,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:19,222 INFO L130 PetriNetUnfolder]: 54/823 cut-off events. [2022-11-16 12:17:19,222 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 12:17:19,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 823 events. 54/823 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4778 event pairs, 8 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 740. Up to 36 conditions per place. [2022-11-16 12:17:19,229 INFO L137 encePairwiseOnDemand]: 316/322 looper letters, 13 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2022-11-16 12:17:19,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 286 transitions, 624 flow [2022-11-16 12:17:19,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2022-11-16 12:17:19,233 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9451345755693582 [2022-11-16 12:17:19,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 913 transitions. [2022-11-16 12:17:19,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 913 transitions. [2022-11-16 12:17:19,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:19,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 913 transitions. [2022-11-16 12:17:19,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,240 INFO L175 Difference]: Start difference. First operand has 278 places, 285 transitions, 589 flow. Second operand 3 states and 913 transitions. [2022-11-16 12:17:19,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 286 transitions, 624 flow [2022-11-16 12:17:19,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 286 transitions, 624 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:17:19,247 INFO L231 Difference]: Finished difference. Result has 278 places, 285 transitions, 604 flow [2022-11-16 12:17:19,248 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=278, PETRI_TRANSITIONS=285} [2022-11-16 12:17:19,248 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2022-11-16 12:17:19,249 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 285 transitions, 604 flow [2022-11-16 12:17:19,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,249 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:19,250 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] [2022-11-16 12:17:19,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:17:19,250 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:19,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2048311196, now seen corresponding path program 1 times [2022-11-16 12:17:19,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:19,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197066247] [2022-11-16 12:17:19,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:19,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:19,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197066247] [2022-11-16 12:17:19,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197066247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:19,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:19,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:19,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273861985] [2022-11-16 12:17:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:19,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:19,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:19,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:19,301 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-16 12:17:19,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 285 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:19,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-16 12:17:19,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:19,472 INFO L130 PetriNetUnfolder]: 56/979 cut-off events. [2022-11-16 12:17:19,472 INFO L131 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2022-11-16 12:17:19,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 979 events. 56/979 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6082 event pairs, 4 based on Foata normal form. 0/856 useless extension candidates. Maximal degree in co-relation 903. Up to 55 conditions per place. [2022-11-16 12:17:19,483 INFO L137 encePairwiseOnDemand]: 316/322 looper letters, 15 selfloop transitions, 3 changer transitions 0/288 dead transitions. [2022-11-16 12:17:19,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 288 transitions, 649 flow [2022-11-16 12:17:19,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2022-11-16 12:17:19,487 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9472049689440993 [2022-11-16 12:17:19,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 915 transitions. [2022-11-16 12:17:19,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 915 transitions. [2022-11-16 12:17:19,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:19,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 915 transitions. [2022-11-16 12:17:19,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,494 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,494 INFO L175 Difference]: Start difference. First operand has 278 places, 285 transitions, 604 flow. Second operand 3 states and 915 transitions. [2022-11-16 12:17:19,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 288 transitions, 649 flow [2022-11-16 12:17:19,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 288 transitions, 649 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:17:19,531 INFO L231 Difference]: Finished difference. Result has 278 places, 285 transitions, 619 flow [2022-11-16 12:17:19,532 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=278, PETRI_TRANSITIONS=285} [2022-11-16 12:17:19,533 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2022-11-16 12:17:19,533 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 285 transitions, 619 flow [2022-11-16 12:17:19,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,534 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:19,535 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] [2022-11-16 12:17:19,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:17:19,535 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:19,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1357419489, now seen corresponding path program 1 times [2022-11-16 12:17:19,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:19,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001145694] [2022-11-16 12:17:19,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:19,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:19,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:19,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001145694] [2022-11-16 12:17:19,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001145694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:19,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:19,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:19,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424965392] [2022-11-16 12:17:19,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:19,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:19,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:19,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:19,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:19,602 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 322 [2022-11-16 12:17:19,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 285 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:19,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 322 [2022-11-16 12:17:19,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:19,793 INFO L130 PetriNetUnfolder]: 42/822 cut-off events. [2022-11-16 12:17:19,794 INFO L131 PetriNetUnfolder]: For 4/8 co-relation queries the response was YES. [2022-11-16 12:17:19,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 822 events. 42/822 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4876 event pairs, 4 based on Foata normal form. 1/727 useless extension candidates. Maximal degree in co-relation 775. Up to 37 conditions per place. [2022-11-16 12:17:19,803 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 16 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2022-11-16 12:17:19,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 285 transitions, 656 flow [2022-11-16 12:17:19,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 907 transitions. [2022-11-16 12:17:19,806 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9389233954451346 [2022-11-16 12:17:19,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 907 transitions. [2022-11-16 12:17:19,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 907 transitions. [2022-11-16 12:17:19,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:19,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 907 transitions. [2022-11-16 12:17:19,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,814 INFO L175 Difference]: Start difference. First operand has 278 places, 285 transitions, 619 flow. Second operand 3 states and 907 transitions. [2022-11-16 12:17:19,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 285 transitions, 656 flow [2022-11-16 12:17:19,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 285 transitions, 656 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:17:19,822 INFO L231 Difference]: Finished difference. Result has 279 places, 284 transitions, 621 flow [2022-11-16 12:17:19,823 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=279, PETRI_TRANSITIONS=284} [2022-11-16 12:17:19,823 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -11 predicate places. [2022-11-16 12:17:19,824 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 284 transitions, 621 flow [2022-11-16 12:17:19,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,825 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:19,825 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:19,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:17:19,825 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:19,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1655738776, now seen corresponding path program 1 times [2022-11-16 12:17:19,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:19,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679060370] [2022-11-16 12:17:19,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:19,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:19,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679060370] [2022-11-16 12:17:19,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679060370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:19,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:19,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:19,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277415631] [2022-11-16 12:17:19,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:19,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:19,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:19,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:19,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:19,876 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-16 12:17:19,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 284 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:19,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:19,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-16 12:17:19,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:20,089 INFO L130 PetriNetUnfolder]: 60/1101 cut-off events. [2022-11-16 12:17:20,090 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-11-16 12:17:20,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 1101 events. 60/1101 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7306 event pairs, 7 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1062. Up to 47 conditions per place. [2022-11-16 12:17:20,099 INFO L137 encePairwiseOnDemand]: 316/322 looper letters, 15 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2022-11-16 12:17:20,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 287 transitions, 666 flow [2022-11-16 12:17:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2022-11-16 12:17:20,103 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9472049689440993 [2022-11-16 12:17:20,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 915 transitions. [2022-11-16 12:17:20,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 915 transitions. [2022-11-16 12:17:20,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:20,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 915 transitions. [2022-11-16 12:17:20,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:20,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:20,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:20,110 INFO L175 Difference]: Start difference. First operand has 279 places, 284 transitions, 621 flow. Second operand 3 states and 915 transitions. [2022-11-16 12:17:20,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 287 transitions, 666 flow [2022-11-16 12:17:20,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 287 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:17:20,117 INFO L231 Difference]: Finished difference. Result has 277 places, 284 transitions, 632 flow [2022-11-16 12:17:20,117 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=277, PETRI_TRANSITIONS=284} [2022-11-16 12:17:20,118 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -13 predicate places. [2022-11-16 12:17:20,118 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 284 transitions, 632 flow [2022-11-16 12:17:20,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:20,119 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:20,119 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] [2022-11-16 12:17:20,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:17:20,120 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:20,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash 505544277, now seen corresponding path program 1 times [2022-11-16 12:17:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:20,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885643301] [2022-11-16 12:17:20,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:20,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:20,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:20,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885643301] [2022-11-16 12:17:20,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885643301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:20,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:20,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:17:20,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016535777] [2022-11-16 12:17:20,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:20,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:17:20,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:20,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:17:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:17:20,627 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 322 [2022-11-16 12:17:20,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 284 transitions, 632 flow. Second operand has 6 states, 6 states have (on average 293.8333333333333) internal successors, (1763), 6 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:20,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:20,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 322 [2022-11-16 12:17:20,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:20,836 INFO L130 PetriNetUnfolder]: 35/784 cut-off events. [2022-11-16 12:17:20,837 INFO L131 PetriNetUnfolder]: For 2/16 co-relation queries the response was YES. [2022-11-16 12:17:20,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 784 events. 35/784 cut-off events. For 2/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4360 event pairs, 0 based on Foata normal form. 8/705 useless extension candidates. Maximal degree in co-relation 714. Up to 20 conditions per place. [2022-11-16 12:17:20,846 INFO L137 encePairwiseOnDemand]: 317/322 looper letters, 15 selfloop transitions, 4 changer transitions 0/283 dead transitions. [2022-11-16 12:17:20,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 283 transitions, 668 flow [2022-11-16 12:17:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:17:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:17:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1772 transitions. [2022-11-16 12:17:20,852 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.917184265010352 [2022-11-16 12:17:20,853 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1772 transitions. [2022-11-16 12:17:20,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1772 transitions. [2022-11-16 12:17:20,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:20,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1772 transitions. [2022-11-16 12:17:20,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 295.3333333333333) internal successors, (1772), 6 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:20,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:20,885 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:20,885 INFO L175 Difference]: Start difference. First operand has 277 places, 284 transitions, 632 flow. Second operand 6 states and 1772 transitions. [2022-11-16 12:17:20,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 283 transitions, 668 flow [2022-11-16 12:17:20,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 283 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:17:20,893 INFO L231 Difference]: Finished difference. Result has 281 places, 283 transitions, 638 flow [2022-11-16 12:17:20,894 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=638, PETRI_PLACES=281, PETRI_TRANSITIONS=283} [2022-11-16 12:17:20,895 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -9 predicate places. [2022-11-16 12:17:20,896 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 283 transitions, 638 flow [2022-11-16 12:17:20,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.8333333333333) internal successors, (1763), 6 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:20,897 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:20,897 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] [2022-11-16 12:17:20,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:17:20,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:20,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:20,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1615907656, now seen corresponding path program 1 times [2022-11-16 12:17:20,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:20,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089426829] [2022-11-16 12:17:20,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:20,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:20,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089426829] [2022-11-16 12:17:20,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089426829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:20,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:20,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:20,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692940427] [2022-11-16 12:17:20,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:20,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:20,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:20,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:20,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:20,973 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 322 [2022-11-16 12:17:20,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 283 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:20,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:20,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 322 [2022-11-16 12:17:20,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:21,199 INFO L130 PetriNetUnfolder]: 45/1188 cut-off events. [2022-11-16 12:17:21,200 INFO L131 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2022-11-16 12:17:21,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 1188 events. 45/1188 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7374 event pairs, 2 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 1174. Up to 42 conditions per place. [2022-11-16 12:17:21,213 INFO L137 encePairwiseOnDemand]: 318/322 looper letters, 13 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2022-11-16 12:17:21,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 286 transitions, 677 flow [2022-11-16 12:17:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2022-11-16 12:17:21,217 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2022-11-16 12:17:21,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 920 transitions. [2022-11-16 12:17:21,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 920 transitions. [2022-11-16 12:17:21,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:21,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 920 transitions. [2022-11-16 12:17:21,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,225 INFO L175 Difference]: Start difference. First operand has 281 places, 283 transitions, 638 flow. Second operand 3 states and 920 transitions. [2022-11-16 12:17:21,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 286 transitions, 677 flow [2022-11-16 12:17:21,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 286 transitions, 670 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:17:21,237 INFO L231 Difference]: Finished difference. Result has 278 places, 283 transitions, 641 flow [2022-11-16 12:17:21,237 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=278, PETRI_TRANSITIONS=283} [2022-11-16 12:17:21,239 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2022-11-16 12:17:21,239 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 283 transitions, 641 flow [2022-11-16 12:17:21,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,240 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:21,240 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] [2022-11-16 12:17:21,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:17:21,241 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:21,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:21,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1994973241, now seen corresponding path program 1 times [2022-11-16 12:17:21,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:21,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211676177] [2022-11-16 12:17:21,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:21,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:21,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211676177] [2022-11-16 12:17:21,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211676177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:21,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:21,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:21,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247182511] [2022-11-16 12:17:21,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:21,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:21,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:21,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:21,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:21,290 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 322 [2022-11-16 12:17:21,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 283 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:21,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 322 [2022-11-16 12:17:21,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:21,445 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][167], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 233#L50-39true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-16 12:17:21,446 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-16 12:17:21,446 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 12:17:21,446 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 12:17:21,446 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 12:17:21,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][169], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 376#(= |#race~result_7~0| |thread2Thread1of1ForFork1_#t~nondet12#1|), Black: 357#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0)]) [2022-11-16 12:17:21,451 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-16 12:17:21,451 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 12:17:21,451 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 12:17:21,452 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 12:17:21,457 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][169], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 376#(= |#race~result_7~0| |thread2Thread1of1ForFork1_#t~nondet12#1|), Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 293#L50-41true]) [2022-11-16 12:17:21,457 INFO L383 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-11-16 12:17:21,457 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 12:17:21,458 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 12:17:21,458 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 12:17:21,464 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([812] L50-38-->L50-39: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet12#1][133], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 233#L50-39true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-16 12:17:21,464 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-11-16 12:17:21,464 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 12:17:21,464 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 12:17:21,465 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 12:17:21,465 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([812] L50-38-->L50-39: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet12#1][133], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 233#L50-39true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-16 12:17:21,465 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-16 12:17:21,465 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 12:17:21,466 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 12:17:21,466 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 12:17:21,466 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 12:17:21,470 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][167], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), Black: 357#true, 345#(= |#race~isNull_3~0| 0), 25#L52true, Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-16 12:17:21,470 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-16 12:17:21,470 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 12:17:21,471 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-16 12:17:21,471 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-16 12:17:21,481 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][167], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 233#L50-39true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-16 12:17:21,482 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-16 12:17:21,482 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 12:17:21,482 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is not cut-off event [2022-11-16 12:17:21,482 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is not cut-off event [2022-11-16 12:17:21,482 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is not cut-off event [2022-11-16 12:17:21,483 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][169], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 376#(= |#race~result_7~0| |thread2Thread1of1ForFork1_#t~nondet12#1|), 359#(= |#race~filename_5~0| 0), Black: 357#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0)]) [2022-11-16 12:17:21,483 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-16 12:17:21,483 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 12:17:21,484 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-11-16 12:17:21,484 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 12:17:21,484 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 12:17:21,485 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][169], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 376#(= |#race~result_7~0| |thread2Thread1of1ForFork1_#t~nondet12#1|), 359#(= |#race~filename_5~0| 0), Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 293#L50-41true]) [2022-11-16 12:17:21,486 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-16 12:17:21,486 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 12:17:21,486 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 12:17:21,486 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-11-16 12:17:21,487 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 12:17:21,493 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][167], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), Black: 357#true, 345#(= |#race~isNull_3~0| 0), 25#L52true, Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-16 12:17:21,493 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is not cut-off event [2022-11-16 12:17:21,493 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is not cut-off event [2022-11-16 12:17:21,493 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is not cut-off event [2022-11-16 12:17:21,494 INFO L386 tUnfolder$Statistics]: existing Event has 185 ancestors and is not cut-off event [2022-11-16 12:17:21,494 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is not cut-off event [2022-11-16 12:17:21,507 INFO L130 PetriNetUnfolder]: 70/1081 cut-off events. [2022-11-16 12:17:21,508 INFO L131 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2022-11-16 12:17:21,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 1081 events. 70/1081 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6468 event pairs, 6 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1248. Up to 101 conditions per place. [2022-11-16 12:17:21,520 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 15 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2022-11-16 12:17:21,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 283 transitions, 676 flow [2022-11-16 12:17:21,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2022-11-16 12:17:21,523 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.937888198757764 [2022-11-16 12:17:21,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 906 transitions. [2022-11-16 12:17:21,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 906 transitions. [2022-11-16 12:17:21,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:21,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 906 transitions. [2022-11-16 12:17:21,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,530 INFO L175 Difference]: Start difference. First operand has 278 places, 283 transitions, 641 flow. Second operand 3 states and 906 transitions. [2022-11-16 12:17:21,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 283 transitions, 676 flow [2022-11-16 12:17:21,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 283 transitions, 676 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:17:21,538 INFO L231 Difference]: Finished difference. Result has 279 places, 282 transitions, 643 flow [2022-11-16 12:17:21,538 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=279, PETRI_TRANSITIONS=282} [2022-11-16 12:17:21,539 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -11 predicate places. [2022-11-16 12:17:21,539 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 282 transitions, 643 flow [2022-11-16 12:17:21,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,540 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:21,541 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] [2022-11-16 12:17:21,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:17:21,541 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:21,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1890878389, now seen corresponding path program 1 times [2022-11-16 12:17:21,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:21,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525232833] [2022-11-16 12:17:21,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:21,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:21,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:21,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525232833] [2022-11-16 12:17:21,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525232833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:21,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:21,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:21,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533372218] [2022-11-16 12:17:21,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:21,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:21,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:21,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:21,585 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 322 [2022-11-16 12:17:21,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 282 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:21,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 322 [2022-11-16 12:17:21,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:21,821 INFO L130 PetriNetUnfolder]: 46/1212 cut-off events. [2022-11-16 12:17:21,821 INFO L131 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2022-11-16 12:17:21,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 1212 events. 46/1212 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7566 event pairs, 4 based on Foata normal form. 0/1127 useless extension candidates. Maximal degree in co-relation 1269. Up to 43 conditions per place. [2022-11-16 12:17:21,833 INFO L137 encePairwiseOnDemand]: 318/322 looper letters, 13 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2022-11-16 12:17:21,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 285 transitions, 682 flow [2022-11-16 12:17:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2022-11-16 12:17:21,837 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2022-11-16 12:17:21,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 920 transitions. [2022-11-16 12:17:21,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 920 transitions. [2022-11-16 12:17:21,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:21,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 920 transitions. [2022-11-16 12:17:21,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,844 INFO L175 Difference]: Start difference. First operand has 279 places, 282 transitions, 643 flow. Second operand 3 states and 920 transitions. [2022-11-16 12:17:21,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 285 transitions, 682 flow [2022-11-16 12:17:21,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 285 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:17:21,852 INFO L231 Difference]: Finished difference. Result has 278 places, 282 transitions, 649 flow [2022-11-16 12:17:21,852 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=278, PETRI_TRANSITIONS=282} [2022-11-16 12:17:21,853 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2022-11-16 12:17:21,853 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 282 transitions, 649 flow [2022-11-16 12:17:21,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:21,854 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:21,854 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] [2022-11-16 12:17:21,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:17:21,855 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:21,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:21,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1522544873, now seen corresponding path program 1 times [2022-11-16 12:17:21,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:21,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016804492] [2022-11-16 12:17:21,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:21,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:22,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:22,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016804492] [2022-11-16 12:17:22,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016804492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:22,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:22,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:17:22,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774110600] [2022-11-16 12:17:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:22,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:17:22,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:22,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:17:22,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:17:22,344 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 322 [2022-11-16 12:17:22,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 282 transitions, 649 flow. Second operand has 6 states, 6 states have (on average 294.8333333333333) internal successors, (1769), 6 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:22,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:22,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 322 [2022-11-16 12:17:22,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:22,516 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread2EXIT-->L69-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][233], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 359#(= |#race~filename_5~0| 0), Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), 371#(= |#race~filename_1~0| 0), Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 340#(= |#race~isNull_0~0| 0), 121#L69-7true, Black: 378#true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|))))]) [2022-11-16 12:17:22,516 INFO L383 tUnfolder$Statistics]: this new event has 159 ancestors and is cut-off event [2022-11-16 12:17:22,516 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 12:17:22,517 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-16 12:17:22,517 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 12:17:22,522 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([879] thread2EXIT-->L69-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][233], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 359#(= |#race~filename_5~0| 0), Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 371#(= |#race~filename_1~0| 0), 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 340#(= |#race~isNull_0~0| 0), Black: 378#true, 121#L69-7true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|))))]) [2022-11-16 12:17:22,522 INFO L383 tUnfolder$Statistics]: this new event has 159 ancestors and is not cut-off event [2022-11-16 12:17:22,523 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is not cut-off event [2022-11-16 12:17:22,523 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 12:17:22,523 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is not cut-off event [2022-11-16 12:17:22,523 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is not cut-off event [2022-11-16 12:17:22,528 INFO L130 PetriNetUnfolder]: 35/1018 cut-off events. [2022-11-16 12:17:22,528 INFO L131 PetriNetUnfolder]: For 5/50 co-relation queries the response was YES. [2022-11-16 12:17:22,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 1018 events. 35/1018 cut-off events. For 5/50 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5828 event pairs, 0 based on Foata normal form. 8/955 useless extension candidates. Maximal degree in co-relation 1075. Up to 24 conditions per place. [2022-11-16 12:17:22,539 INFO L137 encePairwiseOnDemand]: 317/322 looper letters, 14 selfloop transitions, 4 changer transitions 0/281 dead transitions. [2022-11-16 12:17:22,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 281 transitions, 683 flow [2022-11-16 12:17:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:17:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:17:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1771 transitions. [2022-11-16 12:17:22,543 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2022-11-16 12:17:22,544 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1771 transitions. [2022-11-16 12:17:22,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1771 transitions. [2022-11-16 12:17:22,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:22,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1771 transitions. [2022-11-16 12:17:22,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 295.1666666666667) internal successors, (1771), 6 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:22,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:22,553 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:22,553 INFO L175 Difference]: Start difference. First operand has 278 places, 282 transitions, 649 flow. Second operand 6 states and 1771 transitions. [2022-11-16 12:17:22,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 281 transitions, 683 flow [2022-11-16 12:17:22,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 281 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:17:22,560 INFO L231 Difference]: Finished difference. Result has 282 places, 281 transitions, 655 flow [2022-11-16 12:17:22,561 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=655, PETRI_PLACES=282, PETRI_TRANSITIONS=281} [2022-11-16 12:17:22,561 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -8 predicate places. [2022-11-16 12:17:22,561 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 281 transitions, 655 flow [2022-11-16 12:17:22,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 294.8333333333333) internal successors, (1769), 6 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:22,562 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:22,563 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-16 12:17:22,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:17:22,563 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:22,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:22,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1930169373, now seen corresponding path program 1 times [2022-11-16 12:17:22,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:22,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812367721] [2022-11-16 12:17:22,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:22,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:22,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:22,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812367721] [2022-11-16 12:17:22,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812367721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:22,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:22,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828911329] [2022-11-16 12:17:22,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:22,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:22,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:22,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:22,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:22,636 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-16 12:17:22,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 281 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:22,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:22,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-16 12:17:22,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:22,856 INFO L130 PetriNetUnfolder]: 46/1204 cut-off events. [2022-11-16 12:17:22,857 INFO L131 PetriNetUnfolder]: For 6/10 co-relation queries the response was YES. [2022-11-16 12:17:22,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 1204 events. 46/1204 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7620 event pairs, 6 based on Foata normal form. 0/1130 useless extension candidates. Maximal degree in co-relation 1234. Up to 30 conditions per place. [2022-11-16 12:17:22,869 INFO L137 encePairwiseOnDemand]: 318/322 looper letters, 11 selfloop transitions, 1 changer transitions 0/278 dead transitions. [2022-11-16 12:17:22,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 278 transitions, 673 flow [2022-11-16 12:17:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 909 transitions. [2022-11-16 12:17:22,872 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9409937888198758 [2022-11-16 12:17:22,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 909 transitions. [2022-11-16 12:17:22,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 909 transitions. [2022-11-16 12:17:22,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:22,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 909 transitions. [2022-11-16 12:17:22,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:22,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:22,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:22,878 INFO L175 Difference]: Start difference. First operand has 282 places, 281 transitions, 655 flow. Second operand 3 states and 909 transitions. [2022-11-16 12:17:22,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 278 transitions, 673 flow [2022-11-16 12:17:22,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 278 transitions, 666 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:17:22,884 INFO L231 Difference]: Finished difference. Result has 277 places, 278 transitions, 644 flow [2022-11-16 12:17:22,885 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=277, PETRI_TRANSITIONS=278} [2022-11-16 12:17:22,885 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -13 predicate places. [2022-11-16 12:17:22,886 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 278 transitions, 644 flow [2022-11-16 12:17:22,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:22,886 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:17:22,886 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:22,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:17:22,887 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-16 12:17:22,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:22,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1379517378, now seen corresponding path program 1 times [2022-11-16 12:17:22,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:22,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366322164] [2022-11-16 12:17:22,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:22,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:22,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:22,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366322164] [2022-11-16 12:17:22,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366322164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:22,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:22,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:17:22,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688116851] [2022-11-16 12:17:22,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:22,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:22,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:22,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:22,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:22,952 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-16 12:17:22,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 278 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:22,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:17:22,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-16 12:17:22,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:17:23,098 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][166], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 394#true, Black: 357#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), Black: 378#true]) [2022-11-16 12:17:23,098 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-16 12:17:23,099 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 12:17:23,099 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 12:17:23,099 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 12:17:23,101 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][166], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 394#true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 293#L50-41true, Black: 378#true]) [2022-11-16 12:17:23,101 INFO L383 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-11-16 12:17:23,101 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 12:17:23,102 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 12:17:23,102 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 12:17:23,105 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([816] L50-39-->L50-40: Formula: (= |v_thread2Thread1of1ForFork1_#t~nondet12#1_3| |v_#race~result_7~0_1|) InVars {thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][140], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), Black: 357#true, 394#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), Black: 378#true]) [2022-11-16 12:17:23,105 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-16 12:17:23,105 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 12:17:23,106 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-11-16 12:17:23,106 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 12:17:23,106 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([816] L50-39-->L50-40: Formula: (= |v_thread2Thread1of1ForFork1_#t~nondet12#1_3| |v_#race~result_7~0_1|) InVars {thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][140], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 394#true, Black: 357#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), Black: 378#true]) [2022-11-16 12:17:23,106 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-11-16 12:17:23,106 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 12:17:23,107 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-11-16 12:17:23,107 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 12:17:23,107 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 12:17:23,133 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][166], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 394#true, Black: 357#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 371#(= |#race~filename_1~0| 0), 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 340#(= |#race~isNull_0~0| 0), Black: 378#true]) [2022-11-16 12:17:23,133 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is not cut-off event [2022-11-16 12:17:23,134 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is not cut-off event [2022-11-16 12:17:23,134 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is not cut-off event [2022-11-16 12:17:23,134 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is not cut-off event [2022-11-16 12:17:23,134 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is not cut-off event [2022-11-16 12:17:23,135 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][166], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 394#true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 371#(= |#race~filename_1~0| 0), 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 340#(= |#race~isNull_0~0| 0), Black: 378#true, 293#L50-41true]) [2022-11-16 12:17:23,136 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is not cut-off event [2022-11-16 12:17:23,136 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-11-16 12:17:23,136 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is not cut-off event [2022-11-16 12:17:23,136 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-11-16 12:17:23,136 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is not cut-off event [2022-11-16 12:17:23,155 INFO L130 PetriNetUnfolder]: 56/1135 cut-off events. [2022-11-16 12:17:23,156 INFO L131 PetriNetUnfolder]: For 24/27 co-relation queries the response was YES. [2022-11-16 12:17:23,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1135 events. 56/1135 cut-off events. For 24/27 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6674 event pairs, 6 based on Foata normal form. 3/1071 useless extension candidates. Maximal degree in co-relation 1268. Up to 79 conditions per place. [2022-11-16 12:17:23,161 INFO L137 encePairwiseOnDemand]: 316/322 looper letters, 0 selfloop transitions, 0 changer transitions 277/277 dead transitions. [2022-11-16 12:17:23,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 277 transitions, 668 flow [2022-11-16 12:17:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:17:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2022-11-16 12:17:23,164 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2022-11-16 12:17:23,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 910 transitions. [2022-11-16 12:17:23,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 910 transitions. [2022-11-16 12:17:23,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:17:23,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 910 transitions. [2022-11-16 12:17:23,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:23,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:23,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:23,170 INFO L175 Difference]: Start difference. First operand has 277 places, 278 transitions, 644 flow. Second operand 3 states and 910 transitions. [2022-11-16 12:17:23,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 277 transitions, 668 flow [2022-11-16 12:17:23,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 277 transitions, 667 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:17:23,175 INFO L231 Difference]: Finished difference. Result has 275 places, 0 transitions, 0 flow [2022-11-16 12:17:23,175 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=275, PETRI_TRANSITIONS=0} [2022-11-16 12:17:23,176 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -15 predicate places. [2022-11-16 12:17:23,176 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 0 transitions, 0 flow [2022-11-16 12:17:23,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:23,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (51 of 52 remaining) [2022-11-16 12:17:23,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2022-11-16 12:17:23,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2022-11-16 12:17:23,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2022-11-16 12:17:23,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2022-11-16 12:17:23,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2022-11-16 12:17:23,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining) [2022-11-16 12:17:23,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2022-11-16 12:17:23,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2022-11-16 12:17:23,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2022-11-16 12:17:23,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2022-11-16 12:17:23,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2022-11-16 12:17:23,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2022-11-16 12:17:23,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2022-11-16 12:17:23,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2022-11-16 12:17:23,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2022-11-16 12:17:23,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2022-11-16 12:17:23,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2022-11-16 12:17:23,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2022-11-16 12:17:23,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2022-11-16 12:17:23,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2022-11-16 12:17:23,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2022-11-16 12:17:23,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2022-11-16 12:17:23,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2022-11-16 12:17:23,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2022-11-16 12:17:23,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2022-11-16 12:17:23,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2022-11-16 12:17:23,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2022-11-16 12:17:23,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2022-11-16 12:17:23,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2022-11-16 12:17:23,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2022-11-16 12:17:23,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2022-11-16 12:17:23,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 52 remaining) [2022-11-16 12:17:23,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 52 remaining) [2022-11-16 12:17:23,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2022-11-16 12:17:23,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2022-11-16 12:17:23,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2022-11-16 12:17:23,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2022-11-16 12:17:23,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2022-11-16 12:17:23,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2022-11-16 12:17:23,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2022-11-16 12:17:23,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2022-11-16 12:17:23,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2022-11-16 12:17:23,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2022-11-16 12:17:23,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2022-11-16 12:17:23,189 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2022-11-16 12:17:23,189 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2022-11-16 12:17:23,189 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2022-11-16 12:17:23,189 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2022-11-16 12:17:23,189 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2022-11-16 12:17:23,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2022-11-16 12:17:23,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2022-11-16 12:17:23,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:17:23,191 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:23,196 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:17:23,196 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:17:23,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:17:23 BasicIcfg [2022-11-16 12:17:23,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:17:23,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:17:23,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:17:23,202 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:17:23,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:15" (3/4) ... [2022-11-16 12:17:23,205 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 12:17:23,211 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-16 12:17:23,211 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-16 12:17:23,216 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-16 12:17:23,217 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-16 12:17:23,217 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 12:17:23,217 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 12:17:23,255 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:17:23,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:17:23,256 INFO L158 Benchmark]: Toolchain (without parser) took 9305.29ms. Allocated memory was 113.2MB in the beginning and 247.5MB in the end (delta: 134.2MB). Free memory was 75.8MB in the beginning and 192.3MB in the end (delta: -116.5MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2022-11-16 12:17:23,256 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 113.2MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:17:23,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.93ms. Allocated memory is still 113.2MB. Free memory was 75.6MB in the beginning and 87.3MB in the end (delta: -11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:17:23,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.68ms. Allocated memory is still 113.2MB. Free memory was 87.3MB in the beginning and 84.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:17:23,257 INFO L158 Benchmark]: Boogie Preprocessor took 77.39ms. Allocated memory is still 113.2MB. Free memory was 84.9MB in the beginning and 83.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:17:23,257 INFO L158 Benchmark]: RCFGBuilder took 911.78ms. Allocated memory is still 113.2MB. Free memory was 83.1MB in the beginning and 60.3MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-16 12:17:23,258 INFO L158 Benchmark]: TraceAbstraction took 7727.26ms. Allocated memory was 113.2MB in the beginning and 247.5MB in the end (delta: 134.2MB). Free memory was 59.6MB in the beginning and 196.5MB in the end (delta: -136.9MB). Peak memory consumption was 125.9MB. Max. memory is 16.1GB. [2022-11-16 12:17:23,258 INFO L158 Benchmark]: Witness Printer took 53.63ms. Allocated memory is still 247.5MB. Free memory was 196.5MB in the beginning and 192.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:17:23,260 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 113.2MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.93ms. Allocated memory is still 113.2MB. Free memory was 75.6MB in the beginning and 87.3MB in the end (delta: -11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.68ms. Allocated memory is still 113.2MB. Free memory was 87.3MB in the beginning and 84.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.39ms. Allocated memory is still 113.2MB. Free memory was 84.9MB in the beginning and 83.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 911.78ms. Allocated memory is still 113.2MB. Free memory was 83.1MB in the beginning and 60.3MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7727.26ms. Allocated memory was 113.2MB in the beginning and 247.5MB in the end (delta: 134.2MB). Free memory was 59.6MB in the beginning and 196.5MB in the end (delta: -136.9MB). Peak memory consumption was 125.9MB. Max. memory is 16.1GB. * Witness Printer took 53.63ms. Allocated memory is still 247.5MB. Free memory was 196.5MB in the beginning and 192.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 455 locations, 52 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 323 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 166 mSDtfsCounter, 323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=655occurred in iteration=16, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1289 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1271 ConstructedInterpolants, 0 QuantifiedInterpolants, 1465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-16 12:17:23,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9228d14d-2d22-4566-a8e5-766305702a4a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE