./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix004.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/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_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix004.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 --- 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 11:31:47,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:31:47,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:31:47,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:31:47,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:31:47,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:31:47,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:31:47,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:31:47,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:31:47,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:31:47,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:31:47,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:31:47,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:31:47,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:31:47,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:31:47,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:31:47,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:31:47,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:31:47,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:31:47,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:31:47,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:31:47,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:31:47,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:31:47,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:31:47,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:31:47,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:31:47,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:31:47,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:31:47,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:31:47,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:31:47,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:31:47,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:31:47,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:31:47,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:31:47,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:31:47,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:31:47,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:31:47,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:31:47,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:31:47,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:31:47,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:31:47,522 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:31:47,568 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:31:47,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:31:47,569 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:31:47,569 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:31:47,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:31:47,571 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:31:47,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:31:47,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:31:47,572 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:31:47,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:31:47,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:31:47,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:31:47,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:31:47,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:31:47,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:31:47,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:31:47,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:31:47,575 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:31:47,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:31:47,575 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:31:47,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:31:47,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:31:47,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:31:47,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:31:47,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:31:47,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:31:47,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:31:47,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:31:47,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:31:47,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:31:47,577 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:31:47,578 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:31:47,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:31:47,578 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_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/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_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/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 ! call(reach_error())) ) 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 -> 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 [2022-11-16 11:31:47,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:31:47,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:31:47,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:31:47,938 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:31:47,939 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:31:47,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix004.oepc.i [2022-11-16 11:31:48,020 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/data/8a3cafbef/ae4823bc59904e9486b035a9f7663844/FLAG0901b3bdf [2022-11-16 11:31:48,765 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:31:48,766 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/sv-benchmarks/c/pthread-wmm/mix004.oepc.i [2022-11-16 11:31:48,788 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/data/8a3cafbef/ae4823bc59904e9486b035a9f7663844/FLAG0901b3bdf [2022-11-16 11:31:49,018 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/data/8a3cafbef/ae4823bc59904e9486b035a9f7663844 [2022-11-16 11:31:49,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:31:49,022 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:31:49,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:31:49,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:31:49,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:31:49,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b2dc186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49, skipping insertion in model container [2022-11-16 11:31:49,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:31:49,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:31:49,303 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_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/sv-benchmarks/c/pthread-wmm/mix004.oepc.i[945,958] [2022-11-16 11:31:49,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:31:49,581 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:31:49,598 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_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/sv-benchmarks/c/pthread-wmm/mix004.oepc.i[945,958] [2022-11-16 11:31:49,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:31:49,732 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:31:49,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49 WrapperNode [2022-11-16 11:31:49,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:31:49,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:31:49,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:31:49,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:31:49,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,832 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-11-16 11:31:49,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:31:49,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:31:49,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:31:49,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:31:49,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,901 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:31:49,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:31:49,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:31:49,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:31:49,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (1/1) ... [2022-11-16 11:31:49,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:31:49,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:31:49,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:31:49,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bfc59ca-5eeb-4f26-9520-d95f5a0d6fd7/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:31:50,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:31:50,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:31:50,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:31:50,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:31:50,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:31:50,023 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:31:50,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:31:50,024 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:31:50,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:31:50,025 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:31:50,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:31:50,025 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 11:31:50,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 11:31:50,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:31:50,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:31:50,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:31:50,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:31:50,028 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 11:31:50,266 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:31:50,281 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:31:50,768 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:31:51,034 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:31:51,035 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:31:51,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:31:51 BoogieIcfgContainer [2022-11-16 11:31:51,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:31:51,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:31:51,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:31:51,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:31:51,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:31:49" (1/3) ... [2022-11-16 11:31:51,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109fe75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:31:51, skipping insertion in model container [2022-11-16 11:31:51,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:31:49" (2/3) ... [2022-11-16 11:31:51,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109fe75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:31:51, skipping insertion in model container [2022-11-16 11:31:51,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:31:51" (3/3) ... [2022-11-16 11:31:51,080 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.oepc.i [2022-11-16 11:31:51,091 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:31:51,104 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:31:51,104 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:31:51,104 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:31:51,212 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:31:51,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2022-11-16 11:31:51,348 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2022-11-16 11:31:51,349 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:31:51,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-16 11:31:51,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2022-11-16 11:31:51,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2022-11-16 11:31:51,379 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:31:51,386 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;@43a0d80d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:31:51,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 11:31:51,398 INFO L130 PetriNetUnfolder]: 0/53 cut-off events. [2022-11-16 11:31:51,398 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:31:51,399 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:31:51,399 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 11:31:51,400 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:31:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:31:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1322941922, now seen corresponding path program 1 times [2022-11-16 11:31:51,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:31:51,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593134036] [2022-11-16 11:31:51,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:31:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:31:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:31:52,119 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 11:31:52,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:31:52,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593134036] [2022-11-16 11:31:52,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593134036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:31:52,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:31:52,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:31:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790874992] [2022-11-16 11:31:52,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:31:52,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:31:52,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:31:52,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:31:52,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:31:52,193 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 141 [2022-11-16 11:31:52,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 11:31:52,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:31:52,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 141 [2022-11-16 11:31:52,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:31:52,661 INFO L130 PetriNetUnfolder]: 162/551 cut-off events. [2022-11-16 11:31:52,661 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-16 11:31:52,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 551 events. 162/551 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2902 event pairs, 34 based on Foata normal form. 53/575 useless extension candidates. Maximal degree in co-relation 797. Up to 191 conditions per place. [2022-11-16 11:31:52,680 INFO L137 encePairwiseOnDemand]: 136/141 looper letters, 18 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2022-11-16 11:31:52,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 141 transitions, 343 flow [2022-11-16 11:31:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:31:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:31:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2022-11-16 11:31:52,709 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9456264775413712 [2022-11-16 11:31:52,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2022-11-16 11:31:52,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2022-11-16 11:31:52,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:31:52,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2022-11-16 11:31:52,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states 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 11:31:52,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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 11:31:52,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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 11:31:52,743 INFO L175 Difference]: Start difference. First operand has 148 places, 137 transitions, 286 flow. Second operand 3 states and 400 transitions. [2022-11-16 11:31:52,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 141 transitions, 343 flow [2022-11-16 11:31:52,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 141 transitions, 336 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:31:52,754 INFO L231 Difference]: Finished difference. Result has 144 places, 133 transitions, 278 flow [2022-11-16 11:31:52,757 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=144, PETRI_TRANSITIONS=133} [2022-11-16 11:31:52,762 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, -4 predicate places. [2022-11-16 11:31:52,762 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 133 transitions, 278 flow [2022-11-16 11:31:52,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 11:31:52,763 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:31:52,764 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] [2022-11-16 11:31:52,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:31:52,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:31:52,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:31:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash 101420100, now seen corresponding path program 1 times [2022-11-16 11:31:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:31:52,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771521421] [2022-11-16 11:31:52,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:31:52,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:31:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:31:53,416 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 11:31:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:31:53,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771521421] [2022-11-16 11:31:53,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771521421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:31:53,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:31:53,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:31:53,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769482704] [2022-11-16 11:31:53,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:31:53,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:31:53,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:31:53,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:31:53,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:31:53,426 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2022-11-16 11:31:53,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states 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 11:31:53,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:31:53,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2022-11-16 11:31:53,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:31:57,184 INFO L130 PetriNetUnfolder]: 6975/15709 cut-off events. [2022-11-16 11:31:57,185 INFO L131 PetriNetUnfolder]: For 634/634 co-relation queries the response was YES. [2022-11-16 11:31:57,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26007 conditions, 15709 events. 6975/15709 cut-off events. For 634/634 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 153145 event pairs, 3289 based on Foata normal form. 0/15425 useless extension candidates. Maximal degree in co-relation 25943. Up to 5944 conditions per place. [2022-11-16 11:31:57,307 INFO L137 encePairwiseOnDemand]: 132/141 looper letters, 32 selfloop transitions, 5 changer transitions 71/199 dead transitions. [2022-11-16 11:31:57,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 199 transitions, 620 flow [2022-11-16 11:31:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:31:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:31:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1069 transitions. [2022-11-16 11:31:57,311 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8423955870764381 [2022-11-16 11:31:57,312 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1069 transitions. [2022-11-16 11:31:57,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1069 transitions. [2022-11-16 11:31:57,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:31:57,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1069 transitions. [2022-11-16 11:31:57,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states 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 11:31:57,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 11:31:57,320 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 11:31:57,320 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 9 states and 1069 transitions. [2022-11-16 11:31:57,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 199 transitions, 620 flow [2022-11-16 11:31:57,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 199 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:31:57,326 INFO L231 Difference]: Finished difference. Result has 157 places, 123 transitions, 315 flow [2022-11-16 11:31:57,326 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=315, PETRI_PLACES=157, PETRI_TRANSITIONS=123} [2022-11-16 11:31:57,327 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 9 predicate places. [2022-11-16 11:31:57,327 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 123 transitions, 315 flow [2022-11-16 11:31:57,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states 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 11:31:57,328 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:31:57,328 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:31:57,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:31:57,329 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:31:57,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:31:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash -244441240, now seen corresponding path program 1 times [2022-11-16 11:31:57,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:31:57,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419272433] [2022-11-16 11:31:57,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:31:57,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:31:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:31:57,772 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 11:31:57,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:31:57,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419272433] [2022-11-16 11:31:57,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419272433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:31:57,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:31:57,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:31:57,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161473939] [2022-11-16 11:31:57,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:31:57,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:31:57,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:31:57,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:31:57,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:31:57,777 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 141 [2022-11-16 11:31:57,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 123 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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 11:31:57,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:31:57,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 141 [2022-11-16 11:31:57,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:31:59,422 INFO L130 PetriNetUnfolder]: 2984/5341 cut-off events. [2022-11-16 11:31:59,422 INFO L131 PetriNetUnfolder]: For 6302/6410 co-relation queries the response was YES. [2022-11-16 11:31:59,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14176 conditions, 5341 events. 2984/5341 cut-off events. For 6302/6410 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 37801 event pairs, 862 based on Foata normal form. 136/5256 useless extension candidates. Maximal degree in co-relation 14110. Up to 1968 conditions per place. [2022-11-16 11:31:59,487 INFO L137 encePairwiseOnDemand]: 135/141 looper letters, 22 selfloop transitions, 3 changer transitions 40/168 dead transitions. [2022-11-16 11:31:59,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 168 transitions, 577 flow [2022-11-16 11:31:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:31:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:31:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1119 transitions. [2022-11-16 11:31:59,497 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8817966903073287 [2022-11-16 11:31:59,497 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1119 transitions. [2022-11-16 11:31:59,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1119 transitions. [2022-11-16 11:31:59,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:31:59,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1119 transitions. [2022-11-16 11:31:59,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states 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 11:31:59,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 11:31:59,507 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 11:31:59,507 INFO L175 Difference]: Start difference. First operand has 157 places, 123 transitions, 315 flow. Second operand 9 states and 1119 transitions. [2022-11-16 11:31:59,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 168 transitions, 577 flow [2022-11-16 11:31:59,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 168 transitions, 558 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-11-16 11:31:59,578 INFO L231 Difference]: Finished difference. Result has 148 places, 123 transitions, 327 flow [2022-11-16 11:31:59,579 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=148, PETRI_TRANSITIONS=123} [2022-11-16 11:31:59,582 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 0 predicate places. [2022-11-16 11:31:59,582 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 123 transitions, 327 flow [2022-11-16 11:31:59,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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 11:31:59,583 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:31:59,584 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:31:59,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:31:59,584 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:31:59,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:31:59,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1814984533, now seen corresponding path program 1 times [2022-11-16 11:31:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:31:59,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102348102] [2022-11-16 11:31:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:31:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:31:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:00,042 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 11:32:00,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:00,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102348102] [2022-11-16 11:32:00,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102348102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:00,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:00,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:32:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978484921] [2022-11-16 11:32:00,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:00,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:32:00,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:00,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:32:00,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:32:00,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2022-11-16 11:32:00,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 123 transitions, 327 flow. Second operand has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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 11:32:00,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:00,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2022-11-16 11:32:00,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:01,950 INFO L130 PetriNetUnfolder]: 4062/6727 cut-off events. [2022-11-16 11:32:01,951 INFO L131 PetriNetUnfolder]: For 12800/12800 co-relation queries the response was YES. [2022-11-16 11:32:01,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19789 conditions, 6727 events. 4062/6727 cut-off events. For 12800/12800 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 43196 event pairs, 1180 based on Foata normal form. 144/6643 useless extension candidates. Maximal degree in co-relation 19713. Up to 3209 conditions per place. [2022-11-16 11:32:02,023 INFO L137 encePairwiseOnDemand]: 135/141 looper letters, 39 selfloop transitions, 3 changer transitions 58/191 dead transitions. [2022-11-16 11:32:02,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 191 transitions, 840 flow [2022-11-16 11:32:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:32:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:32:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1070 transitions. [2022-11-16 11:32:02,029 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.843183609141056 [2022-11-16 11:32:02,031 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1070 transitions. [2022-11-16 11:32:02,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1070 transitions. [2022-11-16 11:32:02,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:02,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1070 transitions. [2022-11-16 11:32:02,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.88888888888889) internal successors, (1070), 9 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states 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 11:32:02,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 11:32:02,044 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states 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 11:32:02,044 INFO L175 Difference]: Start difference. First operand has 148 places, 123 transitions, 327 flow. Second operand 9 states and 1070 transitions. [2022-11-16 11:32:02,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 191 transitions, 840 flow [2022-11-16 11:32:02,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 191 transitions, 804 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-16 11:32:02,115 INFO L231 Difference]: Finished difference. Result has 149 places, 123 transitions, 332 flow [2022-11-16 11:32:02,121 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=332, PETRI_PLACES=149, PETRI_TRANSITIONS=123} [2022-11-16 11:32:02,122 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 1 predicate places. [2022-11-16 11:32:02,123 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 123 transitions, 332 flow [2022-11-16 11:32:02,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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 11:32:02,124 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:02,124 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] [2022-11-16 11:32:02,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:32:02,125 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:02,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1915365088, now seen corresponding path program 1 times [2022-11-16 11:32:02,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:02,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352554697] [2022-11-16 11:32:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:02,634 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 11:32:02,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:02,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352554697] [2022-11-16 11:32:02,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352554697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:02,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:02,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:32:02,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311394761] [2022-11-16 11:32:02,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:02,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:32:02,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:02,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:32:02,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:32:02,638 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-16 11:32:02,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 123 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 11:32:02,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:02,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-16 11:32:02,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:05,749 INFO L130 PetriNetUnfolder]: 7696/13912 cut-off events. [2022-11-16 11:32:05,749 INFO L131 PetriNetUnfolder]: For 4162/4335 co-relation queries the response was YES. [2022-11-16 11:32:05,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28488 conditions, 13912 events. 7696/13912 cut-off events. For 4162/4335 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 115207 event pairs, 549 based on Foata normal form. 0/13337 useless extension candidates. Maximal degree in co-relation 28416. Up to 3955 conditions per place. [2022-11-16 11:32:05,877 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 79 selfloop transitions, 18 changer transitions 8/205 dead transitions. [2022-11-16 11:32:05,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 205 transitions, 712 flow [2022-11-16 11:32:05,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:32:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:32:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1247 transitions. [2022-11-16 11:32:05,882 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8843971631205674 [2022-11-16 11:32:05,882 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1247 transitions. [2022-11-16 11:32:05,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1247 transitions. [2022-11-16 11:32:05,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:05,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1247 transitions. [2022-11-16 11:32:05,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.7) internal successors, (1247), 10 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states 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 11:32:05,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states 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 11:32:05,891 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states 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 11:32:05,892 INFO L175 Difference]: Start difference. First operand has 149 places, 123 transitions, 332 flow. Second operand 10 states and 1247 transitions. [2022-11-16 11:32:05,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 205 transitions, 712 flow [2022-11-16 11:32:05,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 205 transitions, 694 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-16 11:32:05,921 INFO L231 Difference]: Finished difference. Result has 150 places, 139 transitions, 446 flow [2022-11-16 11:32:05,921 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=446, PETRI_PLACES=150, PETRI_TRANSITIONS=139} [2022-11-16 11:32:05,925 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 2 predicate places. [2022-11-16 11:32:05,925 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 139 transitions, 446 flow [2022-11-16 11:32:05,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 11:32:05,926 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:05,926 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:05,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:32:05,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:05,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:05,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1110608078, now seen corresponding path program 1 times [2022-11-16 11:32:05,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:05,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203212525] [2022-11-16 11:32:05,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:05,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:06,396 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 11:32:06,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:06,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203212525] [2022-11-16 11:32:06,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203212525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:06,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:06,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:32:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468548323] [2022-11-16 11:32:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:06,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:32:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:06,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:32:06,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:32:06,400 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-16 11:32:06,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 139 transitions, 446 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states 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 11:32:06,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:06,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-16 11:32:06,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:09,745 INFO L130 PetriNetUnfolder]: 7382/13607 cut-off events. [2022-11-16 11:32:09,745 INFO L131 PetriNetUnfolder]: For 15033/15184 co-relation queries the response was YES. [2022-11-16 11:32:09,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37372 conditions, 13607 events. 7382/13607 cut-off events. For 15033/15184 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 116252 event pairs, 481 based on Foata normal form. 236/13496 useless extension candidates. Maximal degree in co-relation 37299. Up to 2698 conditions per place. [2022-11-16 11:32:09,839 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 110 selfloop transitions, 36 changer transitions 0/246 dead transitions. [2022-11-16 11:32:09,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 246 transitions, 1158 flow [2022-11-16 11:32:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:32:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:32:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1624 transitions. [2022-11-16 11:32:09,845 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8859792689579924 [2022-11-16 11:32:09,845 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1624 transitions. [2022-11-16 11:32:09,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1624 transitions. [2022-11-16 11:32:09,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:09,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1624 transitions. [2022-11-16 11:32:09,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 124.92307692307692) internal successors, (1624), 13 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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 11:32:09,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 141.0) internal successors, (1974), 14 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states 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 11:32:09,857 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 141.0) internal successors, (1974), 14 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states 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 11:32:09,857 INFO L175 Difference]: Start difference. First operand has 150 places, 139 transitions, 446 flow. Second operand 13 states and 1624 transitions. [2022-11-16 11:32:09,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 246 transitions, 1158 flow [2022-11-16 11:32:09,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 246 transitions, 1156 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:32:09,960 INFO L231 Difference]: Finished difference. Result has 167 places, 159 transitions, 731 flow [2022-11-16 11:32:09,961 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=731, PETRI_PLACES=167, PETRI_TRANSITIONS=159} [2022-11-16 11:32:09,962 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 19 predicate places. [2022-11-16 11:32:09,962 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 159 transitions, 731 flow [2022-11-16 11:32:09,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states 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 11:32:09,963 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:09,963 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] [2022-11-16 11:32:09,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:32:09,964 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1762118274, now seen corresponding path program 1 times [2022-11-16 11:32:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:09,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775646291] [2022-11-16 11:32:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:10,523 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 11:32:10,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:10,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775646291] [2022-11-16 11:32:10,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775646291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:10,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:10,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:32:10,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459880220] [2022-11-16 11:32:10,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:10,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:32:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:10,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:32:10,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:32:10,534 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-16 11:32:10,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 159 transitions, 731 flow. Second operand has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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 11:32:10,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:10,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-16 11:32:10,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:12,945 INFO L130 PetriNetUnfolder]: 2911/9275 cut-off events. [2022-11-16 11:32:12,945 INFO L131 PetriNetUnfolder]: For 25401/35460 co-relation queries the response was YES. [2022-11-16 11:32:13,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29532 conditions, 9275 events. 2911/9275 cut-off events. For 25401/35460 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 109298 event pairs, 325 based on Foata normal form. 209/8877 useless extension candidates. Maximal degree in co-relation 29450. Up to 2012 conditions per place. [2022-11-16 11:32:13,056 INFO L137 encePairwiseOnDemand]: 135/141 looper letters, 58 selfloop transitions, 5 changer transitions 0/199 dead transitions. [2022-11-16 11:32:13,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 199 transitions, 962 flow [2022-11-16 11:32:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:32:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:32:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-11-16 11:32:13,061 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2022-11-16 11:32:13,061 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2022-11-16 11:32:13,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2022-11-16 11:32:13,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:13,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2022-11-16 11:32:13,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states 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 11:32:13,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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 11:32:13,069 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states 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 11:32:13,069 INFO L175 Difference]: Start difference. First operand has 167 places, 159 transitions, 731 flow. Second operand 7 states and 861 transitions. [2022-11-16 11:32:13,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 199 transitions, 962 flow [2022-11-16 11:32:13,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 199 transitions, 869 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-11-16 11:32:13,744 INFO L231 Difference]: Finished difference. Result has 174 places, 163 transitions, 685 flow [2022-11-16 11:32:13,745 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=685, PETRI_PLACES=174, PETRI_TRANSITIONS=163} [2022-11-16 11:32:13,745 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 26 predicate places. [2022-11-16 11:32:13,746 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 163 transitions, 685 flow [2022-11-16 11:32:13,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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 11:32:13,746 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:13,747 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] [2022-11-16 11:32:13,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:32:13,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:13,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:13,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2122349288, now seen corresponding path program 2 times [2022-11-16 11:32:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:13,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432007102] [2022-11-16 11:32:13,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:14,213 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 11:32:14,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:14,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432007102] [2022-11-16 11:32:14,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432007102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:14,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:14,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:32:14,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845465397] [2022-11-16 11:32:14,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:14,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:32:14,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:14,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:32:14,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:32:14,222 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-16 11:32:14,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 163 transitions, 685 flow. Second operand has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states 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 11:32:14,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:14,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-16 11:32:14,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:18,993 INFO L130 PetriNetUnfolder]: 12753/23258 cut-off events. [2022-11-16 11:32:18,993 INFO L131 PetriNetUnfolder]: For 44072/44348 co-relation queries the response was YES. [2022-11-16 11:32:19,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70678 conditions, 23258 events. 12753/23258 cut-off events. For 44072/44348 co-relation queries the response was YES. Maximal size of possible extension queue 1572. Compared 216601 event pairs, 738 based on Foata normal form. 258/22873 useless extension candidates. Maximal degree in co-relation 70593. Up to 2882 conditions per place. [2022-11-16 11:32:19,187 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 108 selfloop transitions, 56 changer transitions 27/295 dead transitions. [2022-11-16 11:32:19,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 295 transitions, 1745 flow [2022-11-16 11:32:19,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:32:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 11:32:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2002 transitions. [2022-11-16 11:32:19,195 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8874113475177305 [2022-11-16 11:32:19,195 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2002 transitions. [2022-11-16 11:32:19,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2002 transitions. [2022-11-16 11:32:19,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:19,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2002 transitions. [2022-11-16 11:32:19,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 125.125) internal successors, (2002), 16 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states 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 11:32:19,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 141.0) internal successors, (2397), 17 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states 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 11:32:19,211 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 141.0) internal successors, (2397), 17 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states 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 11:32:19,212 INFO L175 Difference]: Start difference. First operand has 174 places, 163 transitions, 685 flow. Second operand 16 states and 2002 transitions. [2022-11-16 11:32:19,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 295 transitions, 1745 flow [2022-11-16 11:32:20,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 295 transitions, 1742 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-16 11:32:20,550 INFO L231 Difference]: Finished difference. Result has 192 places, 189 transitions, 1139 flow [2022-11-16 11:32:20,550 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1139, PETRI_PLACES=192, PETRI_TRANSITIONS=189} [2022-11-16 11:32:20,551 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 44 predicate places. [2022-11-16 11:32:20,551 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 189 transitions, 1139 flow [2022-11-16 11:32:20,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states 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 11:32:20,552 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:20,552 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:20,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:32:20,553 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:20,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:20,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1731427727, now seen corresponding path program 1 times [2022-11-16 11:32:20,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:20,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381413114] [2022-11-16 11:32:20,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:20,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:21,717 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 11:32:21,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:21,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381413114] [2022-11-16 11:32:21,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381413114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:21,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:21,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 11:32:21,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863812564] [2022-11-16 11:32:21,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:21,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:32:21,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:21,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:32:21,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:32:21,721 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 141 [2022-11-16 11:32:21,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 189 transitions, 1139 flow. Second operand has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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 11:32:21,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:21,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 141 [2022-11-16 11:32:21,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:24,289 INFO L130 PetriNetUnfolder]: 4492/14512 cut-off events. [2022-11-16 11:32:24,289 INFO L131 PetriNetUnfolder]: For 74262/79297 co-relation queries the response was YES. [2022-11-16 11:32:24,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55377 conditions, 14512 events. 4492/14512 cut-off events. For 74262/79297 co-relation queries the response was YES. Maximal size of possible extension queue 1715. Compared 192267 event pairs, 127 based on Foata normal form. 11/13619 useless extension candidates. Maximal degree in co-relation 55280. Up to 3536 conditions per place. [2022-11-16 11:32:24,435 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 46 selfloop transitions, 13 changer transitions 25/246 dead transitions. [2022-11-16 11:32:24,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 246 transitions, 1549 flow [2022-11-16 11:32:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:32:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:32:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1193 transitions. [2022-11-16 11:32:24,440 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8460992907801419 [2022-11-16 11:32:24,440 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1193 transitions. [2022-11-16 11:32:24,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1193 transitions. [2022-11-16 11:32:24,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:24,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1193 transitions. [2022-11-16 11:32:24,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.3) internal successors, (1193), 10 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states 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 11:32:24,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states 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 11:32:24,448 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states 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 11:32:24,449 INFO L175 Difference]: Start difference. First operand has 192 places, 189 transitions, 1139 flow. Second operand 10 states and 1193 transitions. [2022-11-16 11:32:24,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 246 transitions, 1549 flow [2022-11-16 11:32:28,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 246 transitions, 1242 flow, removed 114 selfloop flow, removed 11 redundant places. [2022-11-16 11:32:28,763 INFO L231 Difference]: Finished difference. Result has 196 places, 200 transitions, 897 flow [2022-11-16 11:32:28,764 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=897, PETRI_PLACES=196, PETRI_TRANSITIONS=200} [2022-11-16 11:32:28,765 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 48 predicate places. [2022-11-16 11:32:28,765 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 200 transitions, 897 flow [2022-11-16 11:32:28,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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 11:32:28,766 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:28,766 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:28,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:32:28,767 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:28,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:28,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1135819181, now seen corresponding path program 2 times [2022-11-16 11:32:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:28,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298617157] [2022-11-16 11:32:28,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:28,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:30,324 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 11:32:30,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:30,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298617157] [2022-11-16 11:32:30,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298617157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:30,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:30,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:32:30,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595469777] [2022-11-16 11:32:30,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:30,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:32:30,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:30,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:32:30,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:32:30,328 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 141 [2022-11-16 11:32:30,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 200 transitions, 897 flow. Second operand has 12 states, 12 states have (on average 101.91666666666667) internal successors, (1223), 12 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states 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 11:32:30,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:30,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 141 [2022-11-16 11:32:30,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:35,820 INFO L130 PetriNetUnfolder]: 10677/33775 cut-off events. [2022-11-16 11:32:35,820 INFO L131 PetriNetUnfolder]: For 50659/51343 co-relation queries the response was YES. [2022-11-16 11:32:36,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90126 conditions, 33775 events. 10677/33775 cut-off events. For 50659/51343 co-relation queries the response was YES. Maximal size of possible extension queue 3671. Compared 504026 event pairs, 187 based on Foata normal form. 27/31939 useless extension candidates. Maximal degree in co-relation 90019. Up to 3285 conditions per place. [2022-11-16 11:32:36,105 INFO L137 encePairwiseOnDemand]: 121/141 looper letters, 95 selfloop transitions, 33 changer transitions 35/307 dead transitions. [2022-11-16 11:32:36,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 307 transitions, 1843 flow [2022-11-16 11:32:36,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:32:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 11:32:36,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1820 transitions. [2022-11-16 11:32:36,111 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592824363788069 [2022-11-16 11:32:36,111 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1820 transitions. [2022-11-16 11:32:36,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1820 transitions. [2022-11-16 11:32:36,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:36,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1820 transitions. [2022-11-16 11:32:36,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 107.05882352941177) internal successors, (1820), 17 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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 11:32:36,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 141.0) internal successors, (2538), 18 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states 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 11:32:36,124 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 141.0) internal successors, (2538), 18 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states 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 11:32:36,124 INFO L175 Difference]: Start difference. First operand has 196 places, 200 transitions, 897 flow. Second operand 17 states and 1820 transitions. [2022-11-16 11:32:36,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 307 transitions, 1843 flow [2022-11-16 11:32:43,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 307 transitions, 1778 flow, removed 32 selfloop flow, removed 7 redundant places. [2022-11-16 11:32:43,987 INFO L231 Difference]: Finished difference. Result has 209 places, 218 transitions, 1145 flow [2022-11-16 11:32:43,987 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1145, PETRI_PLACES=209, PETRI_TRANSITIONS=218} [2022-11-16 11:32:43,988 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 61 predicate places. [2022-11-16 11:32:43,988 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 218 transitions, 1145 flow [2022-11-16 11:32:43,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 101.91666666666667) internal successors, (1223), 12 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states 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 11:32:43,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:43,990 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:43,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:32:43,990 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:43,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2063728775, now seen corresponding path program 3 times [2022-11-16 11:32:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:43,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649427704] [2022-11-16 11:32:43,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:45,004 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 11:32:45,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:45,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649427704] [2022-11-16 11:32:45,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649427704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:45,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:45,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:32:45,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837139478] [2022-11-16 11:32:45,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:45,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:32:45,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:45,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:32:45,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:32:45,008 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 141 [2022-11-16 11:32:45,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 218 transitions, 1145 flow. Second operand has 11 states, 11 states have (on average 113.18181818181819) internal successors, (1245), 11 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states 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 11:32:45,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:45,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 141 [2022-11-16 11:32:45,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:50,703 INFO L130 PetriNetUnfolder]: 11258/34713 cut-off events. [2022-11-16 11:32:50,704 INFO L131 PetriNetUnfolder]: For 54196/56987 co-relation queries the response was YES. [2022-11-16 11:32:50,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93999 conditions, 34713 events. 11258/34713 cut-off events. For 54196/56987 co-relation queries the response was YES. Maximal size of possible extension queue 4234. Compared 521454 event pairs, 139 based on Foata normal form. 232/32733 useless extension candidates. Maximal degree in co-relation 93890. Up to 3692 conditions per place. [2022-11-16 11:32:51,002 INFO L137 encePairwiseOnDemand]: 129/141 looper letters, 52 selfloop transitions, 26 changer transitions 13/259 dead transitions. [2022-11-16 11:32:51,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 259 transitions, 1599 flow [2022-11-16 11:32:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:32:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:32:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1291 transitions. [2022-11-16 11:32:51,005 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8323662153449387 [2022-11-16 11:32:51,006 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1291 transitions. [2022-11-16 11:32:51,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1291 transitions. [2022-11-16 11:32:51,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:51,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1291 transitions. [2022-11-16 11:32:51,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.36363636363636) internal successors, (1291), 11 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states 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 11:32:51,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states 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 11:32:51,016 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states 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 11:32:51,016 INFO L175 Difference]: Start difference. First operand has 209 places, 218 transitions, 1145 flow. Second operand 11 states and 1291 transitions. [2022-11-16 11:32:51,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 259 transitions, 1599 flow [2022-11-16 11:33:00,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 259 transitions, 1490 flow, removed 41 selfloop flow, removed 11 redundant places. [2022-11-16 11:33:00,900 INFO L231 Difference]: Finished difference. Result has 208 places, 225 transitions, 1221 flow [2022-11-16 11:33:00,901 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1221, PETRI_PLACES=208, PETRI_TRANSITIONS=225} [2022-11-16 11:33:00,901 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 60 predicate places. [2022-11-16 11:33:00,901 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 225 transitions, 1221 flow [2022-11-16 11:33:00,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.18181818181819) internal successors, (1245), 11 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states 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 11:33:00,902 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:00,903 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:33:00,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:33:00,903 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1935502999, now seen corresponding path program 4 times [2022-11-16 11:33:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:00,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256092759] [2022-11-16 11:33:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:00,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:01,278 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 11:33:01,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:01,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256092759] [2022-11-16 11:33:01,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256092759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:01,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:01,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 11:33:01,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708357371] [2022-11-16 11:33:01,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:01,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:33:01,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:01,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:33:01,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:33:01,281 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-16 11:33:01,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 225 transitions, 1221 flow. Second operand has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 9 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states 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 11:33:01,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:01,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-16 11:33:01,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:05,142 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][187], [18#L849true, 456#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 306#true, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 29#L790true, Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, 80#L884-1true, Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 243#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 232#true, 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-16 11:33:05,143 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-11-16 11:33:05,143 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-16 11:33:05,144 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-16 11:33:05,144 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-16 11:33:06,680 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][187], [18#L849true, 456#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, 81#L2true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 306#true, P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 29#L790true, Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 243#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 232#true, 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-16 11:33:06,681 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-11-16 11:33:06,681 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-16 11:33:06,681 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-16 11:33:06,681 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-16 11:33:08,655 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][221], [18#L849true, Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 306#true, P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, 67#L3true, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 29#L790true, Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 458#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 232#true, 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-16 11:33:08,655 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-16 11:33:08,656 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 11:33:08,656 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 11:33:08,656 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 11:33:10,453 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][221], [18#L849true, Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 306#true, P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 142#L3-1true, 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 29#L790true, Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 458#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 232#true, 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-16 11:33:10,453 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-16 11:33:10,453 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-16 11:33:10,454 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-16 11:33:10,454 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-16 11:33:11,536 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][221], [18#L849true, Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 306#true, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, 67#L3true, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 128#L797true, 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 458#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 232#true, 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-16 11:33:11,536 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-16 11:33:11,537 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-16 11:33:11,537 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-16 11:33:11,537 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-16 11:33:13,703 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][234], [139#L800true, 18#L849true, 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 306#true, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, 67#L3true, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 464#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 243#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 232#true, 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-16 11:33:13,703 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-11-16 11:33:13,703 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:33:13,703 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:33:13,703 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:33:13,799 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][221], [18#L849true, Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 306#true, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 128#L797true, Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 142#L3-1true, 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 458#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 232#true, 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-16 11:33:13,799 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-11-16 11:33:13,799 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:33:13,799 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:33:13,800 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:33:15,591 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][362], [139#L800true, 18#L849true, 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 306#true, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, 67#L3true, P1Thread1of1ForFork3InUse, Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 468#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 132#L780true, Black: 209#(= ~__unbuffered_p2_EAX~0 0), Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 232#true, 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-16 11:33:15,591 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-11-16 11:33:15,591 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-16 11:33:15,591 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-16 11:33:15,591 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-16 11:33:15,880 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][234], [139#L800true, 18#L849true, 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 306#true, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 142#L3-1true, 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 464#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 243#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 232#true, 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-16 11:33:15,880 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-11-16 11:33:15,880 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-16 11:33:15,880 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-16 11:33:15,880 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event